A hybrid dynamic programming for solving a mixed-model sequencing problem with production mix restriction and free interruptions
In this article, we propose a hybrid procedure based on bounded dynamic programming assisted by linear programming to solve the mixed-model sequencing problem with workload minimization with serial workstations, free interruption of the operations and with production mix restrictions. We performed a...
| Autores: | , , |
|---|---|
| Tipo de documento: | artigo |
| Data de publicação: | 2016 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositório: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglês |
| OAI Identifier: | oai:upcommons.upc.edu:2117/89599 |
| Acesso em linha: | https://hdl.handle.net/2117/89599 https://dx.doi.org/10.1007/s13748-016-0101-5 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Heuristic algorithms Mixed-model sequencing Dynamic programming Mixed integer linear programming Hybrid metaheuristics Industrial application Programació heurística Àrees temàtiques de la UPC::Economia i organització d'empreses |
| Resumo: | In this article, we propose a hybrid procedure based on bounded dynamic programming assisted by linear programming to solve the mixed-model sequencing problem with workload minimization with serial workstations, free interruption of the operations and with production mix restrictions. We performed a computational experiment with 23 instances related to a case study of the Nissan powertrain plant located in Barcelona. The results of our proposal are compared with those obtained by mixed integer linear programming. |
|---|