The hybrid flow shop scheduling problem
R Ruiz, JA Vázquez-Rodríguez - European journal of operational research, 2010 - Elsevier
The scheduling of flow shops with multiple parallel machines per stage, usually referred to
as the hybrid flow shop (HFS), is a complex combinatorial problem encountered in many …
as the hybrid flow shop (HFS), is a complex combinatorial problem encountered in many …
Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
I Ribas, R Leisten, JM Framiñan - Computers & Operations Research, 2010 - Elsevier
In this paper, an extensive review of recently published papers on hybrid flow shop (HFS)
scheduling problems is presented. The papers are classified first according to the HFS …
scheduling problems is presented. The papers are classified first according to the HFS …
Energy-efficient dynamic scheduling for a flexible flow shop using an improved particle swarm optimization
Due to increasing energy requirements and associated environmental impacts, nowadays
manufacturing companies are facing the emergent challenges to meet the demand of …
manufacturing companies are facing the emergent challenges to meet the demand of …
[图书][B] Optimization by GRASP
MGC Resende, CC Ribeiro - 2016 - Springer
Greedy randomized adaptive search procedures, or GRASP, were introduced by T. Feo and
M. Resende in 1989 as a probabilistic heuristic for solving hard set covering problems. Soon …
M. Resende in 1989 as a probabilistic heuristic for solving hard set covering problems. Soon …
A discrete firefly algorithm for the multi-objective hybrid flowshop scheduling problems
MK Marichelvam, T Prabaharan… - IEEE transactions on …, 2013 - ieeexplore.ieee.org
Hybrid flowshop scheduling problems include the generalization of flowshops with parallel
machines in some stages. Hybrid flowshop scheduling problems are known to be NP-hard …
machines in some stages. Hybrid flowshop scheduling problems are known to be NP-hard …
Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan
The multistage hybrid flow shop (HFS) scheduling problems are considered in this paper.
Hybrid flowshop scheduling problems were proved to be NP-hard. A recently developed …
Hybrid flowshop scheduling problems were proved to be NP-hard. A recently developed …
Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks
The trend of globalization has recently seen the study of distributed scheduling problems.
This study attempts to solve the distributed hybrid flowshop scheduling problem with …
This study attempts to solve the distributed hybrid flowshop scheduling problem with …
An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems
The hybrid flow shop scheduling with multiprocessor task (HFSMT) problem is a substantial
production scheduling problem for minimizing the makespan, and there exist many …
production scheduling problem for minimizing the makespan, and there exist many …
A review of scheduling problem and resolution methods in flexible flow shop
T Lee, Y Loong - International Journal of Industrial …, 2019 - growingscience.com
The Flexible flow shop (FFS) is defined as a multi-stage flow shops with multiple parallel
machines. FFS scheduling problem is a complex combinatorial problem which has been …
machines. FFS scheduling problem is a complex combinatorial problem which has been …
Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
V Fernandez-Viagas, P Perez-Gonzalez… - Computers & Operations …, 2019 - Elsevier
In this paper we address the classical hybrid flow shop scheduling problem with makespan
objective. As this problem is known to be NP-hard and a very common layout in real-life …
objective. As this problem is known to be NP-hard and a very common layout in real-life …