Högskolan i Skövde

his.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • apa-cv
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Non-identical parallel machines batch processing problem with release dates, due dates and variable maintenance activity to minimize total tardiness
Department of Business Development, Sepid Makian Company, Rasht, Guilan, Iran ; Department of Industrial Engineering, Payame Noor University, Tehran, Iran.ORCID iD: 0000-0003-2300-7929
Vista Samaneh Asa Company, Tehran, Iran ; Department of Computer Engineering, Islamic Azad University, Rasht, Guilan, Iran.
VRAIN - Valencian Research Institute for Artificial Intelligence, Universitat Politècnica de València, Valencia, Spain.
School of Management, Curtin Business School, Bentley, WA, Australia.
2022 (English)In: Computers & industrial engineering, ISSN 0360-8352, E-ISSN 1879-0550, Vol. 168, article id 108135Article in journal (Refereed) Published
Abstract [en]

Combination of job scheduling and maintenance activity has been widely investigated in the literature. We consider a non-identical parallel machines batch processing (BP) problem with release dates, due dates and variable maintenance activity to minimize total tardiness. An original mixed integer linear programming (MILP) model is formulated to provide an optimal solution. As the problem under investigation is known to be strongly NP-hard, two meta-heuristic approaches based on Simulated Annealing (SA) and Variable Neighborhood Search (VNS) are developed. A constructive heuristic method (H) is proposed to generate initial feasible solutions for the SA and VNS. In order to evaluate the results of the proposed solution approaches, a set of instances were randomly generated. Moreover, we compare the performance of our proposed approaches against four meta-heuristic algorithms adopted from the literature. The obtained results indicate that the proposed solution methods have a competitive behaviour and they outperform the other meta-heuristics in most instances. Although in all cases, H + SA is the most performing algorithm compared to the others.

Place, publisher, year, edition, pages
Elsevier, 2022. Vol. 168, article id 108135
Keywords [en]
Minimization of total tardiness, Parallel machines, Batch processing machines, Scheduling with maintenance activity
National Category
Reliability and Maintenance
Identifiers
URN: urn:nbn:se:his:diva-23594DOI: 10.1016/j.cie.2022.108135ISI: 000805819000007Scopus ID: 2-s2.0-85127478370OAI: oai:DiVA.org:his-23594DiVA, id: diva2:1837918
Available from: 2024-02-15 Created: 2024-02-15 Last updated: 2024-02-15Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Beldar, Pedram

Search in DiVA

By author/editor
Beldar, Pedram
In the same journal
Computers & industrial engineering
Reliability and Maintenance

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 51 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • apa-cv
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf