Please use this identifier to cite or link to this item:
Appears in Collections:Computing Science and Mathematics Journal Articles
Peer Review Status: Refereed
Title: A mixed integer programming model for the cyclic job-shop problem with transportation
Author(s): Brucker, Peter
Burke, Edmund
Groenemeyer, Sven
Contact Email:
Keywords: Cyclic job-shop
Integer programming
Minimal cycle time
Issue Date: Sep-2012
Date Deposited: 3-Jul-2013
Citation: Brucker 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.
Abstract: This 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.
DOI Link: 10.1016/j.dam.2012.04.001
Rights: The 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.
Licence URL(s):

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

Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependent on the depositor still being contactable at their original email address.

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

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