Single-machine scheduling with past-sequence-dependent setup times and effects of deterioration and learning |
| |
Authors: | Ji-Bo Wang Yong Jiang Gang Wang |
| |
Affiliation: | 1. Department of Science, Shenyang Institute of Aeronautical Engineering, Shenyang, 110136, People’s Republic of China 2. School of Humanities and Social Sciences, Dalian University of Technology, Dalian, 116024, People’s Republic of China 3. School of Marxism, Shenyang Normal University, Shenyang, 110034, People’s Republic of China
|
| |
Abstract: | The paper deals with some single-machine scheduling problems with setup time considerations where the processing time of a job is given as a function of its starting times and position in a sequence. The setup times are proportional to the length of the already processed jobs, i.e., the setup times are past-sequence-dependent (p-s-d). We consider the following objective functions: the makespan, the total completion time, the sum of the δth ( $ \delta \geqslant 0 $ ) power of job completion times, the total weighted completion time, the maximum lateness and the number of tardy jobs. We show that the makespan minimization problem, the total completion time minimization problem, and the sum of the δth power of job completion times minimization problem can be solved in polynomial time, respectively. We also show that the total weighted completion time minimization problem, the maximum lateness minimization problem and the number of tardy jobs minimization problem can be solved in polynomial time under certain conditions. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|