Abstract
Automatic design of stochastic local search algorithms has been shown to be very effective in generating algorithms for the permutation flowshop problem for the most studied objectives including makespan, flowtime and total tardiness. The automatic design system uses a configuration tool to combine algorithmic components following a set of rules defined as a context-free grammar. In this paper we use the same system to tackle two of the most studied additional constraints for these objectives: sequence dependent setup times and no-idle constraint. Additional components have been added to adapt the system to the new problems while keeping intact the grammar structure and the experimental setup. The experiments show that the generated algorithms outperform the state of the art in each case.
Highlights
Automatic algorithm design (AAD) has shown to be able to produce state-of-the-art algorithms for the permutation flowshop problem [43]
The algorithmic components were implemented in the EMILI framework, a flexible framework that allows the generation of stochastic local search (SLS) algorithms
The algorithm described in Eq (6) is an iterated local search (ILS) that uses lspfsp as local search, it is executed for 20 s, performs two random steps in the ex change neighborhood as perturbation and accepts only improving the candidate solution, an acceptance criterion based on the Metropolis condition and not applying any SLS to the perturbed solution
Summary
Automatic algorithm design (AAD) has shown to be able to produce state-of-the-art algorithms for the permutation flowshop problem [43]. AAD is used to tackle the permutation flowshop problem with the sequence dependent setup times and the no-idle constraints. The permutation flowshop problem with sequence dependent setup times, PFSPsdst, has been introduced to model this scenario. This problem has been shown to be NP -hard, considering the makespan objective, even when there is only one machine [18]. Following the same reasoning about complexity hierarchies for scheduling problems [46], the no-idle per mutation flowshop problem can be assumed to be NP -hard when considering the total completion time and total tardiness objectives. Operations Research Perspectives 8 (2021) 100180 permutation flowshop problem with the sequence dependent setup times and the no-idle constraints.
Sign-in/Register to view highlights & summary 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.
