Abstract
AbstractIn this paper, an enhanced estimation of distribution algorithm (EEDA) is proposed for the no-wait job shop scheduling problem (NWJSSP) with the makespan criterion, which has been proved to be strongly NP-hard. The NWJSSP can be decomposed into the sequencing and the timetabling problems. The proposed EEDA and a shift timetabling method are used to address the sequencing problem and the timetabling problem, respectively. In EEDA, the EDA-based search is applied to guiding the search to some promising sequences or regions, and an Interchange-based local search is presented to perform the search from these promising regions. Moreover, each individual or sequence of EEDA is decoded by applying a shift timetabling method to solving the corresponding timetabling problem. The experimental results show that the combination of the EEDA and the shift timetabling method can accelerate the convergence speed and is helpful in achieving more competitive results.KeywordsNo-wait job shop scheduling problemsequencingtimetablingenhanced estimation of distribution algorithm
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.
