Hibrit Evrimsel Strateji ve Tavlama Benzetimi Algoritmaları ile Bütünleşik Süreç Planlama Planlama, Çizelgeleme ve Teslim Tarihi Belirleme Problem Çözümü

Year 2021, Volume: 9 Issue: 1, 86 - 91, 29.01.2021

Halil İbrahim Demir , Rakesh Phanden Abdullah Kökçam , Burak Erkayman , Caner Erden

https://doi.org/10.21541/apjes.764150

Cited By: 1

Abstract

Bütünleşik süreç planlama ve çizelgeleme (IPPS) problemi ile teslim tarihi belirleme ile çizelgeleme (SWDDA) problemlerinin literatürde kapsamlı olarak kapsamlı olarak çalışılmasına rağmen, süreç planlama, çizelgeleme ve teslim tarihi belirleme fonksiyonlarının bütünleşik çalışılması ile alakalı yalnızca birkaç çalışma vardır. Bütünleşik çalışmalar ile daha iyi bir küresel performans sağlandığından, bu üretim fonksiyonlarının birlikte çalıştırılması önem arz etmektedir. Bu çalışmada, süreç planlama ve en kısa teslim tarihine sahip işlerin önceliklendirildiği (EDD) çizelgeleme kuralı ile teslim tarihi belirleme fonksiyonlarının entegrasyonu, hibrit evrimsel stratejiler (RS/ES) ve hibrit tavlama benzetimi algoritmaları (RS/SA) kullanılarak incelenmiştir. Sıradan çözümler (OS), rasgele arama (RS) çözümleri, evrimsel strateji (ES) çözümleri ve tavlama benzetimi (SA) çözümleri birbirleriyle ve ES ve SA hibrit çözümleri de aralarında karşılaştırılmıştır. Elde edilen sonuçlara göre, daha yüksek bütünleşik çalışmaların daha iyi olduğu ve en iyi sonuçların en yüksek entegrasyon düzeyinde gerçekleştiği tespit edilmiştir. ES ve SA yöntemleri RS ve OS ile karşılaştırıldığında daha iyi sonuçlar vermiştir. Çalışma sonucunda RS/ES ve RS/SA tekniklerinin bütünleşik çalışmalar için kullabılabilir algoritmalar olduğu belirtilmiştir.

Keywords

Süreç planlama, çizelgeleme, teslim tarihi atama, hibrit evrimsel strateji, hibrit tavlama benzetimi, rassal arama

Hybrid Evolutionary Strategy and Simulated Annealing Algorithms for Integrated Process Planning, Scheduling and Due-Date Assignment Problem

Abstract

Although integrated process planning and scheduling (IPPS) problem is studied extensively as scheduling with due-date assignment problem (SWDDA) in the literature, there are only a few studies on integration of these three manufacturing functions which are process planning, scheduling, and due-date assignment. Since outputs of upper stream functions effect downstream functions and higher integration gives a better global performance, it is better to integrate these three functions. In this study integration of process planning and earliest due-date scheduling (EDD) with due-date assignment is studied using hybrid evolutionary strategies (RS/ES) and hybrid simulated annealing algorithms (RS/SA). Ordinary solutions (OS), random search (RS) solutions, evolutionary strategies (ES) solutions, and simulated annealing (SA) solutions are compared with each other and hybrid solutions of ES and SA, with RS. According to the results, higher integration found better and best results are obtained with the highest integration level. ES and SA methods gave better results compared to the RS and OS, and RS/ES and RS/SA techniques were found promising search techniques.

Keywords

Process planning, scheduling, due-date assignment, hybrid evolutionary strategies, hybrid simulated annealing, random search

References

• W. Tan and B. Khoshnevis, “Integration of process planning and scheduling-a review,” Journal of Intelligent Manufacturing, vol. 11, no. 1, pp. 51–63, 2000, doi: 10.1023/A:1008952024606.
• X. Li, L. Gao, C. Zhang, and X. Shao, “A review on Integrated Process Planning and Scheduling,” International Journal of Manufacturing Research, vol. 5, no. 2, pp. 161-180, Jan. 2010.
• R. K. Phanden, A. Jain, and R. Verma, “Integration of process planning and scheduling: a state-of-the-art review,” International Journal of Computer Integrated Manufacturing, vol. 24, no. 6, pp. 517–534, 2011.
• N. Morad and A. M. S. Zalzala, “Genetic algorithms in integrated process planning and scheduling,” Journal of Intelligent Manufacturing, vol. 10, no. 2, pp. 169–179, 1999, doi: 10.1023/A:1008976720878.
• W. Tan and B. Khoshnevis, “A linearized polynomial mixed integer programming model for the integration of process planning and scheduling,” J. intell. manuf., vol. 15, no. 5, pp. 593–605, 2004, doi: 10.1023/B:JIMS.0000037710.80847.b6.
• Y. W. Guo, W. D. Li, A. R. Mileham, and G. W. Owen, “Optimisation of integrated process planning and scheduling using a particle swarm optimisation approach,” International Journal of Production Research, vol. 47, no. 14, pp. 3775–3796, 2009, doi: 10.1080/00207540701827905.
• A. Baykasoğlu and L. Özbakır, “A grammatical optimization approach for integrated process planning and scheduling,” Journal of Intelligent Manufacturing, vol. 20, no. 2, pp. 211–221, 2009, doi: 10.1007/s10845-008-0223-0.
• C. W. Leung, T. N. Wong, K.-L. L. Mak, and R. Y. K. Fung, “Integrated process planning and scheduling by an agent-based ant colony optimization,” Computers and Industrial Engineering, vol. 59, no. 1, pp. 166–180, 2010, doi: 10.1016/j.cie.2009.09.003.
• R. R. K. Phanden, A. Jain, and R. Verma, “An approach for integration of process planning and scheduling,” International Journal of Computer \ldots, vol. 26, no. 4, pp. 284–302, Apr. 2013, doi: 10.1080/0951192X.2012.684721.
• L. Zhang and T. N. N. Wong, “An object-coding genetic algorithm for integrated process planning and scheduling,” European Journal of Operational Research, vol. 244, no. 2, pp. 434–444, Jul. 2015, doi: 10.1016/j.ejor.2015.01.032.
• T. Hill, Production/operations management: text and cases. Prentice Hall, 1991.
• V. Gordon, J. M. Proth, and C. Chu, “Due date assignment and scheduling: SLK, TWK and other due date assignment models,” Production Planning & Control, vol. 13, no. 2, pp. 117–132, 2002, doi: 10.1080/09537280110069621.
• Y. Yin, S. R. Cheng, T. C. E. E. Cheng, C. C. Wu, and W. H. Wu, “Two-agent single-machine scheduling with assignable due dates,” Applied Mathematics and Computation, vol. 219, no. 4, pp. 1674–1685, 2012, doi: 10.1016/j.amc.2012.08.008.
• Y. Yin, T. C. E. E. Cheng, D. Xu, and C.-C. C. Wu, “Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost,” Computers and Industrial Engineering, vol. 63, no. 1, pp. 223–234, 2012, doi: 10.1016/j.cie.2012.02.015.
• Y. Yin, M. Liu, T. C. E. Cheng, C. C. Wu, and S. R. Cheng, “Four single-machine scheduling problems involving due date determination decisions,” Information Sciences, vol. 251, pp. 164–181, 2013, doi: 10.1016/j.ins.2013.06.035.
• M. Iranpoor, S. M. T. T. Fatemi Ghomi, and M. Zandieh, “Due-date assignment and machine scheduling in a low machine-rate situation with stochastic processing times,” Computers and Operations Research, vol. 40, no. 4, pp. 1100–1108, 2013, doi: 10.1016/j.cor.2012.11.013.
• D. L. Yang, C. J. Lai, and S. J. Yang, “Scheduling problems with multiple due windows assignment and controllable processing times on a single machine,” International Journal of Production Economics, vol. 150, pp. 96–103, 2014, doi: 10.1016/j.ijpe.2013.12.021.
• H. I. Demir and H. Taskin, “Integrated Process Planning, Scheduling and Due-Date Assignment,” PhD Thesis, Sakarya University, 2005.
• C. Erden and H. I. Demir, “Integrating process planning, scheduling and due date assignment in a dynamic environment,” PhD Thesis, Sakarya University, 2019.
• H. I. Demir and C. Erden, “Solving process planning and weighted scheduling with WNOPPT weighted due-date assignment problem using some pure and hybrid meta-heuristics,” Sakarya University Journal of Science, vol. 21, no. 2, pp. 210–222, 2017.
• H. I. Demir and C. Erden, “Dynamic integrated process planning, scheduling and due-date assignment using ant colony optimization,” Computers & Industrial Engineering, vol. 149, p. 106799, Nov. 2020, doi: 10.1016/j.cie.2020.106799.
• C. Erden, H. I. Demir, and A. H. Kökçam, “Solving Integrated Process Planning, Dynamic Scheduling, and Due Date Assignment Using Metaheuristic Algorithms,” Mathematical Problems in Engineering, vol. 2019, 2019.