Skip to main content
SpringerLink
Log in

Investigations on Performance Evaluation of Scheduling Heuristics and Metaheuristics in a Parallel Machine Environment

  • Chapter
Metaheuristics for Production Systems

Part of the book series: Operations Research/Computer Science Interfaces Series ((ORCS,volume 60))

  • 1110 Accesses

Abstract

Scheduling problems with consumables resources are common in many operations management and typically in industrial production practice. However, a significant part of scheduling problems studies deal with resources that are always available, but this assumption cannot be satisfied in many practical situations. This paper presents the results of a simulation study of parallel machines environment when each job is characterized by different non-renewable resources requirements. Each resource is delivered at different times following a cumulated arrivals stairs curves. The efficiency measure is the makespan . To describe the problem more clearly, a mathematical programming model is presented. This model represents a realistic and complex situation, in which jobs affectation, sequencing and resource assignment decisions are considered simultaneously. Due to its complexity, we decided to address this problem by means of a metaheuristic based genetic algorithm. Subsequently an improvement phase dealing with a local search method is proposed to improve the efficiency of the algorithm. Moreover, some heuristics are developed to deal with this problem. A simulation study is carried out on a set of test instances. The results are compared on the basis of computational time and solution quality. The simulations show that the hybrid genetic algorithm is able to find an optimal solution for small-sized problems within a reasonable computation time; also it outperforms genetic algorithm and heuristics methods for large-sized problems. These results validate the efficiency of the proposed algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Allahverdi A, Ng CT, Cheng TE, Kovalyov MY (2008) A survey of scheduling problems with setup times or costs. Eur J Oper Res 187(3):985–1032

    Article  Google Scholar 

  2. Belkaid F, Sari Z, Souier M (2013) A genetic algorithm for the parallel machine scheduling problem with consumable resources. Int J Appl Metaheuristic Comput 4(2):17–30

    Article  Google Scholar 

  3. Belkaid F, Yalaoui F, Sari Z (2013) A hybrid genetic algorithm for parallel machine scheduling problem with consumable resources. In: IEEE international conference on control decision and information technologies CoDIT’13, Hammamet doi: 10.1109/CoDIT.2013.6689534

  4. Blazewicz J, Lenstra JK, Rinnooy Kan AHG (1983) Scheduling subject to resource constraints: classification and complexity. Discret Appl Math 5(1):11–24

    Article  Google Scholar 

  5. Blazewicz J, Kubiak W, Martello S (1993) Algorithms for minimizing maximum lateness with unit length tasks and resource constraints. Discret Appl Math 42:123–138

    Article  Google Scholar 

  6. Carlier J, Rinnooy Kan AHG (1982) Scheduling subject to nonrenewable resource constraints. Oper Res Lett 1:52–55

    Article  Google Scholar 

  7. Carrera S (2010) Planification et Ordonnancement de Plateformes Logistiques. Thèse de doctorat, Institut National Polytechnique de Lorraine

    Google Scholar 

  8. Chang PC, Chen SH, Lin KL (2005) Two-phase sub population genetic algorithm for parallel machine-scheduling problem. Expert Syst Appl 29:705–712

    Article  Google Scholar 

  9. Cochand M, Werra D, Slowinski R (1989) Preemptive scheduling with staircase and piecewise linear resource availability. Methods Models Oper Res 33:297–313

    Article  Google Scholar 

  10. Daniels RL, Hoopes BJ, Mazzola JB (1996) Scheduling parallel manufacturing cells with resource flexibility. Manag Sci 42(9):1260–1276

    Article  Google Scholar 

  11. Daniels RL, Hoopes BJ, Mazzola JB (1997) An analysis of heuristics for the parallel-machine flexible-resource scheduling problem. Ann Oper Res 70:439–472

    Article  Google Scholar 

  12. Daniels RL, Hua SY, Webster S (1999) Heuristics for parallel-machine flexible resource scheduling problems with unspecified job assignment. Comput Oper Res 26:143–155

    Article  Google Scholar 

  13. Dorigo M (1992) Optimization, learning and natural algorithms. PhD thesis, Politecnico di Milano

    Google Scholar 

  14. Eberhart RC, Kennedy J (1995) New optimizer using particle swarm theory. In: Proceedings of the sixth IEEE international symposium on micro machine and human science, Nagoya, pp 39–43

    Google Scholar 

  15. Edis EB, Ozkarahan I (2011) A combined integer/constraint programming approach to a resource-constrained parallel machine scheduling problem with machine eligibility restrictions. Eng Optim 43(2):135–157

    Article  Google Scholar 

  16. Edis EB, Ozkarahan I (2012) Solution approaches for a real-life resource constrained parallel machine scheduling problem. Int J Adv Manuf Technol 58:1141–1153

    Article  Google Scholar 

  17. Garey MR, Johnson MR (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco

    Google Scholar 

  18. Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13(5):533–549

    Article  Google Scholar 

  19. Goldberg D (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley Professional, Reading, MA

    Google Scholar 

  20. Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor

    Google Scholar 

  21. Hoos HH, Stüzle T (2004) Stochastic local search: foundations and applications. Elsevier, pp 43–85

    Google Scholar 

  22. Hernandez JCH (2008) Algorithmes Métaheuristiques hybrides pour la sélection de gênes et la classification de données de biopuces, Thèse de doctorat, Université d’Angers

    Google Scholar 

  23. Jou C (2005) A genetic algorithm with sub-indexed partitioning genes and its application to production scheduling of parallel machines. Comput Ind Eng 48:39–54

    Article  Google Scholar 

  24. Li K, Shi Y, Yang SL, Cheng BY (2011) Parallel machine scheduling problem to minimize the makespan with resource dependent processing times. Appl Soft Comput 11(8):5551–5557

    Article  Google Scholar 

  25. Kellerer H, Strusevisch VA (2008) Scheduling parallel dedicated machines with the speeding-up resource. Nav Res Logist 55(5):377–389

    Article  Google Scholar 

  26. Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680

    Article  Google Scholar 

  27. Lee K, Lei L, Pinedo M, Wang S (2013) Operations scheduling with multiple resources and transportation considerations. Int J Prod Res 51(23–24):7071–7090

    Article  Google Scholar 

  28. Li Y, Wang F, Lim A (2003) Resource constraints machine scheduling: a genetic algorithm approach. Congr Evol Comput 14:1080–1085

    Google Scholar 

  29. Li X, Yalaoui F, Amodeo L, Chehade H (2012) Metaheuristics and exact methods to solve a multi objective parallel machines scheduling problem. J Intell Manuf 23(4):1179–1194

    Article  Google Scholar 

  30. Sue LH, Lien CY (2009) Scheduling parallel machines with resource dependent processing times. Int J Prod Econ 117:256–266

    Article  Google Scholar 

  31. Olafsson S, Shi L (2000) A method for scheduling in parallel manufacturing systems with flexible resources. IIE Trans 32:135–146

    Google Scholar 

  32. Ruiz-Torres AJ, Centeno G (2007) Scheduling with flexible resources in parallel workcenters to minimize maximum completion time. Comput Oper Res 34:48–69

    Article  Google Scholar 

  33. Shabtay D, Kaspi M (2006) Parallel machine scheduling with a convex resource consumption function. Eur J Oper Res 173(1):92–107

    Article  Google Scholar 

  34. Slowinski R (1984) Preemptive scheduling of independent jobs on parallel machines subject to financial constraints. Eur J Oper Res 15:366–373

    Article  Google Scholar 

  35. Sioud A, Gravel M, Gagné C, (2012) A hybrid genetic algorithm for the single machine scheduling problem with sequence dependent setup times. Comput Oper Res 39(10):2415–2424

    Article  Google Scholar 

  36. Sue LH, Lien CY (2009) Scheduling parallel machines with resource-dependent processing times. Int J Prod Econ 117:256–266

    Article  Google Scholar 

  37. Valls V, Ballestin F, Quintanilla S (2008) A hybrid genetic algorithm for the resource-constrained project scheduling problem. Eur J Oper Res 185(2):495–508

    Article  Google Scholar 

  38. Yalaoui F, Chu C (2003) An efficient heuristic approach for parallel machine scheduling with job splitting and sequence-dependent setup times. IIE Trans 35(2):183–190

    Article  Google Scholar 

Download references

Acknowledgements

The author would like to thank the Erasmus Mundus EU-METALIC project team Coordinated by Cardiff Metropolitan University. This project has been funded with support of the European Commission. This chapter reflects the view only of the author, and the Commission cannot be held responsible for any use which may be made of the information contained therein.

Author information

Authors and Affiliations

  1. Manufacturing Engineering Laboratory of Tlemcen, University of Tlemcen, BP. 119, Tlemcen, 13000, Algeria

    Fayçal Belkaid & Zaki Sari

  2. ICD -LOSI (UMR CNRS 6281), University of Technology of Troyes, 10 010, Troyes Cedex, France

    Farouk Yalaoui

Authors
  1. Fayçal Belkaid
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Farouk Yalaoui
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zaki Sari
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fayçal Belkaid .

Editor information

Editors and Affiliations

  1. CRISTAL Laboratory, Lille 1 University, Villeneuve d'Ascq, France

    El-Ghazali Talbi

  2. LOSI Laboratory, University of Technology of Troyes, Troyes, France

    Farouk Yalaoui

  3. LOSI Laboratory, University of Technology of Troyes, Troyes, France

    Lionel Amodeo

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Belkaid, F., Yalaoui, F., Sari, Z. (2016). Investigations on Performance Evaluation of Scheduling Heuristics and Metaheuristics in a Parallel Machine Environment. In: Talbi, EG., Yalaoui, F., Amodeo, L. (eds) Metaheuristics for Production Systems. Operations Research/Computer Science Interfaces Series, vol 60. Springer, Cham. https://doi.org/10.1007/978-3-319-23350-5_9

Download citation

Publish with us

Policies and ethics

Search

Navigation