Resumen
This work addresses the advanced planning and scheduling problem. This problem is an extension of the Flow Shop, Job Shop, Flexible Job Shop, and Integrated Resource Selection and Operation Sequences problems, being its main characteristics the precedence relationship between operations that are part of customer orders, the batch size of the orders, the flexibility of the machines, which are in different plants. In order to solve the problem, a mixed-integer linear programming model is proposed, which seeks to minimize the makespan. The computational results show that the mathematical model was able to solve the cases or instances generated in a satisfactory way.
| Idioma original | Español |
|---|---|
| Título de la publicación alojada | 20th LACCEI International Multi-Conference for Engineering, Education, and Technology |
| Estado | Publicada - 1 ene. 2022 |
Citar esto
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver