Advertisement

A Hybrid Algorithm for the Permutation Flow Shop Scheduling Problem

  • Arindam Chakravorty
  • Dipak Laha
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8251)

Abstract

This paper considers the application of IA for the classic permutation flow shop scheduling problem. We present a hybrid version of constructively built IA combining with the SA for the n-job, m-machine permutation flow shop scheduling problem to minimize makespan. Based on all the Taillard’s benchmark problems, the computational results suggest that the proposed method is very competitive with the existing methods in the literature.

Keywords

Scheduling Immune algorithm Simulated annealing Permutation flow shop Makespan Shift neighborhood search 

References

  1. [1]
    Dasgupta, D.: Artificial immune systems and their applications. Springer (1999)Google Scholar
  2. [2]
    Hart, E., Timmis, J.: Applications areas of AIS: The past, the present and the future. Applied Soft Computing 8, 191–201 (2008)CrossRefGoogle Scholar
  3. [3]
    Gonzalez, T., Sahani, S.: Flow shop and job shop scheduling: complexity and approximation. Operations Research 26, 36–52 (1978)MathSciNetCrossRefzbMATHGoogle Scholar
  4. [4]
    Zandieh, M., Fatemi Fhomi, S.M.T., Moattar Husseini, S.M.: An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Applied Mathematics and Computation 180, 111–127 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  5. [5]
    Kai, S., Gen-ke, Y.: Hybrid artificial immune system and extremal optimization algorithm for permutation flowshop scheduling problem. Journal of Shanghai Univ (Engl Ed) 12(4), 352–357 (2008)CrossRefGoogle Scholar
  6. [6]
    Kurz, M.E., Askin, R.G.: Scheduling flexible flow lines with sequence-dependent setup times. European Journal of Operational Research 159, 66–82 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  7. [7]
    Bagheri, A., Zandieh, M., Mahdavi, I., Yazdani, M.: An artificial immune algorithm for the flexible job-shop scheduling problem. Future Generation Computer Systems 26, 533–541 (2010)CrossRefGoogle Scholar
  8. [8]
    Engin, O., Doyen, A.: A new approach to solve hybrid flow shop scheduling problems by artificial immune system. Future Generation Computer Systems 20, 1083–1095 (2004)CrossRefGoogle Scholar
  9. [9]
    Rajendran, C., Ziegler, H.: Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. European Journal of Operational Research 155, 426–438 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  10. [10]
    Stuetzle, T.: An ant approach for the flow shop problem. Proceedings of the 6th European Congress on Intelligent Techniques and Soft Computing (EUFIT) 3, 1560–1564 (1998)Google Scholar
  11. [11]
    Ying, K.C., Liao, C.J.: An ant colony system for permutation flow-shop sequencing. Computers & Operations Research 31, 791–801 (2004)CrossRefzbMATHGoogle Scholar
  12. [12]
    Ahmadizar, F., Barzinpour, F.: A hybrid algorithm to minimize makespan for the permutation flow shop scheduling problem. International Journal of Computational Intelligence Systems 3, 853–861 (2010)Google Scholar
  13. [13]
    Ahmadizar, F.: A new ant colony algorithm for makespan minimization in permutation flow shops. Computers & Industrial Engineering 63, 355–361 (2012)CrossRefGoogle Scholar
  14. [14]
    Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research 64, 278–285 (1993)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Arindam Chakravorty
    • 1
  • Dipak Laha
    • 2
  1. 1.Department of Information TechnologySt. Thomas’ College of Engineering and TechnologyKolkataIndia
  2. 2.Department of Mechanical EngineeringJadavpur UniversityKolkataIndia

Personalised recommendations