Machine Criticality Measures and Subproblem Solution Procedures in Shifting Bottleneck Methods: A Computational Study
通过大量计算实验，研究了不同机器关键性度量和子问题求解过程对移动瓶颈方法在最小化最大延迟的作业车间问题中性能的影响，发现对于平衡负载和随机路径的问题，简单方法即可，且路径结构影响显著。
AbstractWe examine the effects of different machine criticality measures (MCMs) and subproblem solution procedures (SSPs) on the performance of Shifting Bottleneck (SB) methods for the problem of minimizing maximum lateness in a job shop. Extensive computational experiments show that for problems with balanced workloads and random routeings simple MCMs and SSPs can be used without affecting solution quality. Routeing structure affects the performance of the SB method significantly. We also find that, contrary to some previous studies, the problem of maintaining feasibility in the SB method is significant.Keywords: schedulingheuristicscomputational analysis