کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1704388 | 1012407 | 2013 | 8 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Single-machine scheduling problems with an actual time-dependent deterioration Single-machine scheduling problems with an actual time-dependent deterioration](/preview/png/1704388.png)
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.
Journal: Applied Mathematical Modelling - Volume 37, Issue 7, 1 April 2013, Pages 5555–5562