A general model for cyclic machine scheduling problems

Autor(en): Brucker, Peter
Kampmeyer, Thomas
Stichwörter: BLOCKING; cyclic scheduling problems; job shop; JOB-SHOP; Mathematics; Mathematics, Applied; mixed integer linear program; robotic cell; single hoist scheduling problems; tabu search; transportation robots
Erscheinungsdatum: 2008
Herausgeber: ELSEVIER SCIENCE BV
Journal: DISCRETE APPLIED MATHEMATICS
Volumen: 156
Ausgabe: 13
Startseite: 2561
Seitenende: 2572
Zusammenfassung: 
A general framework for modeling and solving cyclic scheduling problems is presented. The objective is to minimize the cycle time. The model covers different cyclic versions of the job-shop problem found in the literature, robotic cell problems, the single hoist scheduling problem and tool transportation between the machines. It is shown that all these problems can be formulated as mixed integer linear programs which have a common structure. Small instances are solved with CPLEX. For larger instances tabu search procedures have been developed. The main ideas of these methods are indicated. (c) 2008 Elsevier B.V. All rights reserved.
Beschreibung: 
5th International Conference on Graphs and Optimization, Leukerbad, SWITZERLAND, AUG, 2006
ISSN: 0166218X
DOI: 10.1016/j.dam.2008.03.029

Show full item record

Page view(s)

1
Last Week
0
Last month
0
checked on Feb 23, 2024

Google ScholarTM

Check

Altmetric