Minimizing makespan in parallel flowshops

In this study, a new class of proportional parallel flow shop problems with the objective of minimizing the makespan has been addressed. A special case for this problem in which jobs are processed on only one machine as opposed to two or more machines in a flow shop, is the well-known multiple processor problem which is NP-complete. The parallel processor problem is a restricted version of the problems addressed in this paper and hence are NP-complete. We develop and test heuristic and simulation approaches to solve large scale problems, while using exact procedures for smaller problems. The performance of the heuristics relative to the LP lower bound as well as a comparison with the truncated integer programming solution are reported. The performance of the heuristics and the simulation results were encouraging.

[1]  Edward G. Coffman,et al.  Algorithms for Minimizing Mean Flow Time , 1974, IFIP Congress.

[2]  Teofilo F. Gonzalez,et al.  Preemptive Scheduling of Uniform Processor Systems , 1978, JACM.

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[5]  Jane W.-S. Liu,et al.  Bounds on Scheduling Algorithms for Heterogeneous Comnputing Systems , 1974, IFIP Congress.

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

[7]  J. J. Brennan,et al.  An Improved Algorithm for Scheduling Jobs on Identical Machines , 1977 .

[8]  Prabuddha De,et al.  SCHEDULING TO MINIMIZE MAKESPAN ON UNEQUAL PARALLEL PROCESSORS , 1980 .

[9]  Gupta J.N.D..  TWO-STAGE HYBRID FLOW SHOP SCHEDULING PROBLEM , 1988 .

[10]  Edward G. Coffman,et al.  Scheduling independent tasks to reduce mean finishing time , 1974, CACM.

[11]  D. Chaudhuri,et al.  A multi-stage parallel-processor flowshop problem with minimum flowtime , 1992 .

[12]  Oscar H. Ibarra,et al.  Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors , 1977, JACM.

[13]  Michael H. Rothkopf,et al.  Scheduling Independent Tasks on Parallel Processors , 1966 .

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

[15]  Salah E. Elmaghraby,et al.  On the Scheduling of Jobs on a Number of Identical Machines. , 1972 .

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

[17]  Oscar H. Ibarra,et al.  Bounds for LPT Schedules on Uniform Processors , 1977, SIAM J. Comput..