Integrating Process Planning, WATC Weighted Scheduling, and WPPW Weighted Due-Date Assignment Using Pure and Hybrid Metaheuristics for Weighted Jobs

Yıl 2017, Cilt: 3 Sayı: 1, 11 - 20, 28.06.2017

Halil İbrahim Demir Et Al.

https://doi.org/10.22399/ijcesen.323860

Cited By: 1

Öz

Process planning,
scheduling and due date assignment are three important manufacturing functions
performed sequentially and separately. High interrelations between these
functions forces us to consider integration. Here we studied integration of
process planning, WATC scheduling and WPPW weighed due date assignment. At the
literature due dates are assigned without taking into account of weights of
each job but at this study we assigned closer due dates for more important
customers. Thus we saved a lot at punishment function.  Conventionally only tardiness is punished but
according to JIT approach we should penalize both earliness and tardiness.
Since nobody desire long due dates, at this study we penalized all of weighted
earliness, tardiness and due date related costs. We used genetic algorithm,
hybrid-genetic algorithm, evolutionary strategies, hybrid-evolutionary
strategies, random search and ordinary solutions as solution techniques and we
observed the superiority of search algorithms over random search and especially
over ordinary solutions. We step by step integrated these functions and higher
integration level is found better. Although there are numerous works on IPPS
and SWDDA problems, there are only a few works on IPPSDDA problem.

Anahtar Kelimeler

Process Planning, Weighted Scheduling, Integrating Process Planning

Kaynakça

• [1] H.-C. Zhang and M. S, “An integrated model of process planning and production scheduling,” International Journal of Computer Integrated Manufacturing, vol. 7, pp. 356–364, 1994. [2] V. Gordon, J. M. Proth, and C. Chu, “A survey of the state-of-the-art of common due date assignment and scheduling research,” European Journal of Operational Research, vol. 139, no. 1, pp. 1–25, 2002. [3] H. I. Demir and H. Taskin, “Integrated Process Planning, Scheduling and Due-Date Assignment,” Sakarya University, 2005. [4] E. Ceven and H. I. Demir, “Benefits of Integrating Due-Date Assignment with Process Planning and Scheduling,” Sakarya University, 2007. [5] H. I. Demir, T. Cakar, M. Ipek, O. Uygun, and M. Sari, “Process Planning and Due-date Assignment with ATC Dispatching where Earliness , Tardiness and Due-dates are Punished,” Journal of Industrial and, vol. 3, no. 3, pp. 197–204, 2015. [6] H. İ. Demir and C. Erden, “Proses planlama ve ağırlıklı teslim tarihi atama ile birlikte ağırlıklı çizelgeleme probleminin bazı saf ve melez meta-sezgisel yöntemler ile çözümü,” Sakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi Fen Bilimleri Enstitüsü Dergisi, vol. 21, no. 2, pp. 1–1, Apr. 2017. [7] W. Tan and B. Khoshnevis, “Integration of process planning and scheduling—a review,” Journal of Intelligent Manufacturing, vol. 11, pp. 51–63, 2000. [8] X. Li, L. Gao, C. Zhang, and X. Shao, “A review on integrated process planning and scheduling,” International Journal of, vol. 5, pp. 161–180, 2010. [9] 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. [10] H. Demir and S. D. Wu, “A comparison of several optimization schemes for the integrated process planning and production scheduling problems,” Lehigh University, 1996. [11] B. Khoshnevis and Q. M. Chen, “Integration of Process Planning and Scheduling Functions,” Journal of Intelligent Manufacturing, vol. 2, no. 3, pp. 165–175, 1991. [12] J. Hutchison, K. LEONG, and D. SNYDER, “Scheduling approaches for random job shop flexible manufacturing systems,” International Journal of Production Research, vol. 29, no. 5, pp. 1053–1067, 1991. [13] Q. Chen and B. Khoshnevis, “Scheduling with flexible process plans,” Production Planning & Control : The Management of Operations, vol. 4, no. 4, pp. 333–343, 1993. [14] P. Brandimarte, “Exploiting process plan flexibility in production scheduling: A multi-objective approach,” European Journal of Operational Research, vol. 114, no. 1, pp. 59–71, 1999. [15] K. H. Kim and P. J. Egbelu, “Scheduling in a production environment with multiple process plans per job,” International Journal of Production Research, vol. 37, no. 12, pp. 2725–2753, 1999. [16] N. Morad and A. Zalzala, “Genetic algorithms in integrated process planning and scheduling,” Journal of Intelligent Manufacturing, vol. 10, no. 2, pp. 169–179, 1999. [17] Y. K. Kim, K. Park, and J. Ko, “A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling,” Computers & Operations Research, vol. 30, no. 8, pp. 1151–1171, 2003. [18] J. M. Usher, “Evaluating the impact of alternative plans on manufacturing performance,” Computers & Industrial Engineering, vol. 45, no. 4, pp. 585–596, 2003. [19] M. K. Lim and D. Z. Zhang, “An integrated agent-based approach for responsive control of manufacturing resources,” Computers and Industrial Engineering, vol. 46, no. 2, pp. 221–232, 2004. [20] W. Tan and B. Khoshnevis, “A linearized polynomial mixed integer programming model for the integration of process planning and scheduling,” Journal of Intelligent Manufacturing, vol. 15, no. 5, pp. 593–605, 2004. [21] M. Kumar and S. Rajotia, “Integration of scheduling with computer aided process planning,” Journal of Materials Processing Technology, vol. 138, no. 1–3, pp. 297–300, 2003. [22] C. Moon, Y. H. Lee, C. S. Jeong, and Y. Yun, “Integrated process planning and scheduling in a supply chain,” Computers & Industrial Engineering, vol. 54, no. 4, pp. 1048–1061, 2008. [23] C. W. Leung, T. N. Wong, K. 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. [24] S. Panwalkar and M. Smith, “Common due date assignment to minimize total penalty for the one machine scheduling problem,” Operations research, vol. 30, pp. 391–399, 1982. [25] V. Gordon and W. Kubiak, “Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs,” Information Processing Letters, vol. 68, no. 3, pp. 153–159, 1998. [26] D. Biskup and H. Jahnke, “Common due date assignment for scheduling on a single machine with jointly reducible processing times,” International Journal of Production Economics, vol. 69, no. 3, pp. 317–322, 2001. [27] T. C. E. Cheng, Z. L. Chen, and N. V. Shakhlevich, “Common due date assignment and scheduling with ready times,” Computers and Operations Research, vol. 29, no. 14, pp. 1957–1967, 2002. [28] J. A. Ventura and S. Radhakrishnan, “Single machine scheduling with symetric earliness and tardiness penalties,” European Journal of Operational Research, vol. 144, pp. 598–612, 2003. [29] T. C. E. Cheng, C. T. Ng, J. J. Yuan, and Z. H. Liu, “Single machine scheduling to minimize total weighted tardiness,” European Journal of Operational Research, vol. 165, no. 2, pp. 423–443, 2005. [30] J. B. Wang, “Single machine scheduling with common due date and controllable processing times,” Applied Mathematics and Computation, vol. 174, no. 2, pp. 1245–1254, 2006. [31] S. W. Lin, S. Y. Chou, and K. C. Ying, “A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date,” European Journal of Operational Research, vol. 177, no. 2, pp. 1294–1301, 2006. [32] Y. Xia, B. Chen, and J. Yue, “Job sequencing and due date assignment in a single machine shop with uncertain processing times,” European Journal of Operational Research, vol. 184, no. 1, pp. 63–75, 2008. [33] V. S. Gordon and V. A. Strusevich, “Single machine scheduling and due date assignment with positionally dependent processing times,” European Journal of Operational Research, vol. 198, no. 1, pp. 57–62, 2009. [34] X. Li, L. Gao, C. Zhang, and X. Shao, “A review on integrated process planning and scheduling,” International Journal of, vol. 5, no. 2, pp. 161–180, 2010. [35] G. I. Adamopoulos and C. P. Pappis, “Scheduling under a common due-data on parallel unrelated machines,” European Journal of Operational Research, vol. 105, no. 3, pp. 494–501, 1998. [36] T. C. E. Cheng and M. Y. Kovalyov, “Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness,” European Journal of Operational Research, vol. 114, no. 2, pp. 403–410, 1999. [37] V. Lauff and F. Werner, “Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey,” Mathematical and Computer Modelling, vol. 40, no. 5–6, pp. 637–655, 2004.