Title of article
A general model for cyclic machine scheduling problems Original Research Article
Author/Authors
Peter Brucker، نويسنده , , Thomas Kampmeyer، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
12
From page
2561
To page
2572
Abstract
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.
Keywords
Job shop , Transportation robots , Robotic cell , Tabu search , Cyclic scheduling problems , Single hoist scheduling problems , Mixed integer linear program
Journal title
Discrete Applied Mathematics
Serial Year
2008
Journal title
Discrete Applied Mathematics
Record number
886845
Link To Document