A note on machine scheduling with sum-of-logarithm-processing-time-based and position-based learning effects

作者：Zhang, Xingong^*; Yan, Guangle; Huang, Wanzhen; Tang, Guochun

来源：Information Sciences, 2012, 187: 298-304.

DOI：10.1016/j.ins.2011.11.001

• Scheduling
• Single-machine
• Flowshop
• Learning effect

Recently, Biskup [2] classifies the learning effect models in scheduling environments into two types: position-based and sum-of-processing-time-based. In this paper, we study scheduling problem with sum-of-logarithm-processing-time-based and position-based learning effects. We show that the single machine scheduling problems to minimize the makespan and the total completion time can both be solved by the smallest (normal) processing time first (SPT) rule. We also show that the problems to minimize the maximum lateness, the total weighted completion times and the total tardiness have polynomial-time solutions under agreeable WSFT rule and agreeable EDD rule. In addition, we show that m-machine permutation flowshop problems are still polynomially solvable under the proposed learning model.

• 出版日期2012-3-15
• 单位上海第二工业大学; 上海理工大学; 重庆师范大学