Abstract
This paper addresses job-shop scheduling problems with deteriorating jobs, i.e. jobs whose processing times are an increasing function of their starting time. A simple linear deterioration is assumed and our objective is makespan minimization. We provide a complete analysis of the complexity of flow-shops, open-shops and job-shop problems. We introduce a polynomial-time algorithm for the two-machine flow-shop, and prove NP-hardness when an arbitrary number of machines (three and above) is assumed. Similarly, we introduce a polynomial-time algorithm for the two-machine open-shop, and prove NP-hardness when an arbitrary number of machines (three and above) is assumed. Finally, we prove NP-hardness of the job-shop problem even for two machines.
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 callDisclaimer: 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.
