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 条

[21] Efficient constructive and composite heuristics for the Permutation Flowshop to minimise total earliness and tardiness
Fernandez-Viagas, Victor
Dios, Manuel
Framinan, Jose M.
COMPUTERS & OPERATIONS RESEARCH, 2016, 75 : 38 - 48
[22] Minimizing Total Idle Energy Consumption in the Permutation Flow Shop Scheduling Problem
Liu, Guo-Sheng
Li, Jin-Jin
Tang, Ying-Si
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2018, 35 (06)
[23] An approach for earliness and tardiness scheduling problems of flow shop with uncertainty
Xu, Zhenhao
Gu, Xingsheng
WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS, 2006, : 7317 - 7321
[24] A bi-population EDA for solving the no-idle permutation flow-shop scheduling problem with the total tardiness criterion
Shen, Jing-nan
Wang, Ling
Wang, Sheng-yao
KNOWLEDGE-BASED SYSTEMS, 2015, 74 : 167 - 175
[25] Earliness/tardiness flow-shop scheduling under uncertainty
Li, SF
Zhu, YL
Li, XY
ICTAI 2005: 17TH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2005, : 499 - 506
[26] Online scheduling to minimize total weighted (modified) earliness and tardiness cost
Jabbari, Arman
Kaminsky, Philip M.
JOURNAL OF SCHEDULING, 2021, 24 (04) : 431 - 446
[27] Minimizing earliness and tardiness costs in scheduling jobs with time windows
Hung, Yi-Feng
Bao, Jian-Song
Cheng, Yu-En
COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 113 : 871 - 890
[28] Single machine scheduling with family setups to minimize total earliness and tardiness
Schaller, Jeffrey E.
Gupta, Jatinder N. D.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 187 (03) : 1050 - 1068
[29] Heuristics to Minimize Total Weighted Tardiness of Jobs on Unrelated Parallel Machines
Moench, L.
2008 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING, VOLS 1 AND 2, 2008, : 572 - 577
[30] Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time
Wang, Ji-Bo
Shan, Feng
Jiang, Bo
Wang, Li-Yan
APPLIED MATHEMATICS AND COMPUTATION, 2006, 182 (01) : 947 - 954

← 1 2 3 4 5 →