Solving Process Planning, ATC Scheduling and Due-date Assignment Problems Concurrently Using Genetic Algorithm for Weighted Customers

Year 2018, Volume: 6 Issue: 1, 87 - 96, 31.01.2018

Caner Erden , Halil İbrahim Demir , Alper Göksu , Özer Uygun

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

Cited By: 1

Abstract

Traditionally process planning, scheduling and
due-date assignment functions are applied sequentially and separately. Since
these three functions effect each other and if we don’t integrate then they
will become poor input for downstream and global performance will be poor. In
these competitive era we have to be competitive also. Integrating these
functions will improve global performance. In this study we investigated the
benefit of integration. We tested different integration level. First we looked
at unintegrated results and later we integrated due-date assignment with
process planning and finally we integrated these two functions with ATC
(Apparent Tardiness Cost) Dispatching. In this study we observed that as
integration level increases the solution becomes better. Integrating due-date
assignment with process planning improves global performance and if we
integrate ATC dispatching with these two functions then we get the best
performance. In addition to integration level we also compared benefit of
search techniques, especially genetic (directed) search. We compared ordinary
solutions (initial populations) with results of random search and genetic
search (after some certain number of iterations). We tested three shop floors
which are small, medium and large shop floor. We observed that search is always
better than ordinary solutions and genetic search outperformed random
(undirected) search. At this study every customer has weight and they are
scheduled by considering weights to improve performance value. 

Keywords

Due-date assignment, Process planning, Job shop scheduling, Genetic Algorithm

References

• M. Pinedo and X. Chao, “Operations scheduling,” 1999.
• 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.
• V. S. 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.
• Y. Yin, M. Liu, T. Cheng, C. Wu, and S. Cheng, “Four single-machine scheduling problems involving due date determination decisions,” Information Sciences, 2013.
• H. I. Demir and H. Taşkın, “Integrated Process Planning, Scheduling and Due-Date Assignment,” Sakarya Üniversitesi, Sakarya, Turkey, 2005.
• H. I. Demir, T. Cakar, Ibrahim Cil, Dugenci, Muharrem, and Erden, Caner, “Integrating Process Planning, WMS Dispatching, and WPPW Weighted Due Date Assignment Using a Genetic Algorithm,” 3rd International Conference on Computational and Experimental Science and Engineering (ICCESEN 2016), vol. 3, no. 7, pp. 1258–1266, 2016.
• E. Ceven and H. I. Demir, “Benefits of Integrating Due-Date Assignment with Process Planning and Scheduling,” 2007.
• 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.
• R. Phanden, A. Jain, and R. Verma, “An approach for integration of process planning and scheduling,” International Journal of Computer …, vol. 26, no. 4, pp. 284–302, 2013.
• 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.
• N. Nasr and E. Elsayed, “Job shop scheduling with alternative machines,” international journal of production research, 1990.
• J. Jiang and M. Chen, “The influence of alternate process planning in job shop scheduling,” Computers & industrial engineering, 1993.
• J. Jiang and W. Hsiao, “Mathematical programming for the scheduling problem with alternate process plans in FMS,” Computers & industrial engineering, 1994.
• S. Huang, H. Zhang, and M. Smith, “A progressive approach for the integration of process planning and scheduling,” IIE transactions, 1995.
• 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.
• C. Moon, J. Kim, and S. Hur, “Integrated process planning and scheduling with minimizing total tardiness in multi-plants supply chain,” Computers & Industrial Engineering, vol. 43, no. 1–2, pp. 331–349, 2002.
• Y. Kim, K. Park, and J. Ko, “A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling,” Computers & operations research, 2003.
• H. Lee and S.-S. Kim, “Integration of Process Planning and Scheduling Using Simulation Based Genetic Algorithms,” The International Journal of Advanced Manufacturing Technology, vol. 18, no. 8, pp. 586–590, 2001.
• 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.
• C. Moon and Y. Seo, “Evolutionary algorithm for advanced process planning and scheduling in a multi-plant,” Computers and Industrial Engineering, vol. 48, no. 2, pp. 311–325, Mar. 2005.
• X. Y. Shao, X. Y. Li, L. Gao, and C. Y. Zhang, “Integration of process planning and scheduling-A modified genetic algorithm-based approach,” Computers & Operations Research, vol. 36, no. 6, pp. 2082–2096, 2009.
• X. Li, X. Shao, L. Gao, and W. Qian, “An effective hybrid algorithm for integrated process planning and scheduling,” International Journal of Production Economics, vol. 126, no. 2, pp. 289–298, 2010.
• X. Li, L. Gao, X. Shao, C. Zhang, and C. Wang, “Mathematical modeling and evolutionary algorithm-based approach for integrated process planning and scheduling,” Computers & Operations Research, 2010.
• X. Li, C. Zhang, L. Gao, W. Li, and X. Shao, “An agent-based approach for integrated process planning and scheduling,” Expert Systems with Applications, vol. 37, no. 2, pp. 1256–1264, 2010.
• X. Li, L. Gao, and X. Shao, “An active learning genetic algorithm for integrated process planning and scheduling,” Expert Systems with Applications, vol. 39, no. 8, pp. 6683–6691, 2012.
• J. Wang, X. Fan, C. Zhang, and S. Wan, “A graph-based ant colony optimization approach for integrated process planning and scheduling,” Chinese Journal of Chemical, 2014.
• A. Seker, S. Erol, and R. Botsali, “A neuro-fuzzy model for a new hybrid integrated Process Planning and Scheduling system,” Expert Systems with Applications, 2013.
• C. Moon, Y. Lee, C. Jeong, and Y. Yun, “Integrated process planning and scheduling in a supply chain,” Computers & Industrial Engineering, 2008.
• Y. Guo, W. Li, A. Mileham, and G. Owen, “Applications of particle swarm optimisation in integrated process planning and scheduling,” Robotics and Computer-, 2009.
• X. Li, L. Gao, and W. Li, “Application of game theory based hybrid algorithm for multi-objective integrated process planning and scheduling,” Expert Systems with Applications, vol. 39, no. 1, pp. 288–297, 2012.
• 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.
• 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.
• 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.
• T. Cheng, L. Kang, and C. Ng, “Single machine due‐date scheduling of jobs with decreasing start‐time dependent processing times,” International Transactions in, 2005.
• S. Lin, S. Chou, and S. Chen, “Meta-heuristic approaches for minimizing total earliness and tardiness penalties of single-machine scheduling with a common due date,” Journal of Heuristics, 2007.
• K.-C. Ying, “Minimizing earliness–tardiness penalties for common due date single-machine scheduling problems by a recovering beam search algorithm,” Computers & Industrial Engineering, vol. 55, no. 2, pp. 494–502, 2008.
• A. C. Nearchou, “A differential evolution approach for the common due date early/tardy job scheduling problem,” Computers and Operations Research, vol. 35, no. 4, pp. 1329–1343, 2008.
• 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.
• 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.
• 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.
• M. Birman and G. Mosheiov, “A note on a due-date assignment on a two-machine flow-shop,” Computers and Operations Research, vol. 31, no. 3, pp. 473–480, 2004.
• 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.
• D. Shabtay and G. Steiner, “The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times,” Annals of Operations Research, vol. 159, no. 1, pp. 25–40, 2008.
• S. Li, C. T. Ng, and J. Yuan, “Group scheduling and due date assignment on a single machine,” International Journal of Production Economics, vol. 130, no. 2, pp. 230–235, 2011.
• S. Li, C. Ng, and J. Yuan, “Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine,” International Journal of Production Economics, 2011.
• R. Zhang and C. Wu, “A hybrid local search algorithm for scheduling real-world job shops with batch-wise pending due dates,” Engineering Applications of Artificial Intelligence, 2012.
• Y. Yin, T. C. E. Cheng, D. Xu, and 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 & Industrial Engineering, vol. 63, no. 1, pp. 223–234, 2012.
• Y. Yin, T. C. E. Cheng, S. R. Cheng, and C. C. Wu, “Single-machine batch delivery scheduling with an assignable common due date and controllable processing times,” Computers and Industrial Engineering, vol. 65, no. 4, pp. 652–662, Apr. 2013.
• G. Mosheiov and A. Sarig, “Scheduling with a common due-window: Polynomially solvable cases,” Information Sciences, vol. 180, no. 8, pp. 1492–1505, 2010.
• T. C. E. Cheng, S. J. Yang, and D. L. Yang, “Common due-window assignment and scheduling of linear time-dependent deteriorating jobs and a deteriorating maintenance activity,” International Journal of Production Economics, vol. 135, no. 1, pp. 154–161, 2012.
• M. Ji, J. Ge, K. Chen, and T. C. E. Cheng, “Single-machine due-window assignment and scheduling with resource allocation, aging effect, and a deteriorating rate-modifying activity,” Computers and Industrial Engineering, vol. 66, no. 4, pp. 952–961, 2013.
• J. Wang, X. Fan, C. Zhang, and S. Wan, “A graph-based ant colony optimization approach for integrated process planning and scheduling,” Chinese Journal of Chemical Engineering, vol. 22, no. 7, pp. 748–753, 2014.
• M. Ji, K. Chen, J. Ge, and T. Cheng, “Group scheduling and job-dependent due window assignment based on a common flow allowance,” Computers & Industrial Engineering, 2014.
• D. Yang, C. Lai, and S. Yang, “Scheduling problems with multiple due windows assignment and controllable processing times on a single machine,” International Journal of Production Economics, 2014.
• C. Zhao and H. Tang, “A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity,” Computers and Operations Research, vol. 39, no. 6, pp. 1300–1303, 2012.