کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1704936 | 1012419 | 2011 | 6 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Single-machine total completion time scheduling with a time-dependent deterioration Single-machine total completion time scheduling with a time-dependent deterioration](/preview/png/1704936.png)
In this paper, we consider the single-machine scheduling problems with a time-dependent deterioration. By the time-dependent deterioration, we mean that the processing time of a job is defined by an increasing function of total normal processing time of jobs in front of it in the sequence. The objective is to minimize the total completion time. We develop a mixed integer programming formulation for the problem. The complexity status of this problem remains open. Hence, we use the smallest normal processing time (SPT) first rule as a heuristic algorithm for the general cases and analyze its worst-case error bound. Two heuristic algorithms utilize the V-shaped property are also proposed to solve the problem. Computational results are presented to evaluate the performance of the proposed algorithms.
Journal: Applied Mathematical Modelling - Volume 35, Issue 3, March 2011, Pages 1506–1511