Advanced search
Start date
Betweenand


A robust optimization approach for the unrelated parallel machine scheduling problem

Full text
Author(s):
De La Vega, Jonathan ; Moreno, Alfredo ; Morabito, Reinaldo ; Munari, Pedro
Total Authors: 4
Document type: Journal article
Source: Top; v. N/A, p. 36-pg., 2022-01-28.
Abstract

In this paper, we address the Unrelated Parallel Machine Scheduling Problem (UPMSP) with sequence- and machine-dependent setup times and job due-date constraints. Different uncertainties are typically involved in real-world production planning and scheduling problems. If ignored, they can lead to suboptimal or even infeasible schedules. To avoid this, we present two new robust optimization models for this UPMSP variant, considering stochastic job processing and machine setup times. To the best of our knowledge, this is the first time that a robust optimization approach is used to address uncertain processing and setup times in the UPMSP with sequence- and machine-dependent setup times and job due-date constraints. We carried out computational experiments to compare the performance of the robust models and verify the impact of uncertainties to the problem solutions when minimizing the production makespan. The results of computational experiments indicate that the robust models incorporate uncertainties appropriately into the problem and produce effective and robust schedules. Furthermore, the results show that the models are useful for analyzing the impact of uncertainties in the cost and risk of the scheduling solutions. (AU)

FAPESP's process: 16/15966-6 - Crew scheduling and routing in network repair under uncertainty
Grantee:Alfredo Daniel Moreno Arteaga
Support Opportunities: Scholarships in Brazil - Doctorate
FAPESP's process: 19/23596-2 - Rich vehicle routing problems: models and algorithms for deterministic and stochastic variants
Grantee:Pedro Augusto Munari Junior
Support Opportunities: Regular Research Grants
FAPESP's process: 15/14582-7 - Stochastic Programming and Robust Optimization to Variants of Vehicle Routing Problem: Formulations and Exact Methods
Grantee:Jonathan Justen de La Vega Martínez
Support Opportunities: Scholarships in Brazil - Doctorate
FAPESP's process: 16/01860-1 - Cutting, packing, lot-sizing, scheduling, routing and location problems and their integration in industrial and logistics settings
Grantee:Reinaldo Morabito Neto
Support Opportunities: Research Projects - Thematic Grants