کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1704532 | 1012410 | 2013 | 7 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Single-machine scheduling with effects of exponential learning and general deterioration Single-machine scheduling with effects of exponential learning and general deterioration](/preview/png/1704532.png)
The purpose of this study is to explore the single-machine scheduling with the effects of exponential learning and general deterioration. By the effects of exponential learning and general deterioration, we meant that job processing time is decided by the functions of their starting time and positions in the sequence. Results showed that with the introduction of learning effect and deteriorating jobs to job processing time, single-machine makespan, and sum of completion time (square) minimization problems remained polynomially solvable, respectively. But for the following objective functions: the weighted sum of completion time and the maximum lateness, this paper proved that the weighted smallest basic processing time first (WSPT) rule and the earliest due date first (EDD) rule constructed the optimal sequence under some special cases, respectively.
Journal: Applied Mathematical Modelling - Volume 37, Issue 4, 15 February 2013, Pages 2293–2299