Uniform parallel-machine scheduling to minimize makespan with position-based learning curves

被引：42
|
作者：
Lee, Wen-Chiung [2 ]
Chuang, Mei-Chi [1 ]
Yeh, Wei-Chang [1 ,3 ]
机构：
[1] Natl Tsing Hua Univ, Dept Ind Engn & Engn Management, Integrat & Collaborat Lab, Hsinchu 300, Taiwan
[2] Feng Chia Univ, Dept Stat, Taichung 40724, Taiwan
[3] Univ Technol Sydney, Fac Engn & Informat Technol, Adv Analyt Inst, Sydney, NSW 2007, Australia
来源：
COMPUTERS & INDUSTRIAL ENGINEERING | 2012年 / 63卷 / 04期
关键词：
Scheduling; Learning curve; Uniform parallel-machine; Makespan; DETERIORATING JOBS; TIME; FLOWSHOP; DESIGN; SETUP;
D O I：
10.1016/j.cie.2012.05.003
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
Scheduling with learning effects has become a popular topic in the past decade; however, most of the research focuses on single-machine problems. In many situations, there are machines in parallel and the skills of workers might be different due to their individual experience. In this paper, we study a uniform parallel machine problem in which the objective is to jointly find an optimal assignment of operators to machines and an optimal schedule to minimize the makespan. Two heuristic algorithms are proposed and computational experiments are conducted to evaluate their performance. (C) 2012 Elsevier Ltd. An rights reserved.
引用
收藏
页码：813 / 818
页数：6
相关论文
共 50 条
12345