What is it about?
We have developed a mathematical model and customized solution approaches to solve a production planning problem that appears in food industries.
Featured Image
Photo by Elevate on Unsplash
Why is it important?
The addressed problem is NP-hard in the strong sense, i.e., it can not be solved at an acceptable computational time by traditional approaches. In this paper, we have provided an efficient heuristic algorithm that can quickly find high-quality solutions.
Perspectives
Writing this article was a great pleasure. I worked together with two respected researchers in the optimization field. Our computational results have evidenced that the algorithm proposed in this article is very efficient.
Willy Alves de Oliveira Soler
Universidade Federal de Mato Grosso do Sul
Read the Original
This page is a summary of: MIP approaches for a lot sizing and scheduling problem on multiple production lines with scarce resources, temporary workstations, and perishable products, Journal of the Operational Research Society, August 2019, Taylor & Francis,
DOI: 10.1080/01605682.2019.1640588.
You can read the full text:
Contributors
The following have contributed to this page
