Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning |
| |
Authors: | Xiao-Yuan Wang Jian-Jun Wang |
| |
Affiliation: | 1. School of Science, Shenyang Aerospace University, Shenyang 110136, China;2. Faculty of Management and Economics, Dalian University of Technology, Dalian 116024, China |
| |
Abstract: | In this paper we consider the single-machine setup times scheduling with general effects of deterioration and learning. By the general effects of deterioration and learning, we mean that the actual job processing time is a general function of the processing times of the jobs already processed and its scheduled position. 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 show that the problems to minimize the makespan, the sum of the δth (δ>0) power of job completion times, the total lateness are polynomially solvable. We also show that the total weighted completion time minimization problem, the discounted total weighted completion time minimization problem, the maximum lateness (tardiness) minimization problem, the total tardiness minimization problem can be solved in polynomial time under certain conditions. |
| |
Keywords: | Scheduling Single machine Learning effect Deteriorating jobs Setup times |
本文献已被 ScienceDirect 等数据库收录! |
|