By Topic

Variable neighborhood search-based subproblem solution procedures for a parallel shifting bottleneck heuristic for complex job shops

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bilyk, A. ; Dept. of Math. & Comput. Sci., Univ. of Hagen, Hagen, Germany ; Monch, L.

The shifting bottleneck heuristic (SBH) for complex job shops decomposes the overall scheduling problem into a series of scheduling problems related to machine groups. These smaller, more tractable, scheduling problems are called subproblems. The heuristic is based on a disjunctive graph that is used to model the relationship between the sub-problems. In this paper, we use a parallel implementation of the SBH to assess the impact of a variable neighborhood search-based subproblem solution procedure (SSP) on global performance measures like the total weighted tardiness. Based on designed simulation experiments, we demonstrate the advantage of using high-quality SSPs.

Published in:

Automation Science and Engineering (CASE), 2012 IEEE International Conference on

Date of Conference:

20-24 Aug. 2012