The analysis of scheduling rules in a flexible job shop with non-zero setup costs
The analysis of scheduling rules in a flexible job shop with non-zero setup costs
复制标题
非零准备成本的灵活作业车间调度规则分析
DOI：
10.1504/ijtpm.2009.025289
复制
发表时间：
2009
影响因子：
--
通讯作者：
M. K. Bhutta
中科院分区：
文献类型：
--
作者：
F. Huq;Ken Cutright;M. K. Bhutta
本文研究了具有非零安装成本、不同到达率和多目标函数的柔性作业车间（FJS）中的零件调度问题。最短处理时间（SPT），最长处理时间（LPT），先进先出（FIFO）和最早的交货期（EDD）调度规则进行评估，以尽量减少提前工作的数量和优化的交货期性能，同时近似准时（JIT）的库存水平。在本文中，我们表明，当设置成本不为零时，根据目标的优先级，不同的机器装载配置优化系统性能。
This paper evaluates the scheduling of parts in a Flexible Job Shop (FJS) with non-zero setup costs, varying arrival rates and multiple objective functions. The Shortest Processing Time (SPT), Longest Processing Time (LPT), First-in, First-out (FIFO) and Earliest Due Date (EDD) scheduling rules are evaluated with respect to minimising the number of early jobs and optimising the due-date performance while simultaneously approximating Just-in-Time (JIT) inventory levels. We show in this paper that when the setup costs are not zero, depending on which objective is given priority, different machine loading configurations optimise system performance.