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

• Grant number: 21/11586-2
• Support Opportunities: Scholarships in Brazil - Doctorate (Direct)
• Start date: August 01, 2022
• End date: March 31, 2023
• Field of knowledge: Engineering - Production Engineering - Operational Research
• Principal Investigator: Marcelo Seido Nagano
• Grantee: Levi Ribeiro de Abreu
• Host Institution: Escola de Engenharia de São Carlos (EESC). Universidade de São Paulo (USP). São Carlos , SP, Brazil

Abstract

Several studies have been carried out regarding the optimization of production scheduling in industrial environments. As a result, new variants related to several problems have been incorporated into this study area to cover the most diverse cases presented in productive environments. Within this context, this project aims to study a production scheduling problem little highlighted in the literature, the production scheduling problem in a open shop environment. In this study, we will observe essential constraints for the represented environment, becoming new variants for the problem: the sequence-dependent setup times; the delivery of products through the vehicle routing problem; the study of reprocessing or repetition of operations in the production process and the consideration of multiple factories in a distributed production environment. The objective of these problems is to minimize the total duration of the schedule (makespan). We propose heuristic methods for modeling and solving these problems, such as priority rules, constructive techniques, bio-inspired meta-heuristics, and mathematical programming methods like integer linear programming and constraint programming models. For the computational tests, we will run the methods with robust data from classical literature instances adapted to the constraints of the problems under consideration or new instances proposed during the work. (AU)

Scientific publications

(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)

ABREU, LEVI R. R.; NAGANO, MARCELO S. S.; PRATA, BRUNO A. A.. A new two-stage constraint programming approach for open shop scheduling problem with machine blocking. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v. N/A, p. 20-pg., 2022-12-15. (21/11586-2)

DE ABREU, LEVI RIBEIRO; PRATA, BRUNO DE ATHAYDE; GOMES, ALLAN COSTA; BRAGA-SANTOS, STEPHANIE ALENCAR; NAGANO, MARCELO SEIDO. A novel BRKGA for the customer order scheduling with missing operations to minimize total tardiness. SWARM AND EVOLUTIONARY COMPUTATION, v. 75, p. 13-pg., 2022-12-01. (21/11586-2)

ABREU, LEVI R.; PRATA, BRUNO A.; NAGANO, MARCELO S.; FRAMINAN, JOSE M.. A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization. Computers & Operations Research, v. 160, p. 12-pg., 2023-12-01. (21/11586-2)

Academic Publications

(References retrieved automatically from State of São Paulo Research Institutions)

ABREU, Levi Ribeiro de. Contributions to new variants of the open shop scheduling problem: modeling and solution methods. 2023. Doctoral Thesis - Universidade de São Paulo (USP). Escola de Engenharia de São Carlos (EESC/SBD) São Carlos.