A Heuristic to Minimize Makespan in Proportional Parallel Flow Shops

This paper addresses the problem of minimizing the makespan on a two-stage parallel flow shops with proportional processing times. The problem of scheduling n independent jobs on m proportional parallel flow shops to minimize makespan is known to be NP-hard and hence too difficult to solve in polynomial time. A multiphase heuristic algorithm to minimize the makespan on two proportional parallel flow shops is proposed. A simulation study is conducted to examine the effectiveness of the proposed heuristic algorithm for small and large problems. The results and analysis of quite extensive computational experiments for small size problems show that the proposed algorithm can yield solutions within a few percent of optimal solutions. The computational results for large size problems show that the performance of the proposed algorithm is relatively more effective than the existing SKV algorithm.

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

[2]  P. S. Sundararaghavan,et al.  Minimizing makespan in parallel flowshops , 1997 .

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

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

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

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

[7]  C. N. Potts,et al.  Analysis of a linear programming heuristic for scheduling unrelated parallel machines , 1985, Discret. Appl. Math..

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

[9]  Paolo Toth,et al.  Exact and Approximation Algorithms for Makespan Minimization on Unrelated Parallel Machines , 1997, Discret. Appl. Math..

[10]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[11]  Jeffrey M. Jaffe,et al.  Algorithms for Scheduling Tasks on Unrelated Processors , 1981, JACM.

[12]  Chris N. Potts,et al.  Heuristics for scheduling unrelated parallel machines , 1991, Comput. Oper. Res..

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

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

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

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

[17]  H. Van de Vel,et al.  An Application of the Bin-packing Technique to Job Scheduling on Uniform Processors , 1991 .

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

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

[20]  Sartaj Sahni,et al.  Algorithms for Scheduling Independent Tasks , 1976, J. ACM.