Skip to main content

Advertisement

SpringerLink
Log in

Assessing the impact of changing available multiple process plans of a job type on mean tardiness in job shop scheduling

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

This paper assesses the impact of changing the available multiple process plans of a job type in a production order on mean tardiness using simulation based genetic algorithm approach. A restart scheme as suggested in the literature is embedded into genetic algorithm in order to prevent premature convergence. An algorithm is developed to select a job type that becomes a candidate in order to change the available multiple process plans. Three case studies of varying sizes have been considered to assess the performance of job shop with an objective to minimise mean tardiness. Results indicate that by changing the available multiple process plans of a job type in a production order assists in reducing mean tardiness of a production order. In addition, selecting the best process plan among available multiple process plans on the basis of minimum total production time criterion for a job type does not yield optimal schedule.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ponnambalam SG, Ramkumar V, Jawahar N (2001) A multiobjective genetic algorithm for job shop scheduling. Prod Plan Control 12(8):764–774

    Article  Google Scholar 

  2. Pinedo ML (2008) Scheduling: theory, algorithms and systems. Prentice-Hall, NJ

    Google Scholar 

  3. Kutanoglu E, Sabuncuoglu I (1999) An analysis of heuristics in a dynamic job shop with weighted tardiness objectives. Int J Prod Res 37(1):165–187

    Article  MATH  Google Scholar 

  4. Vinod V, Sridharan R (2008) Scheduling a dynamic job shop production system with sequence-dependent setups: an experimental study. Robot Comput-Integr Manuf 24:435–449. doi:10.1016/j.rcim.2007.05.001

    Article  Google Scholar 

  5. Mitchell M (2002) An introduction to genetic algorithms. Prentice-Hall of India, New Delhi

    Google Scholar 

  6. Zhang H, Gen M (2005) Multistage-based genetic algorithm for flexible job-shop scheduling problem. J Complexity Int 48:409–425

    Google Scholar 

  7. Benjaafar S, Ramakrishnan R (1996) Modeling, measurement and evaluation of sequencing flexibility in manufacturing systems. Int J Prod Res 5(5):1195–1220

    Article  Google Scholar 

  8. Conway RW, Maxwell WL, Miller LW (1967) Theory of scheduling. Addison-Wesley, Reading

    MATH  Google Scholar 

  9. Gupta JND (2002) An excursion in scheduling theory: an overview of scheduling research in the twentieth century. Prod Plan Control 2:105–116

    Article  Google Scholar 

  10. Oyetunji EO (2009) Some common performance measures in scheduling problems: review article. Res J Appl Sci Eng Technol 1(2):6–9

    Google Scholar 

  11. Kim Y, Park K, Ko J (2003) A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling. Comput Oper Res 30:1151–1171

    Article  MATH  MathSciNet  Google Scholar 

  12. Jiang J, Chen M (1993) The influence of alternate process planning in job shop scheduling. Comput Ind Eng 25(1–4):263–266

    Article  MathSciNet  Google Scholar 

  13. Shewchuk JP, Moodie CL (1998) Definition and classification of manufacturing flexibility types and measures. Int J Flex Manuf Sys 10:325–349

    Article  Google Scholar 

  14. Shewchuk JP, Moodie CL (2000) Flexibility and manufacturing system design: an experimental investigation. Int J Prod Res 38(8):1801–1822

    Article  MATH  Google Scholar 

  15. Rajendran C, Holthaus O (1999) A comparative study of dispatching rules in dynamic flowshops and jobshops. Eur J Oper Res 116:156–170. doi:10.1016/S0377-2217(98)00023-X

    Article  MATH  Google Scholar 

  16. Sabuncuoglu I, Bayiz M (2000) Analysis of reactive scheduling problems in a job shop environment. Eur J Oper Res 126:567–586. doi:10.1016/S0377-2217(99)00311-2

    Article  MATH  Google Scholar 

  17. Piramuthu S, Shaw M, Fulkerson B (2000) Information-based dynamic manufacturing system scheduling. Int J Flex Manuf Syst 12:219–234. doi:10.1023/A:1008151831821

    Article  Google Scholar 

  18. Xie H (2001) A genetic algorithm approach to job shop scheduling problems with a batch allocation issue. 17th Inter. Workshop on Artificial Intelligence, Seattle, Washington, 126–131

  19. Othman Z, Subari K, Morad N (2004) Job shop scheduling with alternative machines using genetic algorithms. J Tech 41(D):67–78

    Google Scholar 

  20. Thiagarajan S, Rajendran C (2005) Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs. Comput Ind Eng 49:463–503. doi:10.1016/j.cie.2005.06.005

    Article  Google Scholar 

  21. Zhou H, Cheung W, Lawrence CL (2009) Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm. Eur J Oper Res 194(3):637–649

    Article  MATH  Google Scholar 

  22. Zhou R, Nee AYC, Lee HP (2009) Performance of an ant colony optimization algorithm in dynamic job shop scheduling problems. Int J Prod Res 47:2903–2920. doi:10.1080/ 00207540701644219

    Article  MATH  Google Scholar 

  23. Özgüven C, Özbakır L, Yavuz Y (2010) Mathematical models for job-shop scheduling problems with routing and process plan flexibility. Appl Math Model 34(6):1539–1548

    Article  MATH  MathSciNet  Google Scholar 

  24. Asadzadeh L, Zamanifar K (2010) An agent-based parallel approach for job shop scheduling problem with genetic algorithms. Math Comp Model 52(11–12):1957–1965

    Article  MATH  Google Scholar 

  25. Hasan SMK, Sarker R, Essam D, Kacem I (2011) A DSS for job scheduling under process interruptions. Flex Serv Manuf J 23:137–155. doi:10.1007/s10696-011-9094-3

    Article  Google Scholar 

  26. Razavi M, Ranjbar MN (2012) A hybrid metaheuristic for concurrent layout and scheduling problem in a job shop environment. Int J Adv Manuf Technol 62:1249–1260. doi:10.1007/s00170-011-3859-4

    Article  Google Scholar 

  27. Chen B, Matis TI (2012) A flexible dispatching rule for minimizing tardiness in job shop scheduling. Int J Prod Econ. doi:10.1016/j.ijpe.2012.08.019

    Google Scholar 

  28. Wu R, Zhang C (2012) Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm. Inf Sci 188:236–252. doi:10.1016/j.ins.2011.11.013

    Article  MATH  Google Scholar 

  29. Michalewicz Z (1996) Genetic algorithms + data structures = evolution programs. Springer, New York

    Book  MATH  Google Scholar 

  30. Baker JE (1985) Adaptive selection methods for genetic algorithms. In: Proc. on the First Inter. Conf. on Genetic Algo. and their app, Lawrence Earlbaum, New Jersey, pp 101–111

  31. Goldberg DE, Deb K (1991) A comparative analysis of selection schemes used in genetic algorithms. Foundations of genetic algorithms. Morgan Kaufmann Publishers, San Mateo, pp 69–93

    Google Scholar 

  32. Gen M, Cheng R (1999) Genetic algorithms and engineering optimization, 1st edn. Wiley-Interscience, Wiley series in engineering design and automation, NY

    Book  Google Scholar 

  33. Chakraborty RC (2010) Genetic algorithm and modeling. Soft Computing Course Lecture, pp 37–40

  34. Man KF, Tang KS, Kwong S (1996) Genetic algorithms: concepts and applications. IEEE Trans Ind Electron 43(5):519–534

    Article  Google Scholar 

  35. Morad N, Zalzala A (1999) Genetic algorithms in integrated process planning and scheduling. J Intell Manuf 10:169–179

    Article  Google Scholar 

  36. Deb K (2006) Optimization for engineering design. Algorithm and examples. Prentice - Hall, New Delhi

    Google Scholar 

  37. Ruiz R, Maroto C (2006) A genetic algorithm for hybrid flow shops with sequence dependent setup times and machine eligibility. Eur J Oper Res 169(3):781–800

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mechanical Engineering, M. M. University, Mullana (Ambala), India

    Rakesh Kumar Phanden

  2. Department of Mechanical Engineering, National Institute of Technology, Kurukshetra, India

    Ajai Jain

Authors
  1. Rakesh Kumar Phanden
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ajai Jain
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Rakesh Kumar Phanden or Ajai Jain.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Phanden, R.K., Jain, A. Assessing the impact of changing available multiple process plans of a job type on mean tardiness in job shop scheduling. Int J Adv Manuf Technol 80, 1521–1545 (2015). https://doi.org/10.1007/s00170-015-7123-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-015-7123-1

Keywords

Search

Navigation