Abstract
The flexible job-shop scheduling problem (FJSP) is common in high-mix industries such as semiconductor manufacturing. An FJSP is initiated when an operation can be executed on a machine assigned from a set of alternative machines. Thus, an FJSP consists of the machine assignment and job sequencing sub-problems, which can be resolved using a pair of problem-dependent machine assignment rules (MARs) and job sequencing rules (JSRs). Selecting an MAR–JSR pair that performs efficiently is a challenge. This study proposes a simulated-annealing-based hyper-heuristic (SA-HH) for assembling an heuristic scheme (HS) consisting of MAR–JSR pairs with a set of problem state features. Two variants of SA-HH, i.e. SA-HH based on HS with problem state features (SA-HH) and without problem state features (SA-HH), are investigated. In terms of the best makespan, SA-HH outperforms or is comparable with over 75% of benchmark algorithms on 8 out of 10 instances in the Brandimarte dataset.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.