Erken Tamamlanma, Gecikme ve Teslim Tarihinin Cezalandırıldığı Durumda Proses Planlama ve Çizelgelemenin WNOPPT Ağırlıklı Teslim Tarihi Belirleme ile Entegrasyonu

Abstract

Proses planlama, çizelgeleme ve teslim tarihi belirleme üç önemli imalat fonksiyonudur. Literatüre göre proses planlama ve çizelgelemenin entegrasyonu ve teslim tarihi belirlemeli çizelgeleme üzerine çok sayıda çalışma vardır. Fakat bu üç fonksiyonun entegre edildiği çalışmalar azdır. Literatüre göre teslim tarihleri müşteri ağırlıklarını hesaba katmadan verilmektedir. Bu çalışmada üç fonksiyon entegre edilmiş ve teslim tarihleri müşteri önemi hesaba katılarak verilmiştir. Sekiz atölye çalışılmıştır. Bu üç fonksiyonun farklı entegrasyon seviyeleri test edilmiş, birbirleriyle karşılaştırılmıştır. Genetik arama ve rassal aramadan oluşan iki arama tekniği kullanılmış ve sonuçları sıradan çözümlerle karşılaştırılmıştır. Entegrasyon seviyesi arttıkça sonuçlar daha iyi olmuş, arama teknikleri sıradan çözümlere göre daha iyi sonuçlar vermiş ve genetik arama rassal aramadan üstün çıkmıştır.

Keywords

• Proses Planlama,Ağırlıklı Çizelgeleme,Ağırlıklı Teslim Tarihi Belirleme,Genetik Algoritmalar,Rassal Arama

Process Planning and Scheduling with WNOPPT Weighted Due-Date Assignment where Earliness, Tardiness and Due-Dates are Penalized

Abstract

Process planning, scheduling and due date assignment are three important manufacturing functions in production system in which process planning is input to scheduling processes. Because of rigid process plans, alternative plans are not used that may affect global performance improvement in a bad way. Besides, scheduling without considering process plans causes unbalanced machine loadings and leads to several bottlenecks. In the literature, there are numerous works on process planning and scheduling and works on scheduling with due date assignment. These three functions are not integrated much. According to literature, due dates are assigned without considering weights of the customer. In this study, these three functions are integrated and due dates are given according to the importance of the customers. Eight shop floors are studied. Different levels of integration of these three functions are tested and compared with each other. Two search techniques used which are genetic search and random search and results are compared with ordinary solutions. As the level of integration increased solutions became better and search techniques gave a better result than ordinary solutions and the genetic search outperformed random search.

Keywords

• Process Planning,Weighted Scheduling,Weighted Due-Date Assignment,Genetic Algorithms,Random Search

References

1. Adamopoulos, G.I., Pappis, C.P., 1998. Scheduling under a common due-data on parallel unrelated machines. Eur. J. Oper. Res. 105, 494–501.
2. Biskup, D., Jahnke, H., 2001. Common due date assignment for scheduling on a single machine with jointly reducible processing times. Int. J. Prod. Econ. 69, 317–322.
3. Brandimarte, P., 1999. Exploiting process plan flexibility in production scheduling: A multi-objective approach. Eur. J. Oper. Res. 114, 59–71.
4. Ceven, E., Demir, H.I., 2007. Benefits of Integrating Due-Date Assignment with Process Planning and Scheduling (Master of Science Thesis). Sakarya University.Chen, Q.M., Khoshnevis, B., 1993. Scheduling with flexible process plans. Prod. Plan. Control 4, 333–343.
5. Cheng, T.C.E., Chen, Z.-L., Shakhlevich, N.V., 2002. Common due date assignment and scheduling with ready times. Comput. Oper. Res. 29, 1957–1967.
6. Cheng, T.C.E., Kovalyov, M.Y., 1999. Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness. Eur. J. Oper. Res. 114, 403–410.
7. Demir, H.I., Taskin, H., 2005. Integrated Process Planning, Scheduling and Due-Date Assignment (PhD Thesis). Sakarya University.
8. Demir, H.I., Taskin, H., Cakar, T., 2004. Integrated process planning, scheduling and due-date assignment. Presented at the International Intelligent Manufacturing Systems, Sakarya, Turkey, pp. 1165–1175.

9. Demir, H.I., Uygun, O., Cil, I., Ipek, M., Sari, M., 2015. Process Planning and Scheduling with SLK Due-Date Assignment where Earliness, Tardiness and Due-Dates are Punished. J. Ind. Intell. Inf. 3, 173–180.
10. Gordon, V., Kubiak, W., 1998. Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs. Inf. Process. Lett. 68, 153–159.
11. Gordon, V., Proth, J.-M., Chu, C., 2002. A survey of the state-of-the-art of common due date assignment and scheduling research. Eur. J. Oper. Res. 139, 1–25.
12. Gordon, V.S., Strusevich, V.A., 2009. Single machine scheduling and due date assignment with positionally dependent processing times. Eur. J. Oper. Res. 198, 57–62.
13. Hutchison, J., Leong, K., Snyder, D., Ward, P., 1991. Scheduling approaches for random job shop flexible manufacturing systems. Int. J. Prod. Res. 29, 1053–1067.
14. Khoshnevis, B., Chen, Q.M., 1991. Integration of process planning and scheduling functions. J. Intell. Manuf. 2, 165–175.
15. Kim, K.-H., Egbelu, P.J., 1999. Scheduling in a production environment with multiple process plans per job. Int. J. Prod. Res. 37, 2725–2753.
16. Kim, Y.K., Park, K., Ko, J., 2003. A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling. Comput. Oper. Res. 30, 1151–1171.
17. Kumar, M., Rajotia, S., 2005. Integration of process planning and scheduling in a job shop environment. Int. J. Adv. Manuf. Technol. 28, 109–116.
18. Lauff, V., Werner, F., 2004. Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey. Math. Comput. Model. 40, 637–655.
19. Leung, C.W., Wong, T.N., Mak, K.L., Fung, R.Y.K., 2010. Integrated process planning and scheduling by an agent-based ant colony optimization. Comput. Ind. Eng. 59, 166–180.
20. Li, J., Yuan, X., Lee, E.S., Xu, D., 2011. Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness–tardiness costs on a single machine. Comput. Math. Appl. 62, 4126–4139.
21. Li, X., Gao, L., Zhang, C., Shao, X., 2010. A review on Integrated Process Planning and Scheduling. Int. J. Manuf. Res. 5, 161–180.
22. Lim, M.K., Zhang, D.Z., 2004. An integrated agent-based approach for responsive control of manufacturing resources. Comput. Ind. Eng., Special Issue on Selected Papers from the 27th. International Conference on Computers and Industrial Engineering, Part 1. 46, 221–232.
23. Moon, C., Lee, Y.H., Jeong, C.S., Yun, Y., 2008. Integrated process planning and scheduling in a supply chain. Comput. Ind. Eng. 54, 1048–1061.
24. Morad, N., Zalzala, A., 1999. Genetic algorithms in integrated process planning and scheduling. J. Intell. Manuf. 10, 169–179.
25. Nearchou, A.C., 2008. A differential evolution approach for the common due date early/tardy job scheduling problem. Comput. Oper. Res. 35, 1329–1343.
26. Panwalkar, S.S., Smith, M.L., Seidmann, A., 1982. Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem. Oper. Res. 30, 391–399.
27. Phanden, R.K., Jain, A., Verma, R., 2011. Integration of process planning and scheduling: a state-of-the-art review. Int. J. Comput. Integr. Manuf. 24, 517–534. Tan, W., Khoshnevis, B., 2004. A linearized polynomial mixed integer programming model for the integration of process planning and scheduling. J. Intell. Manuf. 15, 593–605.
28. Tan, W., Khoshnevis, B., 2000. Integration of process planning and scheduling— a review. J. Intell. Manuf. 11, 51–63. Usher, J.M., 2003. Evaluating the impact of alternative plans on manufacturing performance. Comput. Ind. Eng. 45, 585–596.
29. Xia, Y., Chen, B., Yue, J., 2008. Job sequencing and due date assignment in a single machine shop with uncertain processing times. Eur. J. Oper. Res. 184, 63–75.
30. Ying, K.-C., 2008. Minimizing earliness–tardiness penalties for common due date single-machine scheduling problems by a recovering beam search algorithm. Comput. Ind. Eng. 55, 494–502.
31. Zhang, H.-C., Mallur, S., 1994. An integrated model of process planning and production scheduling. Int. J. Comput. Integr. Manuf. 7, 356–364.