Contributions to new variants of the open shop scheduling problem: modeling and solution methods

Vol 56, 2024 - 308501
Doctoral Thesis Prize - Step 2
Favorite this paper
How to cite this paper?
Abstract
This doctoral dissertation aimed to study the open shop scheduling problem with many applications in the industrial and services areas. We observed essential constraints for the described environment, which became new variants for the problem as the study of reprocessing or repetition of operations in the production process and the delivery of products through vehicle routing. The objective was the makespan minimization. We proposed heuristic methods for modeling and solving these problems, such as constructive techniques, bio-inspired meta-heuristics, and mathematical programming methods, such as integer linear programming and constraint programming models and matheuristics. For the computational tests, we ran the methods with robust data from classical literature instances adapted to the constraints of the problems under consideration and new instances proposed during the study. The results showed that the proposed exact and approximate methods provided quality solutions with computational efficiency and were competitive compared to the literature methods.

Share your ideas or questions with the authors!

Did you know that the greatest stimulus in scientific and cultural development is curiosity? Leave your questions or suggestions to the author!

Sign in to interact

Have a question or suggestion? Share your feedback with the authors!

Institutions
  • 1 Universidade Federal do Ceará
  • 2 Universidade de São Paulo
Track
  • 15. PM – Mathematical Programming
Keywords
Mathematical modeling
Approximation algorithms
Population algorithms