Please use this identifier to cite or link to this item:
Title: A new neighborhood and tabu search for the blocking job shop
Authors : Gröflin, Heinz
Klinkert, Andreas
Published in : Discrete Applied Mathematics
Volume(Issue) : 157
Issue : 17
Pages : 3643
Pages to: 3655
Publisher / Ed. Institution : Elsevier
Issue Date: 2009
License (according to publishing contract) : Licence according to publishing contract
Type of review: Peer review (Publication)
Language : English
Subjects : Tabu search; Blocking; Job shop scheduling; Neighborhood
Subject (DDC) : 500: Natural sciences and mathematics
Abstract: The Blocking Job Shop is a version of the job shop scheduling problem with no intermediate buffers, where a job has to wait on a machine until being processed on the next machine. We study a generalization of this problem which takes into account transfer operations between machines and sequence-dependent setup times. After formulating the problem in a generalized disjunctive graph, we develop a neighborhood for local search. In contrast to the classical job shop, there is no easy mechanism for generating feasible neighbor solutions. We establish two structural properties of the underlying disjunctive graph, the concept of closures and a key result on short cycles, which enable us to construct feasible neighbors by exchanging critical arcs together with some other arcs. Based on this neighborhood, we devise a tabu search algorithm and report on extensive computational experience, showing that our solutions improve most of the benchmark results found in the literature.
Departement: School of Engineering
Organisational Unit: Institute of Data Analysis and Process Design (IDP)
Publication type: Article in scientific Journal
DOI : 10.1016/j.dam.2009.02.020
ISSN: 0166-218X
Appears in Collections:Publikationen School of Engineering

Files in This Item:
File Description SizeFormat 
Groeflin-Klinkert-A-New-Neighborhood-And-Tabu-Search-For-The-Blocking-Job-Shop-DAM-2009.pdf895.38 kBAdobe PDFThumbnail

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