Single-machine scheduling with periodic maintenance and learning effect
This paper discusses a single-machine scheduling problem with periodic maintenance activities and position-based learning effect to minimize the makespan. To obtain exact solutions of small-scale problems, one new two-stage binary integer programming model is formulated. In addition, a branch and bo...
Gespeichert in:
| Veröffentlicht in: | Scientific reports Jg. 13; H. 1; S. 9309 - 15 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
London
Nature Publishing Group UK
08.06.2023
Nature Publishing Group Nature Portfolio |
| Schlagworte: | |
| ISSN: | 2045-2322, 2045-2322 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | This paper discusses a single-machine scheduling problem with periodic maintenance activities and position-based learning effect to minimize the makespan. To obtain exact solutions of small-scale problems, one new two-stage binary integer programming model is formulated. In addition, a branch and bound algorithm combining boundary method and pruning rules is also proposed. According to the property of the optimal solution, a special search neighborhood is constructed. A hybrid genetic-tabu search algorithm based on genetic mechanism with tabu technique as an operator is proposed to solve medium-scale and large-scale problems. Moreover, to improve the efficiency of genetic algorithm and hybrid genetic-tabu search algorithm, Taguchi method is used for parameter tuning. Furthermore, computational experiments are carried out to compare the efficiency and performance of these algorithms. |
|---|---|
| Bibliographie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| ISSN: | 2045-2322 2045-2322 |
| DOI: | 10.1038/s41598-023-36056-w |