Minimizing total tardiness for scheduling identical parallel machines with family setups

被引：34
|
作者：
Schaller, Jeffrey E. [1 ]
机构：
[1] Eastern Connecticut State Univ, Dept Business Adm, Willimantic, CT 06250 USA
来源：
COMPUTERS & INDUSTRIAL ENGINEERING | 2014年 / 72卷
关键词：
Scheduling; Batch sizing; Heuristics; Parallel machines; Sequencing; BOUND ALGORITHM; BRANCH; JOBS;
D O I：
10.1016/j.cie.2014.04.001
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
This paper presents several procedures for scheduling identical parallel machines with family setups when the objective is to minimize total tardiness. These procedures are tested on several problem sets with varying numbers of families, jobs and machines, varying setup time distributions and various levels of due date tightness and variability. The results show that genetic algorithms are the most effective algorithms for the problem. (C) 2014 Elsevier Ltd. All rights reserved.
引用
收藏
页码：274 / 281
页数：8
相关论文
共 50 条
  • [31] Scheduling unrelated parallel machines to minimize total weighted tardiness
    Liaw, CF
    Lin, YK
    Cheng, CY
    Chen, MC
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (12) : 1777 - 1789
  • [32] Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time
    Kramer, Arthur
    Dell'Amico, Mauro
    Feillet, Dominique
    Iori, Manuel
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2020, 123
  • [33] Minimizing total tardiness in an unrelated parallel-machine scheduling problem
    Shim, S-O
    Kim, Y-D
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2007, 58 (03) : 346 - 354
  • [34] A tabu search algorithm for unrelated parallel machine scheduling with sequence- and machine-dependent setups: minimizing total tardiness
    Jae-Ho Lee
    Jae-Min Yu
    Dong-Ho Lee
    [J]. The International Journal of Advanced Manufacturing Technology, 2013, 69 : 2081 - 2089
  • [35] A tabu search algorithm for unrelated parallel machine scheduling with sequence- and machine-dependent setups: minimizing total tardiness
    Lee, Jae-Ho
    Yu, Jae-Min
    Lee, Dong-Ho
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 69 (9-12): : 2081 - 2089
  • [36] Heuristics for Minimizing the Total Tardiness in a Re-Entrant Hybrid Flow Shop With Non-Identical Machines in Parallel
    Zhang, Xiang-Yi
    Chen, Lu
    [J]. 2016 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2016, : 987 - 991
  • [37] A multi-agent scheduling problem for two identical parallel machines to minimize total tardiness time and makespan
    Yu, Fei
    Wen, Peihan
    Yi, Shuping
    [J]. ADVANCES IN MECHANICAL ENGINEERING, 2018, 10 (02):
  • [38] MINIMIZING MAXIMUM TARDINESS FOR UNRELATED PARALLEL MACHINES
    SURESH, V
    CHAUDHURI, D
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1994, 34 (02) : 223 - 229
  • [39] A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines
    Min, L
    Cheng, W
    [J]. ARTIFICIAL INTELLIGENCE IN ENGINEERING, 1999, 13 (04): : 399 - 403
  • [40] Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
    Kayvanfar, Vahid
    Komaki, Gh. M.
    Aalaei, Amin
    Zandieh, M.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2014, 41 : 31 - 43
12345