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 Distributed Permutation Flow-Shop Scheduling Problem Using Constrained Programming
by: Christos Gogos
Published: (2023-11-01) -
Learning the Quality of Machine Permutations in Job Shop Scheduling
by: Andrea Corsini, et al.
Published: (2022-01-01) -
Solving a multi-objective job shop scheduling problem using a hybrid genetic algorithm /
by: Piroozfard, Hamed, 1986-, et al.
Published: (2013) -
A Variant Iterated Greedy Algorithm Integrating Multiple Decoding Rules for Hybrid Blocking Flow Shop Scheduling Problem
by: Yong Wang, et al.
Published: (2023-05-01) -
Solving a multi-objective job shop scheduling problem using a hybrid genetic algorithm [electronic resource) /
by: Piroozfard, Hamed, 1986-
Published: (2013)