Heuristics for scheduling jobs in a permutation flow shop to minimize total earliness and tardiness with unforced idle time allowed

被引：20
|
作者：
Schaller, Jeffrey [1 ]
Valente, Jorge M. S. [2 ]
机构：
[1] Eastern Connecticut State Univ, Dept Business Adm, 83 Windham St, Willimantic, CT 06226 USA
[2] Univ Porto, Fac Econ, LIAAD INESC TEC, Rua Dr Roberto Frias, P-4200464 Porto, Portugal
来源：
EXPERT SYSTEMS WITH APPLICATIONS | 2019年 / 119卷
关键词：
Scheduling; Heuristics; Flow Shop; Earliness and Tardiness; WEIGHTED TARDINESS; MACHINE;
D O I：
10.1016/j.eswa.2018.11.007
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
This paper considers the problem of scheduling jobs in a permutation flow shop with the objective of minimizing total earliness and tardiness. Unforced idle time is considered in order to reduce the earliness of jobs. It is shown how unforced idle time can be inserted on the final machine. Several dispatching heuristics that have been used for the problem without unforced idle time were modified and tested. Several procedures were also developed that conduct a second pass to develop a sequence using dispatching rules. These procedures were also tested and were found to result in better solutions. (C) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码：376 / 386
页数：11
相关论文
共 50 条
12345