کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1133430 | 1489078 | 2015 | 8 صفحه PDF | دانلود رایگان |
• Concept of deteriorating and resource-dependent maintenance is introduced.
• Four single-machine scheduling problems are analyzed.
• Measures are makespan, flowtime, maximum tardiness and due-date related.
• Solving algorithms are proposed for the considered problems.
In this paper we investigate scheduling problems with a deteriorating and resource-dependent maintenance activity on a single machine. The duration of the maintenance is assumed to be dependent both on its starting time and on the resource allocated to it. The objective is determining the job sequence, the position to perform a maintenance activity and the amount of additional resource allocated to it such that the total cost of related measure and resource is minimized. The considered measures are the makespan, flowtime, maximum tardiness and combination of earliness, tardiness and due-date. Analysis results show that all the considered problems are polynomially solvable.
Journal: Computers & Industrial Engineering - Volume 88, October 2015, Pages 479–486