This paper focuses on the single machine scheduling problem, with sequence dependent setup times. Both processing and setup times are deterministic and the objective is to minimize total earliness and tardiness penalties. The novelty of the model can be traced in the fact that the single machine is subjected to breakdowns and that, in order to increase its availability, planned maintenance tasks are also performed. Hence, jobs and maintenance tasks are jointly considered to find the optimal schedule. These features make the problem NP-hard and so, a quasi-optimal solution is searched using a recent metaheuristic, which integrates harmony search and genetic algorithms. In order to validate the proposed metaheuristic, a comprehensive set of scheduling problems was fully investigated. Obtained results, compared with those of exhaustive (for small problems) and standard metaheuristics, confirm both the robustness and the speed of the proposed approach.

Harmony search algorithm for single machine scheduling problem with planned maintenance / Zammori, FRANCESCO ALDO; Braglia, Marcello; Castellano, Davide. - In: COMPUTERS & INDUSTRIAL ENGINEERING. - ISSN 0360-8352. - 76:(2014), pp. 333-346. [10.1016/j.cie.2014.08.001]

Harmony search algorithm for single machine scheduling problem with planned maintenance

CASTELLANO, DAVIDE
2014

Abstract

This paper focuses on the single machine scheduling problem, with sequence dependent setup times. Both processing and setup times are deterministic and the objective is to minimize total earliness and tardiness penalties. The novelty of the model can be traced in the fact that the single machine is subjected to breakdowns and that, in order to increase its availability, planned maintenance tasks are also performed. Hence, jobs and maintenance tasks are jointly considered to find the optimal schedule. These features make the problem NP-hard and so, a quasi-optimal solution is searched using a recent metaheuristic, which integrates harmony search and genetic algorithms. In order to validate the proposed metaheuristic, a comprehensive set of scheduling problems was fully investigated. Obtained results, compared with those of exhaustive (for small problems) and standard metaheuristics, confirm both the robustness and the speed of the proposed approach.
2014
76
333
346
Harmony search algorithm for single machine scheduling problem with planned maintenance / Zammori, FRANCESCO ALDO; Braglia, Marcello; Castellano, Davide. - In: COMPUTERS & INDUSTRIAL ENGINEERING. - ISSN 0360-8352. - 76:(2014), pp. 333-346. [10.1016/j.cie.2014.08.001]
Zammori, FRANCESCO ALDO; Braglia, Marcello; Castellano, Davide
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/1318123
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 50
  • ???jsp.display-item.citation.isi??? 44
social impact