Skip to main content

Evolving Reusable Operation-Based Due-Date Assignment Models for Job Shop Scheduling with Genetic Programming

  • Conference paper
Book cover Genetic Programming (EuroGP 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7244))

Included in the following conference series:

Abstract

Due-date assignment plays an important role in scheduling systems and strongly influences the delivery performance of job shops. Because of the stochastic and dynamic features of job shops, the development of general due-date assignment models (DDAMs) is complicated. In this study, two genetic programming (GP) methods are proposed to evolve DDAMs for job shop environments. The experimental results show that the evolved DDAMs can make more accurate estimates than other existing dynamic DDAMs with promising reusability. In addition, the evolved operation-based DDAMs show better performance than the evolved DDAMs employing aggregate information of jobs and machines.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahmed, I., Fisher, W.W.: Due date assignment, job order release, and sequencing interaction in job shop scheduling. Decision Sciences 23(3), 633–647 (1992)

    Article  Google Scholar 

  2. Baykasoglu, A., Gocken, M., Unutmaz, Z.D.: New approaches to due date assignment in job shops. European Journal of Operational Research 187, 31–45 (2008)

    Article  MATH  Google Scholar 

  3. Chang, F.-C.R.: A study of due-date assignment rules with constrained tightness in a dynamic job shop. Computers & Industrial Engineering 31, 205–208 (1996)

    Article  Google Scholar 

  4. Cheng, T.C.E., Gupta, M.C.: Survey of scheduling research involving due date determination decisions. European Journal of Operational Research 38(2), 156–166 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  5. Cheng, T.C.E., Jiang, J.: Job shop scheduling for missed due-date performance. Computers & Industrial Engineering 34, 297–307 (1998)

    Article  Google Scholar 

  6. Cheng, T.C.E., Podolsky, S.: Just-in-Time Manufacturing: an Introduction. Chapman and Hall, London (1993)

    Google Scholar 

  7. Fry, T.D., Philipoom, P.R., Markland, R.E.: Due date assignment in a multistage job shop. IIE Transactions 21(2), 153–161 (1989)

    Article  Google Scholar 

  8. Hildebrandt, T., Heger, J., Scholz-Reiter, B.: Towards improved dispatching rules for complex shop floor scenarios: a genetic programming approach. In: GECCO 2010: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, pp. 257–264. ACM, New York (2010)

    Chapter  Google Scholar 

  9. Joseph, O.A., Sridharan, R.: Analysis of dynamic due-date assignment models in a flexible manufacturing system. Journal of Manufacturing Systems 30(1), 28–40 (2011)

    Article  Google Scholar 

  10. Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press (1992)

    Google Scholar 

  11. Land, M.J.: Workload Control in Job Shops, Grasping the Tap. Ph.D. thesis, University of Groningen, The Netherlands (2004)

    Google Scholar 

  12. Luke, S.: Essentials of Metaheuristics. Lulu (2009)

    Google Scholar 

  13. Ozturk, A., Kayaligil, S., Ozdemirel, N.E.: Manufacturing lead time estimation using data mining. European Journal of Operational Research 173(2), 683–700 (2006)

    Article  MathSciNet  Google Scholar 

  14. Patil, R.J.: Using ensemble and metaheuristics learning principles with artificial neural networks to improve due date prediction performance. International Journal of Production Research 46(21), 6009–6027 (2008)

    Article  MATH  Google Scholar 

  15. Philipoom, P.R., Rees, L.P., Wiegmann, L.: Using neural networks to determine internally-set due-date assignments for shop scheduling. Decision Sciences 25(5-6), 825–851 (1994)

    Article  Google Scholar 

  16. Ragatz, G.L., Mabert, V.A.: A simulation analysis of due date assignment rules. Journal of Operations Management 5(1), 27–39 (1984)

    Article  Google Scholar 

  17. Ramasesh, R.: Dynamic job shop scheduling: A survey of simulation research. Omega 18(1), 43–57 (1990)

    Article  Google Scholar 

  18. Sabuncuoglu, I., Comlekci, A.: Operation-based flowtime estimation in a dynamic job shop. Omega 30(6), 423–442 (2002)

    Article  Google Scholar 

  19. Sha, D.Y., Storch, R.L., Liu, C.H.: Development of a regression-based method with case-based tuning to solve the due date assignment problem. International Journal of Production Research 45(1), 65–82 (2007)

    Article  MATH  Google Scholar 

  20. Sha, D.Y., Hsu, S.Y.: Due-date assignment in wafer fabrication using artificial neural networks. The International Journal of Advanced Manufacturing Technology 23, 768–775 (2004)

    Article  Google Scholar 

  21. Sha, D.Y., Liu, C.-H.: Using data mining for due date assignment in a dynamic job shop environment. The International Journal of Advanced Manufacturing Technology 25, 1164–1174 (2005)

    Article  Google Scholar 

  22. Veral, E.A.: Computer simulation of due-date setting in multi-machine job shops. Computers & Industrial Engineering 41, 77–94 (2001)

    Article  Google Scholar 

  23. Vig, M.M., Dooley, K.J.: Mixing static and dynamic flowtime estimates for due-date assignment. Journal of Operations Management 11(1), 67–79 (1993)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nguyen, S., Zhang, M., Johnston, M., Tan, K.C. (2012). Evolving Reusable Operation-Based Due-Date Assignment Models for Job Shop Scheduling with Genetic Programming. In: Moraglio, A., Silva, S., Krawiec, K., Machado, P., Cotta, C. (eds) Genetic Programming. EuroGP 2012. Lecture Notes in Computer Science, vol 7244. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29139-5_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29139-5_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29138-8

  • Online ISBN: 978-3-642-29139-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics