By Topic

A parallel shifting bottleneck heuristic for scheduling complex job shops: Architecture and performance assessment

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

4 Author(s)
Driessel, R. ; Dept. of Math. & Comput. Sci., Univ. of Hagen, Hagen, Germany ; Hönig, U. ; Mönch, L. ; Schiffmann, W.

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 subproblems. In this paper, we introduce a parallel implementation of the SBH that is based on the idea that these subproblems are rather independent from each other. We show that the parallel implementation is much faster than the sequential version of the SBH. Hence, more computationally costly subproblem solution procedures (SSP's) can be applied within the parallel shifting bottleneck heuristic.

Published in:

Automation Science and Engineering (CASE), 2010 IEEE Conference on

Date of Conference:

21-24 Aug. 2010