Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/15727
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBrucker, Peteren_UK
dc.contributor.authorBurke, Edmunden_UK
dc.contributor.authorGroenemeyer, Svenen_UK
dc.date.accessioned2018-02-10T00:37:10Z-
dc.date.available2018-02-10T00:37:10Zen_UK
dc.date.issued2012-09en_UK
dc.identifier.urihttp://hdl.handle.net/1893/15727-
dc.description.abstractThis paper focuses on the study of cyclic job-shop problems with transportation and blocking. Within this domain, there are many real world problems like large scale productions, robotic cells, software pipelining or hoist scheduling. The aim in general is to find, for each machine, a feasible order of all the operations processed on this machine, so that an objective function is optimised. In this paper, we consider the problem of minimising the cycle time (maximising the throughput) in a job-shop environment, where the jobs are transported by a single robot between the machines. Additionally to the problem description, we will give some explanations and interpretation possibilities of the problem height, which is often omitted in the literature. As the main contribution, we will present a new integer programming formulation and show that it outperforms an existing model from the literature.en_UK
dc.language.isoenen_UK
dc.publisherElsevieren_UK
dc.relationBrucker P, Burke E & Groenemeyer S (2012) A mixed integer programming model for the cyclic job-shop problem with transportation. Discrete Applied Mathematics, 160 (13-14), pp. 1924-1935. https://doi.org/10.1016/j.dam.2012.04.001en_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.subjectInteger programmingen_UK
dc.subjectMinimal cycle timeen_UK
dc.titleA mixed integer programming model for the cyclic job-shop problem with transportationen_UK
dc.typeJournal Articleen_UK
dc.rights.embargodate2999-12-31en_UK
dc.rights.embargoreason[A mixed integer programming model for the cyclic job-shop problem with transportation.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.dam.2012.04.001en_UK
dc.citation.jtitleDiscrete Applied Mathematicsen_UK
dc.citation.issn0166-218Xen_UK
dc.citation.volume160en_UK
dc.citation.issue13-14en_UK
dc.citation.spage1924en_UK
dc.citation.epage1935en_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:000306298600004en_UK
dc.identifier.scopusid2-s2.0-84862187784en_UK
dc.identifier.wtid695311en_UK
dcterms.dateAccepted2012-09-30en_UK
dc.date.filedepositdate2013-07-03en_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.freetoreaddate2999-12-31en_UK
local.rioxx.licencehttp://www.rioxx.net/licenses/under-embargo-all-rights-reserved||en_UK
local.rioxx.filenameA mixed integer programming model for the cyclic job-shop problem with transportation.pdfen_UK
local.rioxx.filecount1en_UK
local.rioxx.source0166-218Xen_UK
Appears in Collections:Computing Science and Mathematics Journal Articles

Files in This Item:
File Description SizeFormat 
A mixed integer programming model for the cyclic job-shop problem with transportation.pdfFulltext - Published Version435.51 kBAdobe PDFUnder Permanent Embargo    Request a copy


This item is protected by original copyright



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.