Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects

被引:19
作者
Liang, Xi-Xi [1 ]
Zhang, Bo [1 ]
Wang, Ji-Bo [1 ]
Yin, Na [1 ]
Huang, Xue [1 ]
机构
[1] Shenyang Aerosp Univ, Sch Sci, Shenyang 110136, Peoples R China
关键词
Scheduling; Heuristic algorithm; Flow shop; Learning effect; WORST-CASE ANALYSIS; TOTAL COMPLETION-TIME; SINGLE-MACHINE; 2-MACHINE FLOWSHOP; ASSIGNMENT; MAKESPAN;
D O I
10.1007/s12190-019-01255-0
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
This paper addresses flow shop scheduling problems with sum-of-logarithm-processing-times-based learning effects. The objective is to minimize the total completion time, the makespan, the total weighted completion time, and the sum of the quadratic job completion times, respectively. Heuristic algorithms based on the optimal schedules for the corresponding flow shop scheduling problems are presented and their worst-case error bounds are also analyzed.
引用
收藏
页码:373 / 388
页数:16
相关论文
共 42 条