Holonic System Design for Dynamic Due Date Assignment Problem

Öz

Rapid advances in technology, changes in customer demand and relatively short product life cycles force production systems to give a more accurate due dates. For this purpose, many studies were carried out in academia and industry to improve the performance and the quality of production systems to respond to changing customer requirements. In this study, an agent-based holonic control structure design that assigns the due dates for incoming orders in a flexible production system is proposed. The proposed system is working under a dynamic environment and assigned due dates are obtained as a result of negotiations between the agents.

Anahtar Kelimeler

• Due-Date assignment problem,Holonic manufacturing system,Multi-agent system

Dinamik Teslim Zamanı Atama Problemi için Holonik Sistem Tasarımı

Öz

Teknolojide yaşanan hızlı ilerlemeler, müşteri isteklerindeki değişiklikler ve nispeten daha kısa ürün yaşam döngüsü üretim sistemlerini daha doğru teslim zamanları vermeye zorlamaktadır. Bu amaçla, üretim sistemlerinin performansını ve değişen müşteri isteklerine yanıt verme kalitesini geliştirmek için akademide ve endüstride birçok çalışma gerçekleştirilmiştir. Bu çalışmada, esnek bir üretim sistemi içerisinde gelen siparişlere teslim zamanı atayan etmen tabanlı holonik bir kontrol yapısı tasarımı önerilmiştir. Önerilen sistem dinamik bir ortamda çalışmaktadır ve atanan teslim zamanları etmenler arasındaki müzakereler sonucunda elde edilmektedir.

Anahtar Kelimeler

• Teslim zamanı atama problemi,Holonik üretim sistemi,Çoklu-etmen sistemi

Kaynakça

1. 1. Wang, J., Deng, Y., 1999. Incremental Modeling and Verification of Flexible Manufacturing Systems. Journal of Intelligent Manufacturing,. 10(6): p. 485-502.
2. 2. Veeravalli, B., Rajesh, G., Viswanadham, N., 2002. Design and Analysis of Optimal Material Distribution Policies in Flexible Manufacturing Systems Using a Single AGV. International Journal of Production Research, 40(12): p. 2937-2954.
3. 3. Jerald, J., 2006. Simultaneous Scheduling of Parts and Automated Guided Vehicles in an FMS Environment Using Adaptive Genetic Algorithm. The International Journal of Advanced Manufacturing Technology, 29(5-6): p. 584-589.
4. 4. Philipoom, P.R., L. Wiegmann, Rees, L.P., 1997. Cost‐based Due‐Date Assignment with The Use of Classical and Neural‐Network Approaches. Naval Research Logistics (NRL), 44(1): p. 21-46.
5. 5. Alpay, Ş. N., 2009. Yüzügüllü, Dynamic Job Shop Scheduling for Missed Due Date Performance. International Journal of Production Research, 47(15): p. 4047-4062.
6. 6. Baykasoğlu, A., Göçken, M., Unutmaz, Z.D., 2008. New Approaches to Due Date Assignment in Job Shops. European Journal of Operational Research, 187(1): p. 31-45.
7. 7. Leitao, P., Restivo, F.J., 2008. Implementation of a Holonic Control System in a Flexible Manufacturing System. Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions on, 38(5): p. 699-709.
8. 8. Madureira, A., Santos, F., Pereira, I., 2008. Self-Managing Agents for Dynamic Scheduling in Manufacturing in Proceedings of the 10th Annual Conference Companion on Genetic and Evolutionary Computation. ACM.

9. 9. Liu, J., Liu, J. J., Chen, Q. X., Mao, N., Lin, Z. A. 2011. A Multi-Agent-Based Mould Due Date Setting Approach in Stochastic Production. International Journal of Production Research, 49(5): p. 1353-1371.
10. 10. Weeks, J.K., Fryer, J.S., 1977. A Methodology for Assigning Minimum Cost Due-Dates. Management Science, 23(8): p. 872-881.
11. 11. Weeks, J.K., 1979. A Simulation Study of Predictable Due-dates. Management Science, 25(4): p. 363-373.
12. 12. Baker, K.R., Bertrand, J., 1981. An Investigation of Due-Date Assignment Rules with Constrained Tightness. Journal of Operations Management,. 1(3): p. 109-120.
13. 13. Smith, M.L., Seidmann, A., 1983. Due Date Selection Procedures for Job-Shop Simulation. Computers & Industrial Engineering, 7(3): p. 199-207.
14. 14. Baker, K.R., 1984. Sequencing Rules and Due-Date Assignments in a Job Shop. Management Science, 30(9): p. 1093-1104.
15. 15. Ragatz,G.L, Mabert, V.A., 1984. A Framework for the Study of Due Date Management in Job Shops. The International Journal of Production Research, 22(4): p. 685-695.
16. 16. Shanthikumar, J.G., Sumita, U., 1988. Approximations for the Time Spent in a Dynamic Job Shop with Applications to Due-Date Assignment. The International Journal of Production Research, 26(8): p. 1329-1352.
17. 17. Bector, C., Gupta, Y., Gupta, M., 1988. Determination of an Optimal Common Due Date and Optimal Sequence in a Single Machine Job Shop. The International Journal of Production Research, 26(4): p. 613-628.
18. 18. Vig, M.M., Dooley, K.J., 1991. Dynamic Rules for Due-Date Assignment. The International Journal of Production Research, 29(7): p. 1361-1377.
19. 19. Philipoom, P.R., 2000. The Choice of Dispatching Rules in a Shop Using Internally Set Due-Dates with Quoted Leadtime and Tardiness Costs. International Journal of Production Research, 38(7): p. 1641-1655.
20. 20. Baykasoğlu, A., Göçken, M., 2009. Gene Expression Programming Based Due Date Assignment in a Simulated Job Shop. Expert Systems with Applications, 36(10): p. 12143-12150.
21. 21. Rajabinasab, A., Mansour, S., 2011. Dynamic Flexible Job Shop Scheduling with Alternative Process Plans: An Agent-Based Approach. The International Journal of Advanced Manufacturing Technology, 54(9-12): p. 1091-1107.
22. 22. Y. Yin, S. R. Cheng, T. C. E. Cheng, C. C. Wu, W. H. Wu, 2012. Two-Agent Single-Machine Scheduling with Assignable Due Dates. Applied Mathematics and Computation, 219(4): p. 1674-1685.
23. 23. Van Brussel, H., Wyns, J., Valckenaers, P., Bongaerts, L., Peeters, P., 1998. Reference Architecture for Holonic Manufacturing Systems: PROSA. Computers in Industry, 37(3): p. 255-274.