The blocking job shop with rail-bound transportation

Reinhard Bürgy () and Heinz Gröflin ()
Additional contact information
Reinhard Bürgy: University of Fribourg
Heinz Gröflin: University of Fribourg

Journal of Combinatorial Optimization, 2016, vol. 31, issue 1, No 12, 152-181

Abstract: Abstract The blocking job shop with rail-bound transportation (BJS-RT) considered here is a version of the job shop scheduling problem characterized by the absence of buffers and the use of a rail-bound transportation system. The jobs are processed on machines and are transported from one machine to the next by mobile devices (called robots) that move on a single rail. The robots cannot pass each other, must maintain a minimum distance from each other, but can also “move out of the way”. The objective of the BJS-RT is to determine for each machining operation its starting time and for each transport operation its assigned robot and starting time, as well as the trajectory of each robot, in order to minimize the makespan. Building on previous work of the authors on the flexible blocking job shop and an analysis of the feasible trajectory problem, a formulation of the BJS-RT in a disjunctive graph is derived. Based on the framework of job insertion in this graph, a local search heuristic generating consistently feasible neighbor solutions is proposed. Computational results are presented, supporting the value of the approach.

Keywords: Job shop scheduling; Blocking; Rail-bound transportation; Robots; Disjunctive graph; Job insertion; Tabu search (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9723-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:31:y:2016:i:1:d:10.1007_s10878-014-9723-3

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-014-9723-3

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().