Global lower bounds for flow shops with multiple processors

1995 ◽  
Vol 80 (1) ◽  
pp. 112-120 ◽  
Author(s):  
D.L. Santos ◽  
J.L. Hunsucker ◽  
D.E. Deal
Keyword(s):  
Lower Bounds ◽  
Flow Shops ◽  
Multiple Processors

scholarly journals A Heuristic Based On Makespan Lower Bounds in Flow Shops with Multiple Processors

2017 ◽  
Vol 5 (1) ◽  
pp. 33-43
Author(s):  
Vikram Srinivasan ◽  
Daryl Santos
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Flow Shop ◽  
Hybrid Flow Shop ◽  
Prior Work ◽  
Processing Stage ◽  
Flow Shops ◽  
Multiple Processors ◽  
Np Complete ◽  
Better Than

Minimum makespan scheduling of Flow Shops with Multiple Processors (FSMPs), also known as the Hybrid Flow Shop (HFS), is classified as NP complete. Thus, the FSMP largely depends on strong heuristics to develop solutions to makespan scheduling instances. An FSMP consists of m stages wherein each stage has one or more processors through which n jobs are scheduled. This paper presents a heuristic based on the lower bound developed in a prior work in order to determine good makespan solutions in the FSMP environment. In the environment studied in this work, the multiple machines available at a particular processing stage are identical processors. In order to evaluate the proposed heuristic, its performance is compared to makespans obtained via the use of modified pure flow shop heuristics. Results show that the proposed heuristic is indeed a strong heuristic for the FSMP and it provides makespans that are better than those provided by some of the already existing pure flow shop heuristics that have been adapted for the FSMP environment.

On makespan improvement in flow shops with multiple processors

2001 ◽  
Vol 12 (3) ◽  
pp. 283-295 ◽  
Author(s):  
D. L. Santos ◽  
J. L. Hunsucker ◽  
D. E. Deal
Keyword(s):  
Flow Shops ◽  
Multiple Processors

Scheduling flow shops with multiple processors

2010 ◽  
Author(s):  
Ali Azadeh ◽  
Mohsen Moghaddam ◽  
Pegah Geranmayeh ◽  
Arash Naghavi
Keyword(s):  
Flow Shops ◽  
Multiple Processors

An evaluation of sequencing heuristics in flow shops with multiple processors

1996 ◽  
Vol 30 (4) ◽  
pp. 681-691 ◽  
Author(s):  
D.L. Santos ◽  
J.L. Hunsucker ◽  
D.E. Deal
Keyword(s):  
Flow Shops ◽  
Multiple Processors

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.

FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors

1995 ◽  
Vol 16 (2) ◽  
pp. 351-366 ◽  
Author(s):  
D. L. Santos ◽  
J. L. Hunsucker ◽  
D. E. Deal
Keyword(s):  
Flow Shops ◽  
Multiple Processors
Sign in / Sign up

Export Citation Format

Share Document