Abstract
This article considers a single machine scheduling problem with an availability constraint under simple linear deterioration. The non-preemptive case is taken into account as well. The objective is to minimize the makespan in the system. The addressed problem is first described as a 0–1 integer programming model, and is then solved optimally. Subsequently, we prove that the addressed problem belongs to NP-hard. Thus, some heuristic algorithms based on the bin packing concepts are provided for solving the addressed problem. Computational results show that the proposed algorithm H3 performs well. In addition, a good strategy that sets the maintenance to start epoch when half the jobs have been already processed is suggested as well.
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 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.
