Single-machine scheduling problems with an actual time-dependent deterioration |
| |
Authors: | Peng Shen Cai-Min Wei Xue Huang |
| |
Institution: | 1. School of Science, Shenyang Aerospace University, Shenyang 110136, China;2. Department of Mathematics, Shantou University, Shantou 515063, China |
| |
Abstract: | In this paper, we consider the single machine scheduling problems with an actual time-dependent deterioration effect. By the actual time-dependent deterioration effect, we mean that the processing time of a job is defined by increasing function of total actual processing time of jobs in front of it in the sequence. We show that even with the introduction of an actual time-dependent deterioration to job processing times, makespan minimization problem, total completion time minimization problem, the total lateness, and the sum of the quadratic job completion times minimization problem remain polynomially solvable, respectively. We also show that the total weighted completion time minimization problem, the discounted total weighted completion time minimization problem, the maximum lateness minimization problem, and the total tardiness minimization problem can be solved in polynomial time under certain conditions. |
| |
Keywords: | Scheduling Single machine Time-dependent Deteriorating jobs |
本文献已被 ScienceDirect 等数据库收录! |
|