A proactive task dispatching method based on future bottleneck prediction for the smart factory

B Huang, W Wang, S Ren, RY Zhong… - International Journal of …, 2019 - Taylor & Francis
The smart factory has been widely applied in manufacturing enterprises to meet dynamics in
the global market. Bottleneck-based dispatching method (BDM) is a promising approach to …

A meta-heuristic approach to solve a JIT scheduling problem in hybrid flow shop

S Khalouli, F Ghedjati, A Hamzaoui - Engineering Applications of Artificial …, 2010 - Elsevier
In this paper we address a hybrid flow shop scheduling problem considering the
minimization of the sum of the total earliness and tardiness penalties. This problem is proven …

Study of stochastic sequence-dependent flexible flow shop via developing a dispatching rule and a hybrid GA

K Kianfar, SMTF Ghomi, AO Jadid - Engineering Applications of Artificial …, 2012 - Elsevier
A flexible flow shop is a generalized flow shop with multiple machines in some stages. This
system is fairly common in flexible manufacturing and in process industry. In most practical …

[HTML][HTML] Digital Twin-based bottleneck prediction for improved production control

L Ragazzini, E Negri, L Fumagalli, M Macchi - Computers & Industrial …, 2024 - Elsevier
Bottlenecks in manufacturing systems may significantly reduce their efficiency and
productivity. Therefore, bottleneck analysis is a consolidated topic in Industrial Engineering …

A heuristic for no-wait flow shop scheduling

SU Sapkal, D Laha - The International Journal of Advanced Manufacturing …, 2013 - Springer
This paper presents an efficient heuristic method to minimize total flow time in no-wait flow
shop scheduling. It is based on the assumption that the priority of a job in the initial …

An effective and efficient heuristic for no-wait flow shop production to minimize total completion time

H Ye, W Li, A Abedini, B Nault - Computers & Industrial Engineering, 2017 - Elsevier
No-wait flow shop production has been widely applied in manufacturing. However,
minimization of total completion time for no-wait flow shop production is NP-complete …

A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines

CL Chen, CL Chen - Computers & Operations Research, 2009 - Elsevier
This study developed a bottleneck-based heuristic (BBFFL) to solve a flexible flow line
problem with a bottleneck stage, where unrelated parallel machines exist in all the stages …

A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop

A El-Bouri - Computers & Operations Research, 2012 - Elsevier
Cooperative Dispatching is a real-time scheduling methodology, which consults
downstream machines before making a job dispatching decision on any given machine …

瓶颈指向的启发式算法求解混合流水车间调度问题

屈国强 - 信息与控制, 2012 - xk.sia.cn
针对以最小化时间表长为目标的复杂混合流水车间调度问题, 提出了一种将机器布局和工件加工
时间特征紧密结合的启发式算法. 首先, 充分利用各阶段平均机器负荷一般不相等的特点确定 …

An improved heuristic to minimize total flow time for scheduling in the m-machine no-wait flow shop

D Laha, SU Sapkal - Computers & Industrial Engineering, 2014 - Elsevier
In this paper, we present a constructive heuristic to minimize total flow time criterion for the
well-known NP-hard no-wait flow shop scheduling problem. It is based on the assumption …