DC Element | Wert | Sprache |
dc.contributor.author | Brucker, P | |
dc.contributor.author | Kampmeyer, T | |
dc.date.accessioned | 2021-12-23T16:03:18Z | - |
dc.date.available | 2021-12-23T16:03:18Z | - |
dc.date.issued | 2005 | |
dc.identifier.issn | 10946136 | |
dc.identifier.uri | https://osnascholar.ub.uni-osnabrueck.de/handle/unios/5909 | - |
dc.description | 6th Workshop Models and Algorithms for Planning and Scheduling Problems, Aussois, FRANCE, MAR 30-APR 04, 2003 | |
dc.description.abstract | 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. | |
dc.language.iso | en | |
dc.publisher | SPRINGER | |
dc.relation.ispartof | JOURNAL OF SCHEDULING | |
dc.subject | block approach | |
dc.subject | cyclic scheduling | |
dc.subject | Engineering | |
dc.subject | Engineering, Manufacturing | |
dc.subject | JOB SHOPS | |
dc.subject | job-shop problem | |
dc.subject | Operations Research & Management Science | |
dc.subject | opt-connectivity | |
dc.subject | tabu-search | |
dc.title | Tabu search algorithms for cyclic machine scheduling problems | |
dc.type | conference paper | |
dc.identifier.doi | 10.1007/s10951-005-1639-4 | |
dc.identifier.isi | ISI:000229504400004 | |
dc.description.volume | 8 | |
dc.description.issue | 4 | |
dc.description.startpage | 303 | |
dc.description.endpage | 322 | |
dc.publisher.place | VAN GODEWIJCKSTRAAT 30, 3311 GZ DORDRECHT, NETHERLANDS | |
dcterms.isPartOf.abbreviation | J. Sched. | |