Paper Info
Title
Simulation-based selection of machine criticality measures for a shifting bottleneck heuristic
Abstract
In this paper, we investigate the influence of several machine criticality measures on the performance of a shifting bottleneck heuristic for complex job shops. The shifting bottleneck heuristic is a decomposition approach that tackles the overall scheduling problem by solving a sequence of tool group scheduling problems and composes the overall solution by using a disjunctive graph. Machine criticality measures are responsible for the sequence of the considered tool group scheduling problems. We suggest a new machine criticality measure that is a weighted sum of several existing criticality measures. It turns out that the shifting bottleneck heuristic performs well compared to dispatching rules when the suggested criticality measure is used. We present the results of computational experiments.
Year
DOI
Venue
2006
10.1109/WSC.2006.322965
Winter Simulation Conference
Keywords
Field
DocType
overall solution,overall scheduling problem,existing criticality measure,shifting bottleneck heuristic,tool group scheduling problem,machine criticality measure,complex job shop,considered tool group scheduling,simulation-based selection,criticality measure,new machine criticality measure,computer experiment,scheduling problem,job shop scheduling
Mathematical optimization,Job shop scheduling,Fair-share scheduling,Simulation,Computer science,Shifting bottleneck heuristic,Flow shop scheduling,Disjunctive graph,Real-time computing,Two-level scheduling,Rate-monotonic scheduling,Dynamic priority scheduling
Conference
ISBN
Citations 
PageRank 
1-4244-0501-7
0
0.34
References 
Authors
4
2
Name
Order
Citations
PageRank
Jens Zimmermann1677.68
Lars Mönch21034124.98