Skip to main content
SpringerLink
Log in

Identical Parallel-Machine Scheduling and Worker Assignment Problem Using Genetic Algorithms to Minimize Makespan

  • Chapter
  • First Online:
Electrical Engineering and Applied Computing

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 90))

Abstract

Identical parallel machine scheduling problem for minimizing the makespan is a very important production scheduling problem which has been proven to be NP-hard. The problem further compounds with additional constraints. Genetic algorithms (GA) have shown great advantages in solving the combinatorial optimization problem in view of its characteristic that has high efficiency and that is fit for practical application. In this chapter we present a spreadsheet based GA approach for minimizing the makespan for scheduling of a set of tasks for identical parallel machines and worker assignment to machines. The results obtained from the proposed approach are compared with two sets of benchmark problems consisting of 100 problems each. It has been demonstrated that the performance of proposed approach is superior to the results that have been obtained earlier. The proposed approach produces optimal solution for almost 95% of the problems demonstrating the effectiveness of the proposed approach. An empirical analysis of GA parameters has also been carried out to see the effect on the performance 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
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.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

References

  1. Pinedo ML (2008) Scheduling theory algorithms and systems. Springer Science,  New York

    MATH  Google Scholar 

  2. Brucker P (1995) Scheduling algorithms. Springer,  New York

    Book  MATH  Google Scholar 

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

    MATH  Google Scholar 

  4. McNaugton R (1959) Scheduling with deadlines and loss functions. Manag Sci 6:1–12

    Article  Google Scholar 

  5. Hu TC (1961) Parallel sequencing and assembly line problems. Oper Res 9:841–948

    Article  Google Scholar 

  6. Lam K, Xing W (1997) New trends in parallel machine scheduling. Int J Oper Prod Man 17(3):326–338

    Article  Google Scholar 

  7. Cheng T, Sin C (1990) A state-of-the-art review of parallel machine scheduling research. Eur J Oper Res 47:271–292

    Article  MATH  Google Scholar 

  8. Mokotoff E (2001) Parallel machine scheduling problems: a survey. Asia Pac J Oper Res 18:193–242

    MathSciNet  MATH  Google Scholar 

  9. Min L, Cheng W (1999) A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines. Artif Intell Eng 13(4):399–403

    Article  Google Scholar 

  10. 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 

  11. Lee W-C, Wu C-C, Chen P (2006) A simulated annealing approach to makespan minimization on identical parallel machines. Int J Adv Manuf Tech 31:328–334

    Article  Google Scholar 

  12. Akyol DE (2007) Identical parallel machine scheduling with dynamical networks using time-varying penalty parameters. In: Levner E (ed) Multiprocessor scheduling: theory applications. Itech Education and Publishing, Vienna, pp 293–314

    Google Scholar 

  13. Iori M, Martello S (2008) Scatter search algorithms for identical parallel machine scheduling problems. Stud Comp Intell 128:41–59

    Article  Google Scholar 

  14. Akyol DE, Bayhan GM (2006) Minimizing makespan on identical parallel machines using neural networks. Lect Notes Comput Sci 4234:553–562

    Article  Google Scholar 

  15. Mokotoff E, Jimeno JL, Gutiérrez AI (2001) List scheduling algorithms to minimize the makespan on identical parallel machines. TOP 9(2):243–269

    Article  MathSciNet  MATH  Google Scholar 

  16. Mohri S, Masuda T, Ishii H (1999) Bi-criteria scheduling problem on three identical parallel machines. Int J Prod Econ 60–61:529–536

    Article  Google Scholar 

  17. Gupta JND, Ho JC (2000) Minimizing flowtime subject to optimal makespan on two identical parallel machines. Pesqui Oper 20(1):5–17

    Article  Google Scholar 

  18. Gupta JND, Ho JC (2001) Minimizing makespan subject to minimum flowtime on two identical parallel machines. Comput Oper Res 28(7):705–717

    Article  MathSciNet  MATH  Google Scholar 

  19. Sricharoentham C (2003) Multiple-objective scheduling in parallel machines using memtic algorithm. MS Thesis Texas Tech University, USA

    Google Scholar 

  20. Gupta JND, Ho JC, Ruiz-Torres AJ (2004) Makespan minimization on identical parallel machines subject to minimum total flow-time. J Chin Inst Ind Eng 21(3):220–229

    Google Scholar 

  21. Hong TP, Sun PC, Jou SS (2009) Evolutionary computation for minimizing makespan on identical machines with mold constraints. WSEAS Trans Syst Control 7(4):339–348

    Google Scholar 

  22. Ho JC, López FJ, Ruiz-Torres AJ, Tseng TL (2009) Minimizing total weighted flowtime subject to minimum makespan on two identical parallel machines. J Intell Manuf doi:10.1007/s10845-009-0270-1

  23. Hu PC (2004) Minimizing total tardiness for the worker assignment scheduling problem in identical parallel-machine models. Int J Adv Manuf Tech 23(5–6):383–388

    Article  Google Scholar 

  24. Hu PC (2005) Minimizing total flow time for the worker assignment scheduling problem in the identical parallel-machine models. Int J Adv Manuf Tech 25(9–10):1046–1052

    Article  Google Scholar 

  25. Hu PC (2006) Further study of minimizing total tardiness for the worker assignment scheduling problem in the identical parallel machine models. Int J Adv Manuf Tech 29:165–169

    Article  Google Scholar 

  26. Hu PC (2006) Further study of minimizing total flowtime for the worker assignment scheduling problem in the identical parallel machine models. Int J Adv Manuf Tech 29(7–8):753–757

    Article  Google Scholar 

  27. Chaudhry IA, Drake PR (2008) Minimizing total tardiness for the machine scheduling and worker assignment problems in identical parallel machines using genetic algorithms. Int J Adv Manuf Tech 42:581–594

    Article  Google Scholar 

  28. Chaudhry IA (2010) Minimizing flow time for the worker assignment problem in identical parallel machine models using GA. Int J Adv Manuf Tech 48(5–8):747–760

    Article  MathSciNet  Google Scholar 

  29. Chaudhry IA, Mahmood S, Ahmad R (2010) Minimizing makespan for machine scheduling and worker assignment problem in identical parallel machine models using GA. Lecture notes in engineering and computer science: Proceedings of the world congress on engineering 2010, WCE 2010, 30 June–2 July, London, UK, pp 2464–2469

    Google Scholar 

  30. Hu PC Online research data set available at http://sparc.nfu.edu.tw/~pchu/research_data.htm

  31. Goldberg DE (1989) Genetic algorithms in search optimization and machine learning. Addison-Wesley, Boston

    MATH  Google Scholar 

  32. Palisade Corporation (1998) Evolver: the genetic algorithm super solver. New York, USA

    Google Scholar 

  33. Chaudhry IA, Drake PR (2008) Minimizing flow time variance in a single machine system using genetic algorithms. Int J Adv Manuf Tech 39:355–366

    Article  Google Scholar 

  34. Hayat N, Wirth A (1997) Genetic algorithms and machine scheduling with class setups. Int J Comput Eng Manag 5(2):10–23

    Google Scholar 

  35. Ruiz R, Maroto C (2002) Flexible manufacturing in the ceramic tile industry. In: Proceedings of eighth international workshop on project management and scheduling, April 3–5, Valencia Spain

    Google Scholar 

  36. Davis L (1991) Handbook of genetic algorithms. Van Nostrand Reinhold, New York

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Aeronautical Engineering, National University of Sciences and Technology, Risalpur, Pakistan

    Imran Ali Chaudhry & Sultan Mahmood

Authors
  1. Imran Ali Chaudhry
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sultan Mahmood
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Imran Ali Chaudhry .

Editor information

Editors and Affiliations

  1. The University of Hong Kong, Hung To Road, Hong Kong, 3739, China, People's Republic

    Sio-Iong Ao

  2. School of Engineering, Applied Mathematics and Computing, Cranfield University, Cranfield, MK43 0AL, Montserrat

    Len Gelman

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media B.V.

About this chapter

Cite this chapter

Chaudhry, I.A., Mahmood, S. (2011). Identical Parallel-Machine Scheduling and Worker Assignment Problem Using Genetic Algorithms to Minimize Makespan. In: Ao, SI., Gelman, L. (eds) Electrical Engineering and Applied Computing. Lecture Notes in Electrical Engineering, vol 90. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-1192-1_42

Download citation

  • DOI: https://doi.org/10.1007/978-94-007-1192-1_42

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-007-1191-4

  • Online ISBN: 978-94-007-1192-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation