Abstract
We address in this paper the two-machine open shop problem with set-up time considerations to build schedules that minimize the overall completion time, known as the makespan. In the model we are considering, the set-up, handled by a single server, consists of a preparation phase separated from the processing phase. Once the server completes the preparation of a job, it becomes again available for setting up other jobs, leaving the current one to complete its processing. We prove several NP-completeness results, exhibit a linear time algorithm for a special case, and develop heuristic and hyper-heuristic algorithms to solve the general problem along with an experimental study.
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.
