Abstract
This paper deals with the so-called Open Shop Scheduling Problem (OSSP) with makespan objective, which consists of scheduling a set of jobs that must visit a set of machines in no established order so the maximum completion time among the jobs is minimized. This problem is known to be NP-hard, and the absence of specific routes for the processing of the jobs makes its solution space extremely large. In this work we propose several efficient constructive heuristics that exploit some specific properties of the OSSP. We carry out an extensive computational experience using problem instances taken from the related literature to assess the performance of the proposed algorithms as compared to existing ones with respect to the quality of the solutions and the CPU time required. The extensive computational tests show the excellent performance of the heuristics proposed, resulting in the best-so-far heuristics for the problem.
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.
