Abstract
This paper investigates single-machine scheduling problems with the aging or deteriorating effect under an optional maintenance activity consideration. We assume that the maintenance duration depends on its starting time. We aim to find the optimal location of the maintenance activity and the optimal job sequence for minimizing the makespan as well as the total completion time. We develop polynomial time solutions for all the studied problems. We also discuss some special cases and show that they can be optimally solved by lower order algorithms.
Sign-in/Register to access full text options 
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: INFOR: Information Systems and Operational Research
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.
