Some single-machine scheduling problems with elapsed-time-based and position-based learning and forgetting effects

被引:15
|
作者
Wu, Chia-Huang [1 ]
Lee, Wen-Chiung [1 ]
Lai, Peng-Jen [2 ]
Wang, Jen-Ya [3 ]
机构
[1] Feng Chia Univ, Dept Stat, Taichung 40724, Taiwan
[2] Natl Kaohsiung Normal Univ, Dept Math, Kaohsiung 82446, Taiwan
[3] Hungkuang Univ, Dept Comp Sci & Informat Management, Taichung 43302, Taiwan
关键词
Job scheduling; Learning effect; Forgetting effect; Single-machine problems; DEPENDENT SETUP TIMES; GENERAL DETERIORATION; PROCESSING-TIMES; COMPLETION-TIME; JOBS;
D O I
10.1016/j.disopt.2015.11.002
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, a generalized model with past-sequence-dependent learning and forgetting effects is proposed. Both effects are assumed to be dependent on the sum of processing time as well as the scheduling position. Based on this model, we investigate and prove that some single-machine problems remain polynomially solvable with certain agreeable conditions. We further show that many models known in the literature are special cases of our proposed model. Several helpful lemmas are presented to analyze single-machine scheduling problems with various objective functions: makespan, total completion time, weighted completion time, and maximum lateness. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:1 / 11
页数:11
相关论文
共 50 条