Solving Rescheduling Problems in Dynamic Permutation Flow Shop Environments with Multiple Objectives Using the Hybrid Dynamic Non-Dominated Sorting Genetic II Algorithm

Pablo Valledor, Alberto Gomez, Javier Puente and Isabel Fernandez
Additional contact information
Pablo Valledor: Global R & D Asturias, ArcelorMittal Inc., 33400 Avilés, Spain
Alberto Gomez: Department of Business Administration, Polytechnic School of Engineering, University of Oviedo, 33204 Gijon, Spain
Javier Puente: Department of Business Administration, Polytechnic School of Engineering, University of Oviedo, 33204 Gijon, Spain
Isabel Fernandez: Department of Business Administration, Polytechnic School of Engineering, University of Oviedo, 33204 Gijon, Spain

Mathematics, 2022, vol. 10, issue 14, 1-20

Abstract: In this work, we seek to design a model that contributes to the study and resolution of a multi-objective rescheduling problem in dynamic permutation flow shop contexts. In this type of problem, where the objectives can be valued in heterogeneous units, the difficulty of achieving an optimal solution leads to finding a set of non-dominated efficient solutions (also called Pareto front). On the other hand, we will also consider the potential appearance of disruptions in planned scheduling (such as machine breakdowns or arrival of new priority jobs) that require a rapid re-planning of the aforementioned scheduling. In this paper, a hybrid dynamic non-dominated sorting genetic II metaheuristic (HDNSGA-II) is proposed to find the optimal Pareto front. The algorithm is applied to a benchmark already tested in previous studies, defined by three conflicting objective functions (makespan, total weighted tardiness, and stability) and three different types of disruption (machine breakdowns, incorporation of new jobs, and modifications in process times). According to the statistical comparison performed, the HDNSGA-II algorithm performs better in the designed environment, especially in larger problems.

Keywords: scheduling; multi-objective; dynamic scheduling; predictive-reactive; greedy (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/14/2395/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/14/2395/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:14:p:2395-:d:858296

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().