PROCESS PLANNING AND SCHEDULING WITH PPW DUE-DATE ASSIGNMENT USING HYBRID SEARCH

Authors

  • Halil Ibrahim Demir Industrial Engineering Department, Sakarya University, Sakarya, Turkey
  • Tarık Cakar Industrial Engineering Department, Sakarya University, Sakarya, Turkey
  • Mumtaz Ipek Industrial Engineering Department, Sakarya University, Sakarya, Turkey
  • Burak Erkayman Industrial Engineering Department, Atatürk University, Erzurum, Turkey
  • Kadriye Canpolat Industrial Engineering Department, Sakarya University, Sakarya, Turkey

DOI:

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

Keywords:

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

Abstract

Although IPPS (Integrated Process Planning And Scheduling), and SWDDA (Scheduling With Due Date Assignment) are two popular area in which numerous work is done, IPPSDDA (Integrated Process Planning, Scheduling And Due Date Assignment) is a new research field only a few works are done. Most of the works assign common due dates for the jobs but this study assigns a unique due date for each job in a job shop environment. Three terms are used at the performance measure which is weighted tardiness, earliness, and due dates. Sum of all these terms is tried to be minimized. Different level of integration of these three functions is tested. Since job shop scheduling is alone NP-Hard, integrated solution is harder to solve that’s why hybrid search and random search are used as solution techniques. Integration found useful and as integration level, the increased solution is found better. Search results are compared with ordinary solutions and searches are found useful and hybrid search outperformed random search.

References

Aldakhilallah, K.A, & Ramesh, R. (1999). Computer-Integrated process planning and scheduling (CIPPS): Intelligent support for product design, process planning and control. International Journal of Production Research, 37(3), 481–500. doi:10.1080/002075499191634

Bhaskaran, K. (1990). Process plan selection. International Journal of Production Research, 28(8), 1527–1539. doi:10.1080/00207549008942810

Biskup, D., & Jahnke, H. (2001). Common due date assignment for scheduling on a single machine with jointly reducible processing times. International Journal of Production Economics, 69(3), 317–322. http://doi.org/10.1016/S0925-5273(00)00040-2

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

Drstvensek, I., & Balic, J., (son) Balic. (2003). Responding ability in dynamic production circumstances. Journal of Materials Processing Technology, 133, 71–78. doi:10.1016/S0924-0136(02)00246-7

Gordon, V., & Kubiak, W. (1998). Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs. Information Processing Letters, 68(3), 153–159. http://doi.org/10.1016/S0020-0190(98)00153-7

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

Kim, K.-H., & Egbelu, P. J. (1999). Scheduling in a production environment with multiple process plans per job. International Journal of Production Research, 37(12), 2725–2753. http://doi.org/10.1080/002075499190491

Kumar, M., & Rajotia, S. (2003). Integration of scheduling with computer aided process planning. Journal of Materials Processing Technology, 138(1–3), 297–300. http://doi.org/10.1016/S0924-0136(03)00088-8

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

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, S., Ng, C. T., & Yuan, J. (2011). Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine. International Journal of Production Economics, 131(2), 747–751. http://doi.org/10.1016/j.ijpe.2011.02.029

Li, X., Gao, L., & Li, W. (2012). Application of game theory based hybrid algorithm for multi-objective integrated process planning and scheduling. Expert Systems with Applications, 39(1), 288–297. http://doi.org/10.1016/j.eswa.2011.07.019

Lin, S.-W., Chou, S.-Y., & Chen, S.-C. (2007). Meta-heuristic approaches for minimizing total earliness and tardiness penalties of single-machine scheduling with a common due date. Journal of Heuristics, 13(2), 151–165. http://doi.org/10.1007/s10732-006-9002-2

Ming, X. G., & Mak, K. L. (2000). A hybrid Hopfield network-genetic algorithm approach to optimal process plan selection. International Journal of Production Research, 38(8), 1823–1839. http://doi.org/10.1080/002075400188618

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

Seker, A., Erol, S., & Botsali, R. (2013). A neuro-fuzzy model for a new hybrid integrated Process Planning and Scheduling system. Expert Systems with Applications, 40(13), 5341–5351. http://doi.org/10.1016/j.eswa.2013.03.043

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

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

Vinod, V., & Sridharan, R. (2011). Simulation modeling and analysis of due-date assignment methods and scheduling decision rules in a dynamic job shop production system. International Journal of Production Economics, 129(1), 127–146. http://doi.org/10.1016/j.ijpe.2010.08.017

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

Wang, J., Fan, X., Zhang, C., & Wan, S. (2014). A Graph-based Ant Colony Optimization Approach for Integrated Process Planning and Scheduling. Chinese Journal of Chemical Engineering, 22(7), 748–753. http://doi.org/10.1016/j.cjche.2014.05.011

Yin, Y., Cheng, T. C. E., Xu, D., & Wu, C.-C. (2012). Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost. Computers & Industrial Engineering, 63(1), 223–234. http://doi.org/10.1016/j.cie.2012.02.015

Yin, Y., Cheng, T.C.E., Yang, X., & Wu, C.C. (2015). Two-agent single-machine scheduling with unrestricted due date assignment. Computers and Industrial Engineering, 79, 148–155. doi:10.1016/j.cie.2014.10.025

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

Zhang, L., & Wong, T.N. (2015). An object-coding genetic algorithm for integrated process planning and scheduling. European Journal of Operational Research, 244(2), 434–444. doi:10.1016/j.ejor.2015.01.032

Downloads

Published

2016-01-01

How to Cite

Demir, H. I., Cakar, T., Ipek, M., Erkayman, B., & Canpolat, K. (2016). PROCESS PLANNING AND SCHEDULING WITH PPW DUE-DATE ASSIGNMENT USING HYBRID SEARCH. MATTER: International Journal of Science and Technology, 2(1), 20–38. https://doi.org/10.20319/Mijst.2016.s21.2038