|
|||||
|
|
Single-machine group scheduling with linearly decreasing time-dependent setup times and job processing times |
|
| Authors: | Ji-Bo Wang Linyan Sun |
| Affiliation: | 1.Operations Research and Cybernetics Institute, School of Science,Shenyang Institute of Aeronautical Engineering,Shenyang,People’s Republic of China;2.Knowledge Management and Innovation Research Centre,Xi’an Jiaotong University,Xi’an,People’s Republic of China;3.Management School,Xi’an Jiaotong University,Xi’an,People’s Republic of China;4.The State Key Laboratory on Mechanic Manufacturing,Xi’an Jiaotong University,Xi’an,People’s Republic of China;5.The Key Laboratory of the Ministry of Education on Process Control and Efficiency,Xi’an Jiaotong University,Xi’an,People’s Republic of China |
| Abstract: | This paper considers single-machine scheduling problems with group technology (GT). We consider the case of group setup times and job processing times are a decreasing function of their starting time. We first prove that the makespan minimization problem remains polynomially solvable under the general decreasing linear deterioration. We then prove that the total weighted completion time minimization problem remains polynomially solvable under the proportional decreasing linear deterioration. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |