2 NEW RULES TO MINIMIZE TARDINESS IN A JOB SHOP
2 NEW RULES TO MINIMIZE TARDINESS IN A JOB SHOP
复制标题
DOI：
10.1080/00207549008942866
复制
发表时间：
1990-12-01
影响因子：
9.2
通讯作者：
NYIRENDA, JC
中科院分区：
文献类型：
--
作者：
ANDERSON, EJ;NYIRENDA, JC
在本文中，我们提出了两个新的调度规则，最大限度地减少拖期车间。这两项规则都与经修改的操作到期日规则密切相关。第一种是最短加工时间（SPT）规则和临界比率（CR）规则的组合，第二种是SPT规则和剩余工作时间（S/RPT）规则的组合。这两个新的规则是简单的实现，可以很容易地适应最小化加权拖期。此外，他们不需要任何参数估计，他们的实施，这是一个显着的缺点，一些早期的规则，如COVERT。仿真结果表明，这两个新的规则的性能优于其他规则已开发的最小化总加权和未加权拖后。这适用于各种车间条件。此外，规则是有效的，在最小化延误的工作数量。
In this paper we present two new dispatching rules for minimizing tardiness in a job shop. Both rules are closely related to the modified operation due date (MOD) rule. The first is a combination of the shortest processing time (SPT) rule and the critical ratio (CR) rule, and the second is a combination of the SPT rule and the slack per remaining work (S/RPT) rule. The two new rules are simple to implement and can easily be adapted to minimize weighted tardiness. Moreover they do not require any parameter estimation for their implementation, which is a notable disadvantage of some earlier rules such as COVERT. Simulation results show that the performance of the two new rules is better than that of other rules that have been developed to minimize total weighted and unweighted tardiness. This holds true across a range of shop conditions. Furthermore, the rules are effective in minimizing the number of tardy jobs.