A comprehensive review on NSGA-II for multi-objective combinatorial optimization problems
This paper provides an extensive review of the popular multi-objective optimization
algorithm NSGA-II for selected combinatorial optimization problems viz. assignment …
algorithm NSGA-II for selected combinatorial optimization problems viz. assignment …
A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation
The permutation flowshop problem is a classic machine scheduling problem where n jobs
must be processed on a set of m machines disposed in series and where each job must visit …
must be processed on a set of m machines disposed in series and where each job must visit …
Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends
MM Yenisey, B Yagmahan - Omega, 2014 - Elsevier
The flow shop scheduling problem is finding a sequence given n jobs with same order at m
machines according to certain performance measure (s). The job can be processed on at …
machines according to certain performance measure (s). The job can be processed on at …
Optimizing production scheduling with the spotted hyena algorithm: A novel approach to the flow shop problem
The spotted hyena optimization algorithm (SHOA) is a novel approach for solving the flow
shop-scheduling problem in manufacturing and production settings. The motivation behind …
shop-scheduling problem in manufacturing and production settings. The motivation behind …
A co-evolutionary genetic algorithm for the two-machine flow shop group scheduling problem with job-related blocking and transportation times
S Yuan, T Li, B Wang - Expert Systems with Applications, 2020 - Elsevier
This study investigates a new two-machine flow shop group scheduling problem with job-
related blocking and transportation times, which is derived from the realistic pipe-making …
related blocking and transportation times, which is derived from the realistic pipe-making …
Hybridization of Particle Swarm Optimization with Variable Neighborhood Search and Simulated Annealing for Improved Handling of the Permutation Flow-Shop …
Permutation flow-shop scheduling is the strategy that ensures the processing of jobs on
each subsequent machine in the exact same order while optimizing an objective, which …
each subsequent machine in the exact same order while optimizing an objective, which …
A self-guided genetic algorithm for permutation flowshop scheduling problems
In this paper we develop a Self-guided Genetic Algorithm (Self-guided GA), which belongs
to the category of Estimation of Distribution Algorithms (EDAs). Most EDAs explicitly use the …
to the category of Estimation of Distribution Algorithms (EDAs). Most EDAs explicitly use the …
A hybrid multi-objective genetic algorithm based on the ELECTRE method for a capacitated flexible job shop scheduling problem
In this paper, a multi-objective flexible job shop scheduling problem with machines capacity
constraints is studied. Minimizing the makespan and overtime costs of machines are …
constraints is studied. Minimizing the makespan and overtime costs of machines are …
Swarm intelligent based metaheuristics for a bi-objective flexible job shop integrated supply chain scheduling problems
This study introduces a bi-objective integrated supply chain (SC) scheduling (SCS) model to
deal with the challenges of providing highly customized and on-time delivery requirements …
deal with the challenges of providing highly customized and on-time delivery requirements …
Reduction of carbon emissions and project makespan by a Pareto-based estimation of distribution algorithm
Due to the increasing concerns about global warming, low-carbon production has been a
hot topic around the world. In this paper, carbon emissions reduction and project makespan …
hot topic around the world. In this paper, carbon emissions reduction and project makespan …