Abstract
This paper discusses an uncertain job-shop scheduling problem with the makespan as the performance criterion. Uncertain processing times are described by discrete scenarios. A robust optimization model is established for the job-shop scheduling problem based on a set of bad scenarios to hedge against the risk of achieving substandard performances among these bad scenarios. To solve the established problem, a problem-specific neighborhood structure is constructed by uniting multiple single-scenario neighborhoods. The constructed neighborhood structure is applied in a hybrid local-search algorithm of combining the simulated-annealing search and the tabu technique. An extensive computational experiment was conducted. The developed algorithm was compared with two possible alternative algorithms. The computational results show the efficiency of the defined neighborhood structure and the competitiveness of the developed hybrid local-search algorithm for the established model.
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.
