IMOEA/D to optimize job release problem for reentrant hybrid flow shops

2021 ◽  
pp. 107800
Author(s):  
Xiaoyan Yan ◽  
Xiuli Wu
Keyword(s):  
Flow Shops ◽  
Hybrid Flow Shops

Scheduling algorithms for two-stage reentrant hybrid flow shops: minimizing makespan under the maximum allowable due dates

2008 ◽  
Vol 42 (9-10) ◽  
pp. 963-973 ◽  
Author(s):  
Hyun-Seon Choi ◽  
Hyung-Won Kim ◽  
Dong-Ho Lee ◽  
Junggee Yoon ◽  
Chang Yeon Yun ◽  
...  
Keyword(s):  
Scheduling Algorithms ◽  
Due Dates ◽  
Two Stage ◽  
Flow Shops ◽  
Hybrid Flow Shops

scholarly journals Minimizing The Number of Tardy Jobs in Hybrid Flow Shops with Non-Identical Multiple Processors

2018 ◽  
Vol 6 (1) ◽  
pp. 62-73
Author(s):  
Daryl Santos ◽  
Ivan Roa
Keyword(s):  
Processing Time ◽  
Superior Performance ◽  
Due Dates ◽  
Due Date ◽  
Flow Shops ◽  
Number Of Tardy Jobs ◽  
Multiple Processors ◽  
Hybrid Flow Shops ◽  
The Impact ◽  
Tardy Jobs

Two-stage hybrid flow shops (a.k.a., flow shops with multiple processors (FSMPs)) are studied wherein the multiple processors at a stage are non-identical, but related (a.k.a., uniform) in their processing speeds.   The impact of ten different dispatching procedures on a due-date based criterion (specifically, the number of tardy jobs) is analyzed over a set of 1,800 problems of varying configurations wherein the number of jobs per problem is between 20 and 100 and their due dates are randomly assigned.  Results indicate that the modified due date (MDD), earliest due date (EDD), slack (SLK), shortest processing time (SPT), and least work remaining (LWR) rules are statistically inseparable but yield superior performance to the other rules included in this study.  The longest processing time (LPT) and most work remaining (MWR) rules provide the poorest performance.

Sign in / Sign up

Export Citation Format

Share Document