Conventionally, process planning, scheduling, and due-date assignment functions are performed separately and sequentially. The interdependence of these functions requires integration. Although integrated process planning and scheduling, and scheduling with due date assignment problems are popular research topics, only a few works address the integration of these three functions. This work focuses on the integration of process planning, WMS scheduling, and WPPW due date assignment. Another novelty of this work is the use of a weighted due date assignment. In the literature, due dates are generally assigned without considering the importance of customers. However, in this study, more important customers get closer due dates. Typically, only tardiness is punished, but the JIT philosophy punishes both earliness and tardiness. In this study, all weighted earliness, tardiness, and due date related costs are penalized. As no customer desires distant due dates, such distant due dates should be penalized. In this study, various levels of integration of these three functions are tested and genetic search and random search are compared both with each other and with ordinary solutions. Higher integration levels are superior, while search is always useful. Genetic searches outperformed random searches.<\/p>\r\n","references":"[1]\tH. C. Zhang, S. Mallur, \u201cAn Integrated Model of Process Planning and Production Scheduling,\u201d International Journal of Computer Integrated Manufacturing, vol. 7, no. 6, pp. 356-364, 1994.\r\n[2]\tV. Gordon, J.M. Proth, C. Chu, \u201cA survey of the state-of-the-art of common due date assignment and scheduling research,\u201d European Journal of Operational Research, vol. 139, pp. 1-25, 2002.\r\n[3]\tW. Tan, B. Khoshnevis, \u201cIntegration of process planning and scheduling \u2013 a review,\u201d Journal of Intelligent Manufacturing, 11, no. 1, 51-63, 2000.\r\n[4]\tX. Li, L. Gao, C. Zhang and X. Shao, \u201cA review on integrated process planning and scheduling,\u201d International Journal of Manufacturing Research, vol. 5, no. 2, pp. 161-180, 2010.\r\n[5]\tR. K. Phanden, A. Jaina, R. Verma, \u201cIntegration of process planning and scheduling: a state-of-the-art review,\u201d International Journal of Computer Integrated Manufacturing, vol. 24, no. 6, pp. 517-534, 2011.\r\n[6]\tN. Nasr, E. A. Elsayed, \u201cJob shop scheduling with alternative machines,\u201d International Journal of Production Research, vol. 28, no. 9, pp. 1595-1609, 1990.\r\n[7]\tB. Khoshnevis, Q. M. Chen, \u201cIntegration of Process Planning and Scheduling Functions,\u201d Journal of Intelligent Manufacturing, vol. 2, no. 3, pp. 165-175, 1991.\r\n[8]\tJ. Hutchinson, K. Leong, D. Snyder, P. Ward, \u201cScheduling Approaches for Random Job Shop Flexible Manufacturing Systems,\u201d International Journal of Production Research, vol. 29, no. 5, pp. 1053-1067, 1991.\r\n[9]\tJ. Jiang, M. Y. Chen, \u201cThe Influence of Alternative Process Planning in Job Shop Scheduling,\u201d Computers and Industrial Engineering, vol. 25, no. 1-4, pp. 263-267, 1993.\r\n[10]\tQ. Chen, B. Khoshnevis, \u201cScheduling with Flexible Process Plans,\u201d Production Planning & Control, vol. 4, no. 4, pp. 333- 343, 1993.\r\n[11]\tP. Brandimart, \u201cExploiting process plan flexibility in production scheduling: A multi-objective approach,\u201d European Journal of Operational Research, vol. 114, no. 1, pp. 59-71, 1999.\r\n[12]\tK. H. Kim, P. J. Egbelu, \u201cScheduling in a production environment with multiple process plans per job,\u201d International Journal of Production Research, vol. 37, no. 12, pp. 2725-2753, 1999.\r\n[13]\tN. Morad, A. Zalzala, \u201cGenetic algorithms in integrated process planning and scheduling,\u201d Journal of Intelligent Manufacturing, vol. 10, no. 2, pp. 169-179, 1999.\r\n[14]\tX. G. Ming, K. L. Mak, \u201cA hybrid Hopfield-genetic algorithm approach to optimal process plan selection,\u201d International Journal of Production Research, vol. 38, no. 8, pp. 1823-1839, 2000.\r\n[15]\tH. Lee, S. S. Kim, \u201cIntegration of process planning and scheduling using simulation based genetic algorithms,\u201d International Journal of Advanced Manufacturing Technology, vol. 18, no. 8, pp. 586-590, 2001.\r\n[16]\tY. K. Kim, K. Park, J. Ko, \u201cA symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling,\u201d Computers and Operations Research, vol. 30, no. 8, pp. 1151-1171, 2003.\r\n[17]\tM. Kumar, S. Rajotia, \u201cIntegration of scheduling with computer aided process planning,\u201d Journal of Materials Processing Technology, vol. 138, no. 1-3, pp. 297-300, 2003.\r\n[18]\tJ. M. Usher, \u201cEvaluating the impact of alternative plans on manufacturing performance,\u201d Computers and Industrial Engineering, vol. 45, no. 4, pp. 585-596, 2003.\r\n[19]\tM. K. Lim, D.Z. Zhang, \u201cAn integrated agent-based approach for responsive control of manufacturing resources,\u201d Computers and Industrial Engineering, vol. 46, no. 2, pp. 221-232, 2004.\r\n[20]\tW. Tan, B. Khoshnevis, \u201cA linearized polynomial mixed integer programming model for the integration of process planning and scheduling,\u201d Journal of Intelligent Manufacturing, vol. 15, no. 5, pp. 593-605, 2004.\r\n[21]\tM. Kumar, S. Rajotia, \u201cIntegration of process planning and scheduling in a job shop environment,\u201d The International Journal of Advanced Manufacturing Technology, vol. 28, no. 1-2, pp. 109-116, 2006.\r\n[22]\tK. Ueda, N. Fujii, R. Inoue, \u201cAn emergent synthesis approach to simultaneous process planning and scheduling,\u201d CIRP Annals- Manufacturing Technology, vol. 56, no. 1, pp. 463-466, 2007.\r\n[23]\tC. Moon, Y. H. Lee, C. S. Jeong, Y. Yun, \u201cIntegrated process planning and scheduling in a supply chain,\u201d Computers and Industrial Engineering, vol. 54, no. 4, pp. 1048-1061, 2008.\r\n[24]\tY. W. Guo, W. D. Li, A. R. Mileham, G. W. Owen, \u201cOptimization of integrated process planning and scheduling using a particle swarm optimization approach,\u201d International Journal of Production Research, vol. 47, no. 4, pp. 3775-3796, 2009.\r\n[25]\tC. W. Leung, T. N. Wong, K. L. Mak, R. Y. K. Fung, \u201cIntegrated process planning and scheduling by an agent-based ant colony optimization,\u201d Computers and Industrial Engineering, 59, no. 1, pp. 166-180, 2010.\r\n[26]\tH.I. Demir, T. Cakar, M. Ipek, O. Uygun, M. Sari, \u201cProcess planning and Due date assignment with ATC Dispatching where Earliness, Tardiness and Due dates are punished,\u201d Journal of Industrial and Intelligent Information, vol. 3, no. 3, pp. 197\u2013204, 2015.\r\n[27]\tS.S. Panwalker, M.L. Smith, A. Seidmann, \u201cCommon due date assignment to minimize total penalty for the one machine scheduling problem,\u201d Operations Research, vol. 30, pp. 391-399, 1982.\r\n[28]\tV. Gordon, W. Kubiak, \u201cSingle machine scheduling with release and due date assignment to minimize the weighted number of late jobs,\u201d Information Processing Letters, vol. 68, pp. 153-159, 1998.\r\n[29]\tD. Biskup, H. Jahnke, \u201cCommon due date assignment for scheduling on a single machine with jointly reducible processing times,\u201d International Journal of Production Economics, vol. 69, pp. 317-322, 2001.\r\n[30]\tT.C.E. Cheng, Z. L. Chen, N.V. Shakhlevich, \u201cCommon due date assignment and scheduling with ready times,\u201d Computers and Operations Research, vol. 29, pp. 1957-1967, 2002.\r\n[31]\tJ.A. Ventura, S. Radhakrishnan, \u201cSingle machine scheduling with symmetric earliness and tardiness,\u201d European Journal of Operational Research, vol. 144, pp. 598-612, 2003.\r\n[32]\tT. C. E. Cheng, L. Y. Kang, C. T. Ng, \u201cSingle machine due-date scheduling of jobs with decreasing start-time dependent processing times,\u201d International Transactions In Operational Research, vol. 12, no. 3, pp. 355-366, May 2005.\r\n[33]\tJ. B. Wang, \u201cSingle machine scheduling with common due date and controllable processing times,\u201d Applied Mathematics and Computation, vol. 174, no. 2, pp. 1245-1254, 2006.\r\n[34]\tS.W. Lin, S.Y. Chou, S.C. Chen, \u201cMeta-heuristic approaches for minimizing total earliness and tardiness penalties of single-machine scheduling with a common due date,\u201d Journal of Heuristics, vol. 13, pp. 151-165, 2007.\r\n[35]\tK.C. Ying, \u201cMinimizing earliness\u2013tardiness penalties for common due date single-machine scheduling problems by a recovering beam search algorithm,\u201d Computers & Industrial Engineering, vol. 55, no. 2, pp. 494-502, 2008.\r\n[36]\tA.C. Nearchou, \u201cA differential evolution approach for the common due date early\/tardy job scheduling problem,\u201d Computers & Operations Research, vol. 35, pp. 1329-1343, 2008.\r\n[37]\tY. Xia, B. Chen, J. Yue, \u201cJob sequencing and due date assignment in a single machine shop with uncertain processing times,\u201d European Journal of Operational Research, vol. 184, pp. 63-75, 2008.\r\n[38]\tV. S. Gordon, V. A. Strusevich, \u201cSingle machine scheduling and due date assignment with positionally dependent processing times,\u201d European Journal of Operational Research, vol. 198, no. 1, pp. 57-62, October 2009.\r\n[39]\tJ. Li, X. Yuan, E.S. Lee, D. Xu, \u201cSetting due dates to minimize the total weighted possibilistic mean value of the weighted earliness\u2013tardiness costs on a single machine,\u201d Computers & Mathematics with Applications, vol. 62, no. 11, pp. 4126-4139, 2011.\r\n[40]\tG.I. Adamopoulos, C.P. Pappis, \u201cScheduling under a common due-date on parallel unrelated machines,\u201d European Journal of Operational Research, vol. 105, pp. 494-501, 1998.\r\n[41]\tT.C.E. Cheng, M.Y. Kovalyov, \u201cComplexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness,\u201d European Journal of Operational Research, vol. 114, pp. 403-410, 1999.\r\n[42]\tG. Mosheiov, G, \u201cA common due-date assignment problem on parallel identical machines,\u201d Computers and Operations Research, vol. 28, pp. 719-732, 2001.\r\n[43]\tM. Birman, G. Mosheiov, \u201cA note on a due-date assignment on a two-machine flow-shop,\u201d Computers and Operations Research, vol. 31, pp. 473-480, 2004.\r\n[44]\tV. Lauff, F. Werner, \u201cScheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey,\u201d Mathematical and Computer Modelling, vol. 40, pp. 637-655, 2004.\r\n[45]\tH. Allaoua, I. Osmane, \u201cVariable Parameters Lengths Genetic Algorithm for Minimizing Earliness-Tardiness Penalties of Single Machine Scheduling with a Common Due Date,\u201d Electronic Notes in Discrete Mathematics, vol. 36, no. 1, pp. 471-478, 2010.\r\n[46]\tS. Yang, D.L. Yang, T.C.E. Cheng, \u201cSingle-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance,\u201d Computers & Operations Research, vol. 37, no. 8, pp. 1510-1514, 2010.\r\n[47]\tN. H. Tuong and A. Soukhal, \u201cDue dates assignment and JIT scheduling with equal-size jobs,\u201d European Journal of Operational Research, vol. 205, no. 2, pp. 280-289, September 2010.\r\n[48]\tJ. Li, K. Sun, D. Xu, H. Li, \u201cSingle machine due date assignment scheduling problem with customer service level in fuzzy environment,\u201d Applied Soft Computing, vol. 10, no. 3, pp. 849-858, 2010.\r\n[49]\tD. Shabtay, \u201cScheduling and due date assignment to minimize earliness, tardiness, holding, due date assignment and batch delivery costs,\u201d International Journal of Production Economics, vol. 123, no. 1, pp. 235-242, 2010.\r\n[50]\tS. Li, C.T. Ng, J. Yuan, \u201cGroup scheduling and due date assignment on a single machine,\u201d International Journal of Production Economics, vol. 130, no. 2, pp. 230-235, 2011.\r\n[51]\tV. Vinod, R. Sridharan, \u201cSimulation modeling and analysis of due-date assignment methods and scheduling decision rules in a dynamic job shop production system,\u201d International Journal of Production Economics, vol. 129, no. 1, pp. 127-146, 2011.\r\n[52]\tS. Li, C.T. Ng, J. Yuan, \u201cScheduling deteriorating jobs with CON\/SLK due date assignment on a single machine,\u201d International Journal of Production Economics, vol. 131, no. 2, pp. 747-751, 2011.\r\n[53]\tR. Zhang, C. Wu, \u201cA hybrid local search algorithm for scheduling real-world job shops with batch-wise pending due dates,\u201d Engineering Applications of Artificial Intelligence, vol. 25, no. 2, pp. 209-221, 2012.\r\n[54]\tY. Yin, S.R. Cheng, T.C.E. Cheng, C.C. Wu, W.H. Wu, \u201cTwo-agent single-machine scheduling with assignable due dates,\u201d Applied Mathematics and Computation, vol. 219, no. 4, pp. 1674-1685, 2012.\r\n[55]\tY. Yin, T.C.E. Cheng, C.C. Wu, W.H. Wu, \u201cCommon due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost,\u201d Computers & Industrial Engineering, vol. 63, no. 1, pp. 223-234, 2012.\r\n[56]\tM. Iranpoor, S.M.T. Fatemi Ghomi, M. Zandieh, \u201cDue-date assignment and machine scheduling in a low machine-rate situation with stochastic processing times,\u201d Computers & Operations Research, vol. 40, no. 4, pp. 1100-1108, 2013.\r\n[57]\tY. Yin, S.R. Cheng, T.C.E. Cheng, C.C. Wu, W.H. Wu, \u201cSingle-machine batch delivery scheduling with an assignable common due date and controllable processing times,\u201d Computers & Industrial Engineering, vol. 65, no. 4, pp. 652-662, 2013.\r\n[58]\tH.I. Demir, H. Taskin, Integrated Process Planning, Scheduling and Due-Date Assignment, PhD Thesis, Sakarya University, 2005.\r\n[59]\tE. Ceven, H.I. Demir, Benefits of Integrating Due-Date Assignment with Process Planning and Scheduling, Master of Science Thesis, Sakarya University, 2007.\r\n[60]\tH.I. Demir, O. Uygun, I. Cil, M. Ipek, M. Sari, \u201cProcess Planning and Scheduling with SLK Due-Date Assignment where Earliness, Tardiness and Due-Dates are Punished,\u201d Journal of Industrial and Intelligent Information, vol. 3, no. 3, pp. 173\u2013180, 2015.","publisher":"World Academy of Science, Engineering and Technology","index":"Open Science Index 115, 2016"}