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

详细信息    查看全文

• 作者：Chia-Huang Wu^a ; Wen-Chiung Lee^a ; Peng-Jen Lai^b ; Jen-Ya Wang^c ; ^{jywang@sunrise.hk.edu.tw" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Job scheduling ; Learning effect ; Forgetting effect ; Single-machine problems
• 刊名：Discrete Optimization
• 出版年：2016
• 出版时间：February 2016
• 年：2016
• 卷：19
• 期：Complete
• 页码：1-11
• 全文大小：561 K

文摘

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.