Measures of subproblem cirticality in decomposition algorithms for shop scheduling

Measures of subproblem cirticality in decomposition algorithms for shop scheduling

0.00 Avg rating0 Votes
Article ID: iaor2004158
Country: United Kingdom
Volume: 41
Issue: 5
Start Page Number: 865
End Page Number: 882
Publication Date: Jan 2003
Journal: International Journal of Production Research
Authors: , ,
Abstract:

Work centre-based decomposition approaches, especially variants of the Shifting Bottleneck algorithm, have been very successful in solving job-shop-scheduling problems. These methods decompose the problem into subproblems involving a single work centre (usually a single machine), which they solve sequentially. We propose new measures of subproblem criticality and show via computational experiments that several of these provide solutions comparable in quality with those obtained from previous work in substantially less central processing unit time.

Reviews

Required fields are marked *. Your email address will not be published.