PROCESS PLANNING AND WEIGHTED SCHEDULING WITH WNOPPT WEIGHTED DUE-DATE ASSIGNMENT USING HYBRID SEARCH FOR WEIGHTED CUSTOMERS

Authors

  • Halil Ibrahim Demir Industrial Engineering Department, Sakarya University, Sakarya, Turkey
  • Ibrahim Cil Industrial Engineering Department, Sakarya University, Sakarya, Turkey
  • Ozer Uygun Industrial Engineering Department, Sakarya University, Sakarya, Turkey
  • Fuat Simsir Industrial Engineering Department, Karabuk University, Karabuk, Turkey
  • Abdullah Hulusi Kokcam Industrial Engineering Department, Sakarya University, Sakarya, Turkey

DOI:

https://doi.org/10.20319/Mijst.2016.s21.0119

Keywords:

Process Planning, Scheduling, Weighted Due-Date Assignment, Hybrid Search, Genetic Algorithm, Random Search

Abstract

Although scheduling with due date assignment and, integrated process planning and scheduling are two popular topics studied by researchers, there are few works on the integration of process planning, scheduling, and due date assignment. In this study integration of process planning and scheduling with the weighted due date, the assignment is studied. Different level of integration of these three functions is tested. As a solution techniques random search and hybrid search are applied. The hybrid search starts with random search and continues with the genetic search. Search results are compared with ordinary solutions and searches are found very useful and hybrid search outperformed random search. Hybrid search with full integration combination found as the best combination. 

References

Adamopoulos, G. I., & Pappis, C. P. (1998). Scheduling under a common due-data on parallel unrelated machines. European Journal of Operational Research, 105(3), 494–501. http://doi.org/10.1016/S0377-2217(97)00057-X

Brandimarte, P. (1999). Exploiting process plan flexibility in production scheduling: A multi-objective approach. European Journal of Operational Research, 114(1), 59–71. http://doi.org/10.1016/S0377-2217(98)00029-0

Ceven, E., & Demir, H. I. (2007). Benefits of Integrating Due-Date Assignment with Process Planning and Scheduling (Master of Science Thesis). Sakarya University.

Cheng, T.C.E.,& Kovalyov, M. Y. (1999). Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness.European Journal of Operational Research,114(2),403–410. http://doi.org/10.1016/S0377-2217(98)00111-8

Demir, H. I., & Taskin, H. (2005). Integrated Process Planning, Scheduling and Due-Date Assignment (PhD Thesis). Sakarya University.

Demir, H. I., Taskin, H., & Cakar, T. (2004). Integrated process planning, scheduling and due-date assignment (pp. 1165–1175). Presented at the International Intelligent Manufacturing Systems, Sakarya, Turkey.

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. Journal of Industrial and Intelligent Information Vol, 3(3). Retrieved from http://www.jiii.org/uploadfile/2014/1216/20141216112142980.pdf

Gordon, V., Proth, J.-M., & Chu, C. (2002). A survey of the state-of-the-art of common due date assignment and scheduling research. European Journal of Operational Research, 139(1), 1–25. http://doi.org/10.1016/S0377-2217(01)00181-3

Gordon, V. S., & Strusevich, V. A. (2009). Single machine scheduling and due date assignment with positionally dependent processing times. European Journal of Operational Research, 198(1), 57–62. http://doi.org/10.1016/j.ejor.2008.07.044

Khoshnevis, B., & Chen, Q. M. (1991). Integration of process planning and scheduling functions. Journal of Intelligent Manufacturing, 2(3), 165–175. http://doi.org/10.1007/BF01471363

Kim, Y. K., Park, K., & Ko, J. (2003). A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling. Computers & Operations Research, 30(8), 1151–1171. http://doi.org/10.1016/S0305-0548(02)00063-1

Kumar, M., & Rajotia, S. (2005). Integration of process planning and scheduling in a job shop environment. The International Journal of Advanced Manufacturing Technology, 28(1-2), 109–116. http://doi.org/10.1007/s00170-004-2317-y

Lauff, V., & Werner, F. (2004). Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey. Mathematical and Computer Modelling, 40(5–6), 637–655. http://doi.org/10.1016/j.mcm.2003.05.019

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. Computers & Industrial Engineering, 59(1), 166–180. http://doi.org/10.1016/j.cie.2009.09.003

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. Computers & Mathematics with Applications, 62(11), 4126–4139. http://doi.org/10.1016/j.camwa.2011.09.063

Li, X., Gao, L., Zhang, C., & Shao, X. (2010). A review on Integrated Process Planning and Scheduling. International Journal of Manufacturing Research, 5(2), 161–180. http://doi.org/10.1504/IJMR.2010.03163

Morad, N., & Zalzala, A. (1999). Genetic algorithms in integrated process planning and scheduling. Journal of Intelligent Manufacturing, 10(2), 169–179. http://doi.org/10.1023/A:1008976720878

Phanden, R. K., Jain, A., & Verma, R. (2011). Integration of process planning and scheduling: a state-of-the-art review. International Journal of Computer Integrated Manufacturing, 24(6), 517–534. http://doi.org/10.1080/0951192X.2011.562543

Tan, W., & Khoshnevis, B. (2000). Integration of process planning and scheduling— a review. Journal of Intelligent Manufacturing, 11(1), 51–63. http://doi.org/10.1023/A:1008952024606

Tan, W., & Khoshnevis, B. (2004). A linearized polynomial mixed integer programming model for the integration of process planning and scheduling. Journal of Intelligent Manufacturing, 15(5), 593–605. http://doi.org/10.1023/B:JIMS.0000037710.80847.b6

Usher, J. M. (2003). Evaluating the impact of alternative plans on manufacturing performance. Computers & Industrial Engineering, 45(4), 585–596. http://doi.org/10.1016/S0360-8352(03)00076-7

Ventura, J. A., & Radhakrishnan, S. (2003). Single machine scheduling with symmetric earliness and tardiness penalties. European Journal of Operational Research, 144(3), 598–612. http://doi.org/10.1016/S0377-2217(02)00163-7

Wang, J.-B. (2006). Single machine scheduling with common due date and controllable processing times. Applied Mathematics and Computation, 174(2), 1245–1254. http://doi.org/10.1016/j.amc.2005.05.046

Xia, Y., Chen, B., & Yue, J. (2008). Job sequencing and due date assignment in a single machine shop with uncertain processing times. European Journal of Operational Research, 184(1), 63–75. http://doi.org/10.1016/j.ejor.2006.10.058

Zhang, H.-C., & Mallur, S. (1994). An integrated model of process planning and production scheduling. International Journal of Computer Integrated Manufacturing, 7(6), 356–364. http://doi.org/10.1080/09511929408944623

Downloads

Published

2016-01-01

How to Cite

Demir, H. I., Cil, I., Uygun, O., Simsir, F., & Kokcam, A. H. (2016). PROCESS PLANNING AND WEIGHTED SCHEDULING WITH WNOPPT WEIGHTED DUE-DATE ASSIGNMENT USING HYBRID SEARCH FOR WEIGHTED CUSTOMERS. MATTER: International Journal of Science and Technology, 2(1), 01–19. https://doi.org/10.20319/Mijst.2016.s21.0119

Issue

Vol. 2 No. 1 (2016): Special Issue

Section

Articles

License

Copyright (c) 2016 Authors

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

Copyright of Published Articles

Author(s) retain the article copyright and publishing rights without any restrictions.

Creative Commons License
All published work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.