AN EFFECTIVE APPROACH FOR REAL-WORLD PRODUCTION PLANNING

Jesuk Ko

2004

Abstract

This paper shows an application of constraint logic-based approach to the realistic scheduling problem. Operations scheduling, often influenced by diverse and conflicting constraints, is strongly NP-hard problem of combinatorial optimisation. The problem is complicated further by real scheduling environments, where a variety of constraints in response are critical aspects for the application of a solution. Constraint logic programming technique well armed with the major function of constraint handling and solving mechanisms can be effectively applied to solve real-world scheduling problems. In this study, the scheduling problem addressed, based on a dye house involving jobs associated with the colouring of different fibres, is characterized by various constraints like colour precedence, dye machine allocation and time constraints. The solution procedure used takes into account a number of dye house performance measures which include on-time delivery and resource utilisation. The results indicate that constraint-based scheduling is computationally efficient in schedule generation in that a solution can be found within a few seconds. Furthermore, solutions produced always minimise the mean tardiness and maximise the utilisation of dyeing facilities.

References

  1. Baker, K.R., 1974. Introduction to sequencing and scheduling, John Wiley & Sons. New York.
  2. Barker, J.R. and McMahon, G.B., 1985. Scheduling the general job shop. Management Science. 31(5), 594-598.
  3. Bensana, E., Bel, G. and Dubois, D., 1988. OPAL: a multiknowledge-based system for industrial job shop scheduling. Production Research. 26(5), 795-819.
  4. Cheng, C. and Smith, S.F., 1995. Applying constraint satisfaction techniques to job shop scheduling. Technical Report CMU-RI-TR-95-03. Carnegie Mellon University.
  5. Diaz, D., 1994. clp(FD) 2.21 user's manual. INRIA. France.
  6. Diaz, D. and Codognet, P., 1993. A minimal extension of the WAM for clp(FD). Proceedings of the International Conference on Logic Programming. MIT Press.
  7. Dincbas, M., Simonis, H. and Hentenryck, P. V., 1990. Solving large combinatorial problem in logic programming. Journal of Logic Programming. 8(1-2), 75-93.
  8. Fox, M.S. and Smith, S.F., 1984. ISIS - a knowledge-based system for factory scheduling. Expert Systems. 1(1), 25-49.
  9. Freuder, E. and Wallace, R., 1992. Partial constraint satisfaction. Artificial Intelligence. 58, 21-70.
  10. Garey, M.R. and Johnson, D.S., 1979. Computers and intractability: a guide to the theory of NPcompleteness. W.H. Freeman. San Francisco.
  11. Haralick, R. and Elliott, G., 1980. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence. 14, 263-313.
  12. Jaffar, J. et al., 1992. The CLP(R) language and system. ACM Transactions on Programming Languages and System. 14(3), 339-395.
  13. Kanet, J.J. and Adelsberger, H.H., 1987. Expert systems in production scheduling. European Journal of Operational Research. 29, 51-59.
  14. Kumar, V., 1992. Algorithms for constraint satisfaction problems: A survey. AI Magazine. 13(1), 32-44.
  15. Lassez, C., 1987. Constraint logic programming. Byte Magazine. August, 171-176.
  16. Nadel, B., 1989. Constraint satisfaction algorithms. Computational Intelligence. 5, 188-224.
  17. Pinedo, M., 1995. Scheduling: theory, algorithms, and systems. Prentice-Hall. New Jersey.
  18. Shaw, M.J. and Whinston, A.B., 1989. An artificial intelligence approach to the scheduling of flexible manufacturing systems. IIE Transactions. 21(2), 170- 181.
  19. Smith, S.F., Fox, M.S. and Ow, P.S., 1986. Constructing and maintaining detailed production plans: investigation into the development of knowledge-based factory scheduling systems. AI Magazine. 7(4), 45-61.
  20. Steffen, M.S., 1986. A survey of artificial intelligencebased scheduling systems. Proceedings of the 1986 Fall Industrial Engineering Conference. 395-405.
  21. Storer, R.H., Wu, S.D. and Vaccari, R., 1992. New search spaces for sequencing problem with application to job shop scheduling. Management Science. 38(10), 1495- 1509.
  22. Van Hentenryck, P., 1989. Constraint satisfaction in logic programming. MIT Press. London.
  23. Voda, P., 1988. The constraint language trilogy: semantics and computations. Technical Report, Complete Logic Systems. North Vancouver, Canada.
  24. Zweben, M. et al., 1992. Learning to improve constraintbased scheduling. Artificial Intelligence. 58, 271-296.
Download


Paper Citation


in Harvard Style

Ko J. (2004). AN EFFECTIVE APPROACH FOR REAL-WORLD PRODUCTION PLANNING . In Proceedings of the First International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 972-8865-12-0, pages 114-120. DOI: 10.5220/0001127101140120


in Bibtex Style

@conference{icinco04,
author={Jesuk Ko},
title={AN EFFECTIVE APPROACH FOR REAL-WORLD PRODUCTION PLANNING},
booktitle={Proceedings of the First International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2004},
pages={114-120},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001127101140120},
isbn={972-8865-12-0},
}


in EndNote Style

TY - CONF
JO - Proceedings of the First International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - AN EFFECTIVE APPROACH FOR REAL-WORLD PRODUCTION PLANNING
SN - 972-8865-12-0
AU - Ko J.
PY - 2004
SP - 114
EP - 120
DO - 10.5220/0001127101140120