Tabu search algorithms for cyclic machine scheduling problems

DC ElementWertSprache
dc.contributor.authorBrucker, P
dc.contributor.authorKampmeyer, T
dc.date.accessioned2021-12-23T16:03:18Z-
dc.date.available2021-12-23T16:03:18Z-
dc.date.issued2005
dc.identifier.issn10946136
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/5909-
dc.description6th Workshop Models and Algorithms for Planning and Scheduling Problems, Aussois, FRANCE, MAR 30-APR 04, 2003
dc.description.abstractTabu 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.
dc.language.isoen
dc.publisherSPRINGER
dc.relation.ispartofJOURNAL OF SCHEDULING
dc.subjectblock approach
dc.subjectcyclic scheduling
dc.subjectEngineering
dc.subjectEngineering, Manufacturing
dc.subjectJOB SHOPS
dc.subjectjob-shop problem
dc.subjectOperations Research & Management Science
dc.subjectopt-connectivity
dc.subjecttabu-search
dc.titleTabu search algorithms for cyclic machine scheduling problems
dc.typeconference paper
dc.identifier.doi10.1007/s10951-005-1639-4
dc.identifier.isiISI:000229504400004
dc.description.volume8
dc.description.issue4
dc.description.startpage303
dc.description.endpage322
dc.publisher.placeVAN GODEWIJCKSTRAAT 30, 3311 GZ DORDRECHT, NETHERLANDS
dcterms.isPartOf.abbreviationJ. Sched.
Zur Kurzanzeige

Google ScholarTM

Prüfen

Altmetric