Exact and approximate methods to solve the Open Shop scheduling problem with explicit sequence-dependent setup times

• Grant number: 20/16341-5
• Support Opportunities: Scholarships in Brazil - Master
• Start date: June 01, 2021
• End date: November 30, 2021
• 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. New variants, related to several problems, have been incorporated to this study area in order to cover the most diverse cases presented in productive area. Within this context, the project aims to study a problem of production scheduling little highlighted in the literature, the open shop scheduling problem. In this study, an important restriction will be observed for the system portrayed: the consideration of explicit setup times, depending on the operations sequence and machines. The objective is to find solutions that minimize some indicator about scheduling quality, such as makespan, flowtime and tardness. For modeling and solving the problem, heuristics and bio-inspired metaheuristics methods will be used as aproximative methods and mathematical programming methods, such as integer linear programming and constraint programming models will be used as exact methods. A case study will be proposed with data collected from a pharmaceutical industry. The results will be compared with the scheduling methods currently used by the company. In addition, for benchmarking, the methods will be run with robust data from classical instances of literature adapted to the constraints of the problem under consideration. (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.; NAGANO, MARCELO S.. A new hybridization of adaptive large neighborhood search with constraint programming for open shop scheduling with sequence-dependent setup times. COMPUTERS & INDUSTRIAL ENGINEERING, v. 168, p. 20-pg., 2022-06-01. (20/16341-5)

ABREU, LEVI R.; PRATA, BRUNO A.; FRAMINAN, JOSE M.; NAGANO, MARCELO S.. New efficient heuristics for scheduling open shops with makespan minimization. Computers & Operations Research, v. 142, p. 21-pg., 2022-06-01. (20/16341-5)

DE ABREU, LEVI RIBEIRO; GUIMARAES ARAUJO, KENNEDY ANDERSON; PRATA, BRUNO DE ATHAYDE; NAGANO, MARCELO SEIDO; MOCCELLIN, JOAO VITOR. A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions. ENGINEERING OPTIMIZATION, AUG 2021. (20/16341-5)