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 条

[1] Scheduling in a no-wait flow shop to minimise total earliness and tardiness with additional idle time allowed
Schaller, Jeffrey
Valente, Jorge M. S.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2022, 60 (18) : 5488 - 5504
[2] Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed
Schaller, Jeffrey
Valente, Jorge
COMPUTERS & OPERATIONS RESEARCH, 2019, 109 : 1 - 11
[3] An evaluation of heuristics for scheduling a non-delay permutation flow shop with family setups to minimize total earliness and tardiness
Schaller, J.
Valente, J. M. S.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2013, 64 (06) : 805 - 816
[4] Permutation flow shop scheduling with earliness and tardiness penalties
Chandra, Pankaj
Mehta, Peeyush
Tirupati, Devanath
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2009, 47 (20) : 5591 - 5610
[5] Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed
Azizoglu, M
Koksalan, M
Koksalan, SK
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2003, 54 (06) : 661 - 664
[6] Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed
Azizoglu, M
Köksalan, M
Kondak, S
RESEARCH AND PRACTICE IN MULTIPLE CRITERIA DECISION MAKING, 2000, 487 : 381 - 387
[7] A comparison of metaheuristic procedures to schedule jobs in a permutation flow shop to minimise total earliness and tardiness
Schaller, Jeffrey
Valente, Jorge M. S.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2013, 51 (03) : 772 - 779
[8] Bounds for the permutation flowshop scheduling problem with exact time lags to minimize the total earliness and tardiness
Hamdi, Imen
Loukil, Taicir
INTERNATIONAL JOURNAL OF COMBINATORIAL OPTIMIZATION PROBLEMS AND INFORMATICS, 2014, 5 (02): : 47 - 57
[9] Minimizing total earliness and tardiness on a permutation flow shop using VNS and MIP
M'Hallah, R.
COMPUTERS & INDUSTRIAL ENGINEERING, 2014, 75 : 142 - 156
[10] Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness
Moslehi, G.
Mirzaee, M.
Vasei, M.
Modarres, M.
Azaron, A.
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2009, 122 (02) : 763 - 773

← 1 2 3 4 5 →