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 …
Mathematical model and knowledge-based iterated greedy algorithm for distributed assembly hybrid flow shop scheduling problem with dual-resource constraints
F Yu, C Lu, J Zhou, L Yin - Expert Systems with Applications, 2024 - Elsevier
With the development of economic globalization, distributed hybrid flow shop scheduling
problem (DHFSSP) has become prevalent in realistic manufacturing systems. Moreover, to …
problem (DHFSSP) has become prevalent in realistic manufacturing systems. Moreover, to …
Genetic algorithm-based road network design for optimising the vehicle travel distance
N Shanmugasundaram, K Sushita… - … Journal of Vehicle …, 2019 - inderscienceonline.com
One-way road networks can be designed with the aid of computer program. However, the
use of genetic algorithm in such design is new. This research paper presents a new …
use of genetic algorithm in such design is new. This research paper presents a new …
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
Over the last decade, many metaheuristics have been applied to the flowshop scheduling
problem, ranging from Simulated Annealing or Tabu Search to complex hybrid techniques …
problem, ranging from Simulated Annealing or Tabu Search to complex hybrid techniques …
The distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling
problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or …
problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or …
Evolutionary multiobjective blocking lot-streaming flow shop scheduling with machine breakdowns
In various flow shop scheduling problems, it is very common that a machine suffers from
breakdowns. Under this situation, a robust and stable suboptimal scheduling solution is of …
breakdowns. Under this situation, a robust and stable suboptimal scheduling solution is of …
A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times
E Vallada, R Ruiz - European Journal of Operational Research, 2011 - Elsevier
In this work a genetic algorithm is presented for the unrelated parallel machine scheduling
problem in which machine and job sequence dependent setup times are considered. The …
problem in which machine and job sequence dependent setup times are considered. The …
A scatter search algorithm for the distributed permutation flowshop scheduling problem
The distributed permutation flowshop problem has been recently proposed as a
generalization of the regular flowshop setting where more than one factory is available to …
generalization of the regular flowshop setting where more than one factory is available to …
A hybrid multi-objective grey wolf optimizer for dynamic scheduling in a real-world welding industry
Welding is one of the most important technologies in manufacturing industries due to its
extensive applications. Welding scheduling can affect the efficiency of the welding process …
extensive applications. Welding scheduling can affect the efficiency of the welding process …