A Heuristic-Based Adaptive Iterated Greedy Algorithm for Lot-Streaming Hybrid Flow Shop Scheduling Problem with Consistent and Intermingled Sub-Lots. [PDF]
Sensors (Basel), 2023 Lu Y, Tang Q, Pan Q, Zhao L, Zhu Y.
europepmc +1 more source
Energy-efficient distributed heterogeneous re-entrant hybrid flow shop scheduling problem with sequence dependent setup times considering factory eligibility constraints. [PDF]
Sci Rep, 2022 Geng K, Liu L, Wu Z.
europepmc +1 more source
An Improved Simulated Annealing-Based Decision Model for the Hybrid Flow Shop Scheduling of Aviation Ordnance Handling. [PDF]
Comput Intell Neurosci, 2022 Meng X, Wang N, Liu J, Liu Q.
europepmc +1 more source
Jurnal Teknik Industri, 1999 Flow shop scheduling problem is to schedule a production process of n jobs that go through the same process sequence and the same m machines. Most researches are don to accomplish only one objective, i.e. minimizing makespan. The other objective, such as
Tessa Vanina Soetanto +2 more
doaj
Algorithms, 2017 The no-wait flow shop is a flowshop in which the scheduling of jobs is continuous and simultaneous through all machines without waiting for any consecutive machines.
Laxmi A. Bewoor +2 more
doaj +1 more source
Dataset of metaheuristics for the flow shop scheduling problem with maintenance activities integrated. [PDF]
Data Brief, 2021 Branda A +3 more
europepmc +1 more source
Scheduling flexible flow shops with sequence-dependent setup effect [PDF]
, 2002 Chung-Yang Liu
openalex +1 more source
Journal of Industrial Engineering and Management, 2017 Purpose: Adjusted discrete Multi-Objective Invasive Weed Optimization (DMOIWO) algorithm, which uses fuzzy dominant approach for ordering, has been proposed to solve No-wait two-stage flexible flow shop scheduling problem.
Hassan Jafarzadeh +2 more
doaj +1 more source
A discrete group search optimizer for blocking flow shop multi-objective scheduling
Advances in Mechanical Engineering, 2016 This article presents a multi-objective discrete group search optimizer for blocking flow shop multi-objective scheduling problem. The algorithm is designed to search the Pareto-optimal solutions minimizing the makespan and total flow time for the flow ...
Deng Guanlong, Zhang Shuning, Zhao Mei
doaj +1 more source
A review and classification of heuristics for permutation flow-shop scheduling with makespan objective [PDF]
, 2004 José M. Framiñán +2 more
openalex +1 more source