Complexity results for flow shop problems with synchronous movement

DC FieldValueLanguage
dc.contributor.authorWaldherr, Stefan
dc.contributor.authorKnust, Sigrid
dc.date.accessioned2021-12-23T15:58:56Z-
dc.date.available2021-12-23T15:58:56Z-
dc.date.issued2015
dc.identifier.issn03772217
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/3647-
dc.description.abstractIn this paper we present complexity results for flow shop problems with synchronous movement which are a variant of a non-preemptive permutation flow shop. 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. Besides the general situation we also investigate special cases involving machine dominance which means that the processing times of all jobs on a dominating machine are at least as large as the processing times of all jobs on the other machines. Especially, we study flow shops with synchronous movement for a small number of dominating machines (one or two) and different objective functions. (C) 2014 Elsevier B.V. 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.publisherELSEVIER
dc.relation.ispartofEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
dc.subjectBusiness & Economics
dc.subjectComplexity
dc.subjectDominating machines
dc.subjectFlow shop
dc.subjectManagement
dc.subjectONE MACHINE
dc.subjectOperations Research & Management Science
dc.subjectSynchronous movement
dc.subjectTRANSFERS
dc.titleComplexity results for flow shop problems with synchronous movement
dc.typejournal article
dc.identifier.doi10.1016/j.ejor.2014.09.053
dc.identifier.isiISI:000348687900004
dc.description.volume242
dc.description.issue1
dc.description.startpage34
dc.description.endpage44
dc.identifier.eissn18726860
dc.publisher.placeRADARWEG 29, 1043 NX AMSTERDAM, NETHERLANDS
dcterms.isPartOf.abbreviationEur. J. 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.netidWaSt588-
crisitem.author.netidKnSi808-
Show simple item record

Page view(s)

1
Last Week
0
Last month
0
checked on Apr 21, 2024

Google ScholarTM

Check

Altmetric