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 …
A survey of scheduling problems with no-wait in process
A Allahverdi - European Journal of Operational Research, 2016 - Elsevier
Scheduling involving no-wait in process plays an important role in industries such as plastic,
chemical, and pharmaceutical. Moreover, many scheduling problems in other industries …
chemical, and pharmaceutical. Moreover, many scheduling problems in other industries …
[PDF][PDF] 混合流水车间调度问题研究综述
李颖俐, 李新宇, 高亮 - 中国机械工程, 2020 - qikan.cmes.org
混合流水车间在流水车间的基础上, 在所有或部分阶段引入多台可选择的并行机器,
提高了车间的生产能力和柔性, 是车间调度领域的研究热点之一. 按阶段数和机器特征对混合 …
提高了车间的生产能力和柔性, 是车间调度领域的研究热点之一. 按阶段数和机器特征对混合 …
A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling
This research investigates a two-stage no-wait hybrid flow-shop scheduling problem in
which the first stage contains a single machine, and the second stage contains several …
which the first stage contains a single machine, and the second stage contains several …
A hybridization of evolution strategies with iterated greedy algorithm for no-wait flow shop scheduling problems
This study investigates the no-wait flow shop scheduling problem and proposes a hybrid
(HES-IG) algorithm that utilizes makespan as the objective function. To address the …
(HES-IG) algorithm that utilizes makespan as the objective function. To address the …
No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan
The no-wait flowshop scheduling problem on m machines with separate setup times is
addressed to minimize total tardiness with an upper bound on makespan. Conditions for a …
addressed to minimize total tardiness with an upper bound on makespan. Conditions for a …
A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem
Considering the practical application and the computational complexity of the two-stage no-
wait hybrid flow shop scheduling problem, this paper proposes a genetic algorithm (GA) …
wait hybrid flow shop scheduling problem, this paper proposes a genetic algorithm (GA) …
Review on Hybrid Flow Shop Scheduling Problems.
LI Yingli, L Xinyu, G Liang - China mechanical engineering, 2020 - search.ebscohost.com
Hybrid flow shop scheduling problems (HFSP), one of popular research topics in the field of
shop scheduling, several alternative parallel machines in all or part of stages of the flow …
shop scheduling, several alternative parallel machines in all or part of stages of the flow …
A meta-heuristic approach for solving the no-wait flow-shop problem
H Samarghandi, TY ElMekkawy - International Journal of …, 2012 - Taylor & Francis
No-wait flow-shop scheduling problems refer to the set of problems in which a number of
jobs are available for processing on a number of machines in a flow-shop context with the …
jobs are available for processing on a number of machines in a flow-shop context with the …