Cyclic job shop scheduling problems with blocking

Autor(en): Brucker, Peter
Kampmeyer, Thomas
Stichwörter: blocking; cyclic job shop problem; Operations Research & Management Science; tabu search
Erscheinungsdatum: 2008
Herausgeber: SPRINGER
Journal: ANNALS OF OPERATIONS RESEARCH
Volumen: 159
Ausgabe: 1
Startseite: 161
Seitenende: 181
Zusammenfassung: 
A tabu search algorithm for a cyclic job shop problem with blocking is presented. Operations are blocking if they must stay on a machine after finishing when the next machine is occupied by another job. During this stay the machine is blocked for other jobs. For this problem traditional tabu search moves often lead to infeasible solutions. Recovering procedures are developed which construct nearby feasible solutions. Computational results are presented for the approach.
Beschreibung: 
Multidisciplinary International Scheduling Theory and Applications Conference, New York, NY, JUL 18-21, 2005
ISSN: 02545330
DOI: 10.1007/s10479-007-0276-z

Show full item record

Google ScholarTM

Check

Altmetric