1. STORRE
  2. Faculty of Natural Sciences
  3. Computing Science and Mathematics
  4. Computing Science and Mathematics Journal Articles
Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/15713
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBrucker, Peteren_UK
dc.contributor.authorBurke, Edmunden_UK
dc.contributor.authorGroenemeyer, Svenen_UK
dc.date.accessioned2018-02-10T06:59:09Z-
dc.date.available2018-02-10T06:59:09Zen_UK
dc.date.issued2012-12en_UK
dc.identifier.urihttp://hdl.handle.net/1893/15713-
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.en_UK
dc.language.isoenen_UK
dc.publisherElsevieren_UK
dc.relationBrucker P, Burke E & Groenemeyer S (2012) A branch and bound algorithm for the cyclic job-shop problem with transportation. Computers and Operations Research, 39 (12), pp. 3200-3214. https://doi.org/10.1016/j.cor.2012.04.008en_UK
dc.rightsThe publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.en_UK
dc.rights.urihttp://www.rioxx.net/licenses/under-embargo-all-rights-reserveden_UK
dc.subjectCyclic job-shopen_UK
dc.subjectTransporten_UK
dc.subjectBlockingen_UK
dc.subjectBranch and bounden_UK
dc.subjectMinimal cycle timeen_UK
dc.subjectOperations Research/Decision Theoryen_UK
dc.subjectOrganization/Planningen_UK
dc.subjectOperations researchen_UK
dc.subjectBusiness logisticsen_UK
dc.subjectEconomics/Management Scienceen_UK
dc.subjectOperations Research/Decision Theoryen_UK
dc.subjectMathematical Programmingen_UK
dc.titleA branch and bound algorithm for the cyclic job-shop problem with transportationen_UK
dc.typeJournal Articleen_UK
dc.rights.embargodate3000-01-01en_UK
dc.rights.embargoreason[a branch and bound algorithm for the cyclic job-shop problem.pdf] The publisher does not allow this work to be made publicly available in this Repository therefore there is an embargo on the full text of the work.en_UK
dc.identifier.doi10.1016/j.cor.2012.04.008en_UK
dc.citation.jtitleComputers and Operations Researchen_UK
dc.citation.issn0305-0548en_UK
dc.citation.volume39en_UK
dc.citation.issue12en_UK
dc.citation.spage3200en_UK
dc.citation.epage3214en_UK
dc.citation.publicationstatusPublisheden_UK
dc.citation.peerreviewedRefereeden_UK
dc.type.statusVoR - Version of Recorden_UK
dc.author.emaile.k.burke@stir.ac.uken_UK
dc.contributor.affiliationUniversity of Osnabrück, Germanyen_UK
dc.contributor.affiliationComputing Science and Mathematics - Divisionen_UK
dc.contributor.affiliationUniversity of Nottinghamen_UK
dc.identifier.isiWOS:000313379300025en_UK
dc.identifier.scopusid2-s2.0-84862996832en_UK
dc.identifier.wtid695651en_UK
dcterms.dateAccepted2012-12-31en_UK
dc.date.filedepositdate2013-07-01en_UK
rioxxterms.typeJournal Article/Reviewen_UK
rioxxterms.versionVoRen_UK
local.rioxx.authorBrucker, Peter|en_UK
local.rioxx.authorBurke, Edmund|en_UK
local.rioxx.authorGroenemeyer, Sven|en_UK
local.rioxx.projectInternal Project|University of Stirling|https://isni.org/isni/0000000122484331en_UK
local.rioxx.freetoreaddate3000-01-01en_UK
local.rioxx.licencehttp://www.rioxx.net/licenses/under-embargo-all-rights-reserved||en_UK
local.rioxx.filenamea branch and bound algorithm for the cyclic job-shop problem.pdfen_UK
local.rioxx.filecount1en_UK
local.rioxx.source0305-0548en_UK
Appears in Collections:Computing Science and Mathematics Journal Articles

Files in This Item:
File Description SizeFormat 
a branch and bound algorithm for the cyclic job-shop problem.pdfFulltext - Published Version584.58 kBAdobe PDFUnder Embargo until 3000-01-01    Request a copy


This item is protected by original copyright

View License
Show simple item record


Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.