Setup-oriented dispatching rules – a survey
Setup-oriented dispatching rules – a survey
复制标题
DOI：
10.1080/00207543.2011.629634
复制
发表时间：
2012-10
影响因子：
9.2
通讯作者：
Christoph W. Pickardt;J. Branke
中科院分区：
文献类型：
--
作者：
Christoph W. Pickardt;J. Branke
本文综述了在决策中明确考虑调整时间的调度规则。将规则分为纯设置规则、复合规则和基于家族的规则，并从文献中确定了这三类规则中最有希望的规则。然后将这些规则在不同的作业车间问题上与顺序相关的安装时间进行了经验比较，以了解它们在平均安装时间、平均流动时间、平均拖期和拖期作业比例方面的性能。利用设置时间矩阵对设置时间进行建模，并应用五种不同类型的矩阵来评估该因素对面向设置的调度规则的相对性能的影响。实验结果表明，最佳规则的选择往往依赖于建立时间矩阵的结构。虽然存在用于减少平均建立时间和平均流动时间的良好的基于家庭的规则，但它们的表现明显优于用于与到期日相关的标准的有效的复合规则。此外，更好的规则似乎都依赖于队列信息，而不仅仅是作业属性。
This paper provides a survey of dispatching rules that explicitly take into account setup times in their decision making. Rules are classified into the categories of purely setup-oriented, composite and family-based rules, and the most promising rules from the three categories are identified from the literature. These rules are then compared empirically on various job shop problems with sequence-dependent setup times for their performance regarding mean setup time, mean flow time, mean tardiness and proportion of tardy jobs. The setup times are modelled using setup time matrices, and five different types of matrices are applied to assess the influence of this factor on the relative performance of a setup-oriented dispatching rule. Experimental results indicate that the choice of the best rule is often dependent on the setup time matrix structure. While good family-based rules exist for reducing the mean setup time and mean flow time, they are clearly outperformed by effective composite rules for due date-related criteria. Moreover, the better rules all seem to rely on queue information rather than only job attributes.