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 条
12345