Solving Rescheduling Problems in Dynamic Permutation Flow Shop Environments with Multiple Objectives Using the Hybrid Dynamic Non-Dominated Sorting Genetic II Algorithm
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 solutio...
Main Authors: | Pablo Valledor, Alberto Gomez, Javier Puente, Isabel Fernandez |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-07-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/10/14/2395 |
Similar Items
-
Solving the permutation flow shop problem with blocking and setup time constraints
by: Mauricio Iwama Takano, et al.
Published: (2020-03-01) -
A Variable Block Insertion Heuristic for Solving Permutation Flow Shop Scheduling Problem with Makespan Criterion
by: Damla Kizilay, et al.
Published: (2019-05-01) -
Improved Jaya Algorithm for Flexible Job Shop Rescheduling Problem
by: Kaizhou Gao, et al.
Published: (2020-01-01) -
Tracking Predictive Gantt Chart for Proactive Rescheduling in Stochastic Resource Constrained Project Scheduling
by: Mario Brčić, et al.
Published: (2018-12-01) -
Solving the Distributed Permutation Flow-Shop Scheduling Problem Using Constrained Programming
by: Christos Gogos
Published: (2023-11-01)