Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect |
| |
| Affiliation: | 1. School of Management, Sichuan Agricultural University, Chengdu 611130, PR China;2. Rowe School of Business, Dalhousie University, Halifax NS B3H 4R2, Canada;3. School of Management and Economics, University of Electronic Science and Technology of China, Chengdu 611731, PR China;1. College of Mechanical Engineering, Yangzhou University, Yangzhou 225127, China;2. College of Mechanical and Electrical Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China;3. Departamento de Sistemas Informáticos y Computación/AI2, Universitat Politècnica de València, Camino de Vera s/n 46022, Valencia, Spain |
| |
| Abstract: | In this study, we introduce a time-dependent learning effect into a single-machine scheduling problem. The time-dependent learning effect of a job is assumed to be a function of total normal processing time of jobs scheduled in front of it. We introduce it into a single-machine scheduling problem and we show that it remains polynomially solvable for the objective, i.e., minimizing the total completion time on a single machine. Moreover, we show that the SPT-sequence is the optimal sequence in this problem. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
