A branch and bound algorithm for the cyclic job-shop problem with transportation

DC FieldValueLanguage
dc.contributor.authorBrucker, Peter
dc.contributor.authorBurke, Edmund K.
dc.contributor.authorGroenemeyer, Sven
dc.date.accessioned2021-12-23T16:11:24Z-
dc.date.available2021-12-23T16:11:24Z-
dc.date.issued2012
dc.identifier.issn03050548
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/9685-
dc.description.abstractThe cyclic job-shop problem with transportation can be used to describe optimization problems in fully automated manufacturing systems or assembly lines. We study the problem where the machines have no buffers, which rapidly decreases the number of feasible solutions and, therefore, makes it a lot harder to find those feasible solutions. After formulating the problem, we will characterize feasible solutions based on the route of the robot and their properties. With the aim of minimizing the cycle time, we have developed a tree search method to construct feasible solutions and combined it with a bounding procedure. Computational results are reported and compared to those gained by solving the problem with an LP solver. (C) 2012 Elsevier Ltd. All rights reserved.
dc.description.sponsorshipEPSRCUK Research & Innovation (UKRI)Engineering & Physical Sciences Research Council (EPSRC) [EP/D061571/1] Funding Source: UKRI; Engineering and Physical Sciences Research CouncilUK Research & Innovation (UKRI)Engineering & Physical Sciences Research Council (EPSRC) [GR/T23374/01, EP/D061571/1] Funding Source: researchfish
dc.language.isoen
dc.publisherPERGAMON-ELSEVIER SCIENCE LTD
dc.relation.ispartofCOMPUTERS & OPERATIONS RESEARCH
dc.subjectBLOCKING
dc.subjectBranch and bound
dc.subjectComputer Science
dc.subjectComputer Science, Interdisciplinary Applications
dc.subjectCyclic job-shop
dc.subjectEngineering
dc.subjectEngineering, Industrial
dc.subjectHARD
dc.subjectMinimal cycle time
dc.subjectOperations Research & Management Science
dc.subjectROBOTIC CELLS
dc.subjectSCHEDULING PROBLEMS
dc.subjectTIME-WINDOW CONSTRAINTS
dc.subjectTransport
dc.titleA branch and bound algorithm for the cyclic job-shop problem with transportation
dc.typejournal article
dc.identifier.doi10.1016/j.cor.2012.04.008
dc.identifier.isiISI:000313379300025
dc.description.volume39
dc.description.issue12
dc.description.startpage3200
dc.description.endpage3214
dc.contributor.orcid0000-0003-0712-4762
dc.publisher.placeTHE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, ENGLAND
dcterms.isPartOf.abbreviationComput. Oper. Res.
Show simple item record

Page view(s)

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

Google ScholarTM

Check

Altmetric