Tabu search algorithms for cyclic machine scheduling problems
| Autor(en): | Brucker, P Kampmeyer, T |
Stichwörter: | block approach; cyclic scheduling; Engineering; Engineering, Manufacturing; JOB SHOPS; job-shop problem; Operations Research & Management Science; opt-connectivity; tabu-search | Erscheinungsdatum: | 2005 | Herausgeber: | SPRINGER | Journal: | JOURNAL OF SCHEDULING | Volumen: | 8 | Ausgabe: | 4 | Startseite: | 303 | Seitenende: | 322 | Zusammenfassung: | Tabu search algorithms are developed for solving a large class of cyclic machine scheduling problems with the objective to minimize the cycle time. Neighborhoods are derived which generalize the block-approach based neighborhoods which have been successfully applied to noncyclic job-shop problems. For a variant of this neighborhood opt-connectivity is proved. The tabu-search procedure is applied to cyclic job-shop scheduling problems. Computational results are presented. |
Beschreibung: | 6th Workshop Models and Algorithms for Planning and Scheduling Problems, Aussois, FRANCE, MAR 30-APR 04, 2003 |
ISSN: | 10946136 | DOI: | 10.1007/s10951-005-1639-4 |
Zur Langanzeige
