A new neighborhood and tabu search for the Blocking Job Shop

  • Authors:

  • Heinz Gröflin;Andreas Klinkert

  • Affiliations:

  • Department of Informatics, University of Fribourg, Switzerland;Institute of Data Analysis and Process Design, Zurich University of Applied Sciences, Switzerland

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 2009

Quantified Score

Hi-index 0.04

Visualization

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.