Skip to main content
Log in

Using Data Mining for Due Date Assignment in a Dynamic Job Shop Environment

  • Original Article
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

Due date assignment is an important task in shop floor control, affecting both timely delivery and customer satisfaction. Due date related performances are impacted by the quality of the due date assignment methods. Among the simple and easy to implement due date assignment methods, the total work content (TWK) method achieves the best performance for tardiness related performance criteria and is most widely used in practice and in study. The performance of the TWK method can be improved if the due date allowance factor k could render a more precise and accurate flowtime estimation of each individual job. In this study, in order to improve the performance of the TWK method, we have presented a model that incorporated a data mining tool – Decision Tree – for mining the knowledge of job scheduling about due date assignment in a dynamic job shop environment, which is represented by IF-THEN rules and is able to adjust an appropriate factor k according to the condition of the shop at the instant of job arrival, thereby reducing the due date prediction errors of the TWK method. Simulation results show that our proposed rule-based TWK due date assignment (RTWK) model is significantly better than its static and dynamic counterparts (i.e., TWK and Dynamic TWK methods). In addition, the RTWK model also extracted comprehensive scheduling knowledge about due date assignment, expressed in the form of IF-THEN rules, allowing production managers to easily understand the principles of due date assignment .

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Baker KR (1984) Sequencing rules and due-date assignment in a job shop. Manage Sci 30(9):1093–1104

    Article  Google Scholar 

  2. Baker KR, Bertrand JWM (1981) A comparison of due-date selection rules. AIIE Trans 13(2):123–131

    Article  Google Scholar 

  3. Chang F-CR (1994) A study of factors affecting due-date predictability in a simulated dynamic job shop. J Manuf Syst 13(6):393–400

    Article  Google Scholar 

  4. Cheng TCE (1984) Optimal due-date determination and sequencing of n jobs on a single machine. J Oper Res Soc 35(5):433–437

    Article  Google Scholar 

  5. Cheng TCE (1988) Optimal total-work-content-power due-date determination and sequencing. Comput Math Appl 14(8):579–582

    Article  Google Scholar 

  6. Cheng TCE, Jiang J (1998) Job shop scheduling for missed due-date performance. Comput Ind Eng 34(2):297–307

    Article  Google Scholar 

  7. Kanet JJ (1982) On anomalies in dynamic ratio type scheduling rules: a clarifying analysis. Manage Sci 28(11):1337–1341

    Article  Google Scholar 

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

  9. Fayyad UM (1997) Data mining and knowledge discovery in databases: implications for scientific databases. In: Proceedings of the ninth International Conference on Scientific and Statistical Database Management, pp 2–11

  10. Parpinelli RS, Lopes HS, Freitas AA (2002) Data mining with an ant colony optimization algorithm. IEEE Trans Evol Comput 6(4):321–332

    Article  Google Scholar 

  11. Fayyad UM, Piatetsky-Shapiro G, Smyth P (1996) From data mining to knowledge discovery: an overview. In: Advances in Knowledge Discovery & Data Mining, MIT Press, Cambridge, pp 1–34

  12. Tan KC, Tay A, Lee TH, Heng CM (2002) Mining multiple comprehensible classification rules using genetic programming. In: Proceedings of the 2002 Congress on Evolutionary Computation, Piscataway, NJ, USA, pp 1302–1307

  13. Congdon CB (2000) Classification of epidemiological data: a comparison of genetic algorithm and decision tree approaches. In: Proceedings of the 2000 Congress on Evolutionary Computation, Piscataway, NJ, USA, pp 442–449

  14. Han J, Kamber M (2001) Data mining: Concepts and Techniques. Morgan Kaufmann Publishers, San Francisco

    Google Scholar 

  15. Michael JAB, Gordon L (1997) Data mining techniques: for marketing, sales, and customer support. John Wiley & Sons, New York

    Google Scholar 

  16. Michael TM (1997) Machine Learning, McGraw-Hill, New York

  17. Quinlan JR (1986) Induction of decision trees. Mach Learn 1(1):81–106

    Google Scholar 

  18. Braha D, Shmilovici A (2002) Data mining for improving a cleaning process in the semiconductor industry. IEEE Trans Semiconductor Manuf 15(1):91–101

    Article  Google Scholar 

  19. Lawrence S (1984) Resource constrained project scheduling: an experimental investigation of heuristics scheduling techniques. Graduate School of Industrial Administration, Pittsburgh, Carnegie Mellon University

    Google Scholar 

  20. Vig MM, Dooley KJ (1993) Mixing static and dynamic estimates for due date assignment. J Oper Manage 11(1):67–79

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to D.Y. Sha.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sha, D., Liu, CH. Using Data Mining for Due Date Assignment in a Dynamic Job Shop Environment. Int J Adv Manuf Technol 25, 1164–1174 (2005). https://doi.org/10.1007/s00170-003-1937-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-003-1937-y

Keywords

Navigation