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 …
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 …
Bottlenecks in manufacturing systems may significantly reduce their efficiency and productivity. Therefore, bottleneck analysis is a consolidated topic in Industrial Engineering …
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 …
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 …
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 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 …
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 …