Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time

The problem of scheduling independent jobs on several serial workshops consisting of identical parallel machines is studied. Each job is processed by one machine in each workshop. This workshop environment is called a hybrid Flowshop. Each job has its own due-date and the objective is to minimize maximum tardiness or maximum completion time. Given that the problem is NP-hard, a set of list algorithms is developed to solve it. To evaluate the quality of these heuristics, lower bounds on the optimal solution have been derived and compared to the value of the heuristics on 1920 problems. Our results indicate that a heuristic based on Nawaz et al. (1983) method outperformed the other approaches.

[1]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[2]  J. R. Jackson.  SCHEDULING A PRODUCTION LINE TO MINIMIZE MAXIMUM TARDINESS , 1955 .

[3]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[4]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[5]  W. Townsend.  Note---Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution , 1977 .

[6]  Eugene L. Lawler,et al.  On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming , 1978, JACM.

[7]  Julius Surkis,et al.  Evaluation of a Heuristic for Scheduling Independent Jobs on Parallel Identical Processors , 1979 .

[8]  Eugene L. Lawler,et al.  Scheduling open shops with parallel machines , 1982, Oper. Res. Lett..

[9]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[10]  J. Grabowski,et al.  On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness , 1983 .

[11]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[12]  Seetuarma L. Narastmhan,et al.  Scheduling in a two-stage manufacturing process , 1984 .

[13]  C. Dennis Pegden,et al.  A survey and evaluation of static flowshop scheduling heuristics , 1984 .

[14]  Seetharama L. Narasimhan,et al.  A COMPARISON OF SEQUENCING RULES FOR A TWO‐STATE HYBRID FLOW SHOP , 1987 .

[15]  Michael A. Langston,et al.  Interstage Transportation Planning in the Deterministic Flow-Shop Environment , 1987, Oper. Res..

[16]  Chelliah Sriskandarajah,et al.  Scheduling algorithms for flexible flowshops: Worst and average case performance , 1988 .

[17]  Jatinder N. D. Gupta,et al.  Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .

[18]  Chelliah Sriskandarajah,et al.  Performance of scheduling algorithms for no-wait flowshops with parallel machines , 1988 .

[19]  Chelliah Sriskandarajah.  Production Scheduling: Complexity and Approximate Algorithms , 1988 .

[20]  Rainer Leisten,et al.  Flowshop sequencing problems with limited buffer storage , 1990 .

[21]  T.C.E. Cheng,et al.  A state-of-the-art review of parallel-machine scheduling research , 1990 .

[22]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[23]  J. Gupta,et al.  Schedules for a two-stage hybrid flowshop with parallel machines at the second stage , 1991 .

[24]  A. Guinet,et al.  Textile Production Systems: a Succession of Non-identical Parallel Processor Shops , 1991 .

[25]  Jiyin Liu,et al.  Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling , 1993 .

[26]  Chandrasekharan Rajendran,et al.  A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria , 1994 .

[27]  George L. Vairaktarakis,et al.  Minimizing makespan in hybrid flowshops , 1994, Oper. Res. Lett..

[28]  John L. Hunsucker,et al.  Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment , 1994 .

[29]  Marius M. Solomon,et al.  A computational study of heuristics for two-stage flexible flowshops , 1996 .