.png){kind=icon}
.png){kind=icon}
Return
Harmony search algorithm for single-machine scheduling problem with planned maintenance
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2014.08.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2014 Elsevier Ltd. All rights reserved.
Keywords:
Earliness-tardiness penalties
Harmony search
Metaheuristics
Planned maintenance
Scheduling
Single machine
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W