Advertisement

Heuristic Approaches for the Open-Shop Scheduling Problem

  • Wissam Marrouche
  • Haidar M. Harmanani
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 738)

Abstract

The open-shop scheduling problem is concerned with the allocation of tasks to resources, especially when resources are scarce. The problem has many practical applications in the production, manufacturing, testing, and telecommunication domains. In this paper, we study the non-preemptive open-shop scheduling problem with more than two machines using two metaheuristic algorithms: cuckoo search and ant colony optimization. The proposed algorithms are implemented using Python, and tested on the Taillard benchmarks. Favorable results comparisons are reported.

Keywords

Non-preemptive open-shop scheduling Cuckoo search and ant colony system 

References

  1. 1.
    K. Baker, D. Trietsch, Principles to Sequencing and Scheduling (Wiley, London, 2009)Google Scholar
  2. 2.
    C. Blum, Beam-ACO—hybridizing ant colony optimization with beam search: an application to open shop scheduling. Comput. Oper. Res. 32(6), 1565–1591 (2005)Google Scholar
  3. 3.
    P. Brucker, J. Huring, B. Wostmann, A branch and bound algorithm for the open shop problem. Discret. Appl. Math. 76, 43–59 (1997)Google Scholar
  4. 4.
    J. Carlier, E. Pinson, An algorithm for solving the job shop problem. Manag. Sci. 35(2), 164–176 (1989)Google Scholar
  5. 5.
    R. Chen, S. Lo, C. Wu, T. Lin, An effective ant colony optimization-based algorithm for flow shop scheduling, in IEEE Conference on Soft Computing in Industrial Applications (2008), pp. 101–106Google Scholar
  6. 6.
    Y. Chen, A. Zhang, G. Chen, J. Dong, Approximation algorithms for parallel open shop scheduling. Inf. Process. Lett. 113(7), 220–224 (2013)Google Scholar
  7. 7.
    M. Dorigo, Optimization, learning and natural algorithms, Ph.D. thesis, Politecnico di Milano, 1992Google Scholar
  8. 8.
    M. Dorigo, T. Stützle, Ant Colony Optimization (MIT Press, Cambridge, MA, 2004)Google Scholar
  9. 9.
    M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman, San Francisco, CA, 1979)Google Scholar
  10. 10.
    S.B. Ghosn, F. Drouby, H. Harmanani, A parallel genetic algorithm for the open-shop scheduling problem using deterministic and random moves. Int. J. Artif. Intell. 14(1), 130–144 (2016)Google Scholar
  11. 11.
    T. Gonzalez, S. Sahni, Open shop scheduling to minimize finish time. J. Assoc. Comput. Mach. 23(4), 665–679 (1976)Google Scholar
  12. 12.
    C. Gueret, C. Prins, Classical and new heuristics for the open-shop problem: a computational evaluation. Eur. J. Oper. Res. 107, 306–314 (1998)Google Scholar
  13. 13.
    C. Guéret, C. Prins, A new lower bound for the open-shop problem. Ann. Oper. Res. 92, 165–183 (1999)Google Scholar
  14. 14.
    H. Harmanani, S. Bou Ghosn, An efficient method for the open-shop scheduling problem using simulated annealing, in Information Technology: New Generations: 13th International Conference on Information Technology (Springer, Cham, 2016), pp. 1183–1193Google Scholar
  15. 15.
    M. Hassan, I. Kacem, S. Martin, I.M. Osman, Mathematical formulation for open shop scheduling problem, in International Conference on Control, Decision and Information Technologies (CoDIT) (2017), pp. 803–808Google Scholar
  16. 16.
    S. Khuri, S. Miryala, Genetic algorithms for solving open shop scheduling problems, in Proceedings of the Portuguese Conference on Artificial Intelligence (1999), pp. 357–368Google Scholar
  17. 17.
    C.-F. Liaw, An iterative improvement approach for the nonpreemptive open shop scheduling problem. Eur. J. Oper. Res. 111, 509–517 (1998)Google Scholar
  18. 18.
    C.-F. Liaw, A tabu search algorithm or the open shop scheduling problem. Comput. Oper. Res. 26(2), 109–126 (1999)Google Scholar
  19. 19.
    C.-F. Liaw, Applying simulated annealing to the open shop scheduling problem. IIE Trans. Schedul. Logist. 31(5), 457–465 (1999)Google Scholar
  20. 20.
    C.-F. Liaw, A hybrid genetic algorithm for the open shop scheduling problem. Eur. J. Oper. Res. 124, 28–42 (2000)Google Scholar
  21. 21.
    S. Luke, Essentials of Metaheuristics (Lulu, Morrisville, NC, 2013)Google Scholar
  22. 22.
    I. Pavlyukevich, Lévy flights, non-local search and simulated annealing. J. Comput. Phys. 226, 1830–1844 (2007)Google Scholar
  23. 23.
    M. Pineda, Scheduling: Theory, Algorithms, and Systems (Prentice Hall, Englewood Cliffs, NJ, 1995)Google Scholar
  24. 24.
    C. Prins, Competitive genetic algorithms for the open-shop scheduling problem. Math. Meth. Oper. Res. 52(3), 389–411 (2000)MathSciNetCrossRefGoogle Scholar
  25. 25.
    D.Y. Shaa, C.-Y. Hsu, A new particle swarm optimization for the open shop scheduling problem. Comput. Oper. Res. 35, 3243–3261 (2008)CrossRefGoogle Scholar
  26. 26.
    D.P. Van, M. Fiorani, L. Wosinska, J. Chen, Adaptive open-shop scheduling for optical interconnection networks. J. Lightwave Technol. 35(13), 2503–2513 (2017)CrossRefGoogle Scholar
  27. 27.
    S. Walton, O. Hassan, K. Morgan, M.R. Brown, Modified cuckoo search: a new gradient free optimisation algorithm. Chaos, Solitons Fractals 44, 710–718 (2011)CrossRefGoogle Scholar
  28. 28.
    T. Yamada, R. Nakano, A genetic algorithm applicable to large-scale job-shop problems, in Parallel Problem Solving from Nature (1992), pp. 281–290Google Scholar
  29. 29.
    X.-S. Yang, S. Deb, Cuckoo search via Lévy flights, in World Congress on Nature and Biologically Inspired Computing NaBIC (2009), pp. 210–214Google Scholar
  30. 30.
    X.-S. Yang, S. Deb, Engineering optimisation by cuckoo search. Int. J. Math. Model. Numer. Optim. 1(4), 330–343 (2010)zbMATHGoogle Scholar
  31. 31.
    W. Yu, Z. Liu, L. Wanga, T. Fan, Routing open shop and flow shop scheduling problems. Discret. Optim. 213, 24–36 (2011)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Computer Science and MathematicsLebanese American UniversityByblosLebanon

Personalised recommendations