Abstract
In this paper, we consider the single-machine scheduling problem with a deteriorating function. By the deteriorating function, we mean that the actual job processing time is a function of jobs already processed. We show that the total completion time minimization problem for a ≥ 1 remains polynomially solvable under the proposed model, where a denotes the deterioration rate. For the case of 0 < a < 1, we show that an optimal schedule of the total completion time minimization problem is V-shaped with respect to normal job processing times. We use the classical smallest processing time first rule as a heuristic algorithm for the case of 0 < a < 1 and analyze its worst-case bound.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: The International Journal of Advanced Manufacturing Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
