Advertisement

Comparison of Initial Solutions of Heuristics for No-wait Flow Shop Scheduling

  • Sagar Sapkal
  • Dipak Laha
Part of the Communications in Computer and Information Science book series (CCIS, volume 250)

Abstract

No-wait flow shop scheduling problems have been proved to be NP-hard. Therefore, heuristics are considered as the most suitable ones for obtaining near optimal solutions and are generally developed in two phases namely, initial solution phase and improvement solution phase. We propose a method for obtaining the initial solution with a view to minimize total flow time. The exhaustive computational results reveal that the proposed method performs better than the existing heuristics with respect to both quality of solution and computational time.

Keywords

No-wait flow shop scheduling Heuristics Initial sequence Total flow time 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Röck, H.: The three-machine no-wait flow shop is NP-complete. J. of Associate Computer Machinery 31, 336–345 (1984)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Hall, N.G., Sriskandarajah, C.: A survey of machine scheduling problems with blocking and no-wait in process. Operations Research 44, 510–525 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Rajendran, C., Chaudhuri, D.: Heuristic algorithms for continuous flow-shop problem. Naval Research Logistic Quarterly 37, 695–705 (1990)CrossRefzbMATHGoogle Scholar
  4. 4.
    Bertolissi, E.: Heuristic algorithm for scheduling in the no-wait flow-shop. J. of Materials Processing Technology 107, 459–465 (2000)CrossRefGoogle Scholar
  5. 5.
    Aldowaisan, T., Allahverdi, A.: New heuristics for m-machine no-wait flowshop to minimize total completion time. Omega 32, 345–352 (2004)CrossRefGoogle Scholar
  6. 6.
    Framinan, J.M., Leisten, R., Rajendran, C.: Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem. Int. J. of Prod. Research. 41, 121–148 (2003)CrossRefzbMATHGoogle Scholar
  7. 7.
    Shore, H.M.: The transportation problem and the Vogel Approximation Method. Decis. Sci. 1, 441–457 (1970)CrossRefGoogle Scholar
  8. 8.
    Simons Jr., J.V.: Heuristics in flow shop scheduling with sequence dependent setup times. Int. J. Mgmt. Sci. 20, 215–225 (1992)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Sagar Sapkal
    • 1
  • Dipak Laha
    • 1
  1. 1.Mechanical Engineering DepartmentJadavpur UniversityKolkataIndia

Personalised recommendations