Solution algorithms for synchronous flow shop problems with two dominating machines

DC FieldValueLanguage
dc.contributor.authorKampmeyer, Matthias
dc.contributor.authorKnust, Sigrid
dc.contributor.authorWaldherr, Stefan
dc.date.accessioned2021-12-23T15:57:08Z-
dc.date.available2021-12-23T15:57:08Z-
dc.date.issued2016
dc.identifier.issn03050548
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/2749-
dc.description.abstractIn this paper, we present solution algorithms for synchronous flow shop problems with two dominating machines. In such an environment, jobs have to be moved from one machine to the next by an unpaced synchronous transportation system, which implies that the processing is organized in synchronized cycles. This means that in each cycle the current jobs start at the same time on the corresponding machines and after processing have to wait until the last job is finished. Afterwards, all jobs are moved to the next machine simultaneously. Motivated by a practical application, we investigate the special case of two dominating machines where the processing times of all jobs on these two machines are at least as large as the processing times of all jobs on the other machines and hence always determine the cycle times. After formulating the considered problem as a special vehicle routing problem, we propose mixed integer linear programming formulations and a tabu search algorithm. Finally, we present computational results for randomly generated data and show the efficiency of the approaches. (C) 2016 Elsevier Ltd. All rights reserved.
dc.description.sponsorshipDeutsche ForschungsgemeinschaftGerman Research Foundation (DFG) [KN 512/7-1]; This work was supported by the Deutsche Forschungsgemeinschaft, KN 512/7-1
dc.language.isoen
dc.publisherPERGAMON-ELSEVIER SCIENCE LTD
dc.relation.ispartofCOMPUTERS & OPERATIONS RESEARCH
dc.subjectComputer Science
dc.subjectComputer Science, Interdisciplinary Applications
dc.subjectDominating machines
dc.subjectEngineering
dc.subjectEngineering, Industrial
dc.subjectFlow shop
dc.subjectFORMULATION
dc.subjectOperations Research & Management Science
dc.subjectSynchronous movement
dc.subjectTRAVELING SALESMAN PROBLEM
dc.subjectTSP
dc.subjectVehicle routing
dc.subjectVEHICLE-ROUTING PROBLEM
dc.titleSolution algorithms for synchronous flow shop problems with two dominating machines
dc.typejournal article
dc.identifier.doi10.1016/j.cor.2016.04.010
dc.identifier.isiISI:000379561700005
dc.description.volume74
dc.description.startpage42
dc.description.endpage52
dc.identifier.eissn1873765X
dc.publisher.placeTHE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, ENGLAND
dcterms.isPartOf.abbreviationComput. Oper. Res.
crisitem.author.deptFB 06 - Mathematik/Informatik-
crisitem.author.deptFB 06 - Mathematik/Informatik-
crisitem.author.deptidfb06-
crisitem.author.deptidfb06-
crisitem.author.parentorgUniversität Osnabrück-
crisitem.author.parentorgUniversität Osnabrück-
crisitem.author.netidKaMa001-
crisitem.author.netidKnSi808-
crisitem.author.netidWaSt588-
Show simple item record

Page view(s)

2
Last Week
0
Last month
0
checked on Apr 23, 2024

Google ScholarTM

Check

Altmetric