Development Of A New Heuristic For Scheduling Flow-Shops With Parallel Machines By Prioritizing Bottleneck Stages

Authors:
Shardul Phadnis;Jerald Brevick;Shahrukh Irani
Affiliations:
Russell William Ltd, 1710 Midway Rd, Odenton, MD 21113, U.S.A.;Department of Industrial, Welding and Systems Engineering, The Ohio State University, Columbus, OH 43210, U.S.A.;Department of Industrial, Welding and Systems Engineering, The Ohio State University, Columbus, OH 43210, U.S.A.
Venue:
Journal of Integrated Design & Process Science - Manufacturing And Design
Year:
2003

Citing 6
Cited 2

The shifting bottleneck procedure for job shop scheduling

Management Science
An adaptable scheduling algorithm for flexible flow lines

Operations Research
Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem

Management Science
A heuristic procedure for makespan minimization in job shops with multiple identical processors

ICC&IE Selected papers from the 22nd ICC&IE conference on Computers & industrial engineering
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times11Supported partially by State Science and Technology Commission and National Natural Science Foundation of China.

Operations Research Letters

Simulation assisted optimozation and real-time control aspects of flexible production systems subject to disturbances

Proceedings of the 38th conference on Winter simulation
Simulation assisted match-up rescheduling of flexible production systems subject to execution exceptions

Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come

Quantified Score

Hi-index	0.01

Visualization

Abstract

The flow-shop scheduling problem has been extensively studied in literature. Many researchers have developed various flow-shop scheduling algorithms and heuristics for a variety of cases. The problem of scheduling flow-shops with three or more stages has been shown to be NP-Complete in strong sense. Complexity of the problem increases if one or more of the flow-shop stages have multiple identical (parallel) machines. Flow-shops with parallel machines are quite common in practice, yet comparatively limited amount of research has been performed in the area. In this research work a heuristic procedure, Progressive Bottleneck Improvement (PBI) procedure, is developed for scheduling flow-shops with parallel machines to minimize makespan. This heuristic schedules a set of jobs by identifying the bottleneck stages in the flow-shop, and schedules jobs to improve the overall bottleneck performance. One of the problems in achieving this is that there exists no algorithm that can exactly identify the bottleneck stage in a flow-shop with parallel machines. The PBI heuristic overcomes this difficulty by recalculating the bottleneck every time it sequences a job. The initial sequence thus developed is later improved using certain improvement rules. The heuristic is tested using random data and the datasets used by Wittrock (1988) and Cheng et al. (2001). This paper presents the heuristic and then posts the results obtained.