Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
[EN] The mixed no-idle flowshop scheduling problem arises in modern industries including integrated circuits, ceramic frit and steel production, among others, and where some machines are not allowed to remain idle between jobs. This paper describes an exact algorithm that uses Benders decomposition...
| Autores: | , , |
|---|---|
| Tipo de documento: | artigo |
| Data de publicação: | 2020 |
| País: | España |
| Recursos: | Universitat Politècnica de València (UPV) |
| Repositório: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Idioma: | inglês |
| OAI Identifier: | oai:riunet.upv.es:10251/170778 |
| Acesso em linha: | https://riunet.upv.es/handle/10251/170778 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Flowshop scheduling Mixed no-idle Benders decomposition Referenced local search ESTADISTICA E INVESTIGACION OPERATIVA |
| Resumo: | [EN] The mixed no-idle flowshop scheduling problem arises in modern industries including integrated circuits, ceramic frit and steel production, among others, and where some machines are not allowed to remain idle between jobs. This paper describes an exact algorithm that uses Benders decomposition with a simple yet effective enhancement mechanism that entails the generation of additional cuts by using a referenced local search to help speed up convergence. Using only a single additional optimality cut at each iteration, and combined with combinatorial cuts, the algorithm can optimally solve instances with up to 500 jobs and 15 machines that are otherwise not within the reach of off-the-shelf optimization software, and can easily surpass ad-hoc existing metaheuristics. To the best of the authors' knowledge, the algorithm described here is the only exact method for solving the mixed no-idle permutation flowshop scheduling problem. |
|---|