A Heuristic Method to Minimize Total Weighted Number of Tardy Jobs and Transportation Costs for an Integrated Production and Distribution Problem with VRP

Document Type : Original Article

Authors

1 M.s. Student, Faculty of Industrial Engineering Department, Isfahan University of Technology, Isfahan, Iran

2 Associate Professor, Faculty of Industrial Engineering Department, Isfahan University of Technology, Isfahan, Iran

3 Assistant Professor, Faculty of Industrial Engineering Department, Isfahan University of Technology, Isfahan, Iran

Abstract

In this paper an integrated production and outbound distribution scheduling (IPODS) with vehicle routing problem (VRP) for multi customer situation in a supply chain is addressed. There are K orders (jobs) that have to be scheduled on a single machine and delivered to K customers. Each order has its own due date. The manufacturer delivers the orders in batches which have no capacity constraint. Delivering the products in batches reduces the delivery cost but it may increase the number of tardy jobs. No other research has been conducted on this problem yet. This problem is strongly NP-Hard. The objective is to minimize the sum of the total weighted number of tardy jobs and delivery costs. Also, in this paper, an MILP model and a Heuristic Algorithm (HA) for solving this problem are presented. Full factorial Computational test is performed for evaluation of these two methods. The obtained results on 3840 problems show that the heuristic algorithm is efficient for solved problem. Also we surveyed parameter's levels effect on CPLEX and heuristic performance by analysis of variance.

Keywords

References

[1]       M. Kolyaei, A. Azar, M. Amini, and A. Rajabzadeh Gatari, Design of integrated mathematical model for closed-loop supply chain, Management Research in Iran, 2016, vol. 20, pp. 1-32.
[2]       a. azar, l. Mortazavi, and m. m. abbasi, Conceptualization of quality in supply chain management by using Repertory Grid method (Case study : companies in Zanjan specialized zinc industrial town), Organizational Resources Management Researches,2017, vol. 7, pp. 1-19.
[3]       Viergutz, C. Integrated Production and Distribution Scheduling. Thesis, University of Osnabrück, Deutschland, 2011.
[4]       Zahra Azadehranjbar, Ali Bozorgi-Amiri. Supply Chain Redesign with Routing Consideration, Modern Researches in Descision Making, vol. 2, pp. 1-23, 2017.
[5]       Rasti-Barzoki, M., Integrated Due Date Assignment, Resource Allocation and Production and Outbound Distribution Scheduling in Supply Chain.  Ph.D. thesis, Isfahan University of Technology. 2011.
[6]       Rasti-Barzoki, M., Hejaz, S.R.., Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains. European Journal of Operational Research. Vol. 228,2013,  pp. 345–357.
[7]       Thomas, D. J., & Griffin, P. M., Coordinated supply chain management. European Journal of Operational Research, 94,1996, 1–15.
[8]       Rasti-Barzoki, M., Hejazi, S.R., Mazdeh, M.M., A Branch and Bound Algorithm to Minimize the Total Weighed Number of Tardy Jobs and Delivery Costs, Applied Mathematical Modeling, 37, 2013, 4924–4937.
[9]       Hall N.G., Potts C.N., Supply Chain Scheduling: Batching And Delivery. Operations Research, Vol. 51, No. 4, 2003, pp. 566-584.
[10]    R.M. Hallah, R.L. Bulfin, Minimizing the Weighted Number of Tardy Jobs on a Single Machine. European Journal of Operational Research, Vol. 145,2003,  pp. 45–56.
[11]    Taghavifard, M., Sheikh, K., Shahsavari, A., Modified ant colony algorithm for the vehicle routing problem with time windows. ,International journal of industrial engineering and production management, Vol. 20, No. 2,2009, pp. 23-30.
[12]    Rasti-Barzoki, M., Hejazi, S. R., Mahdavi, M. M., An FPTAS for minimizing the weighted number of tardy jobs with group due date assignment, resource allocation and distribution planning in supply chain, International journal of industrial engineering and production management,2013,  In Press.
[13]    Sarmiento, A. M., R. Nagi., A review of integrated analysis of production-distribution systems. IIE Trans. Vol. 31, 1999,  pp. 1061–1074.
[14]    Erenguc, S. S., N. C. Simpson, A. J. Vakharia. Integrated production/distribution planning in supply chains: An invited review.European Journal of Operational Research, Vol. 115, 1999, pp. 219–236.
[15]    Bilgen, B., I. Ozkarahan. Strategic tactical and operational production-distribution models: A review. Internat. Journal of Technology Management, Vol. 28, 2004, pp. 151–171.
[16]    Chen Z-L. Integrated Production And Outbound Distribution Scheduling: Review and Extensions. Operations Research, Vol. 58, No. 1, 2010, pp. 130-148.
[17]    Li, C.-L., G. Vairaktarakis, C.-Y. Lee. Machine scheduling with deliveries to multiple customer locations. European Journal of Operational Research, Vol. 164, 2005a, pp. 39–51.
[18]    Amstrong, R., S. Gao, L. Lei. A zero-inventory production and distribution problem with a fixed customer sequence. Annals of Operations Research, Vol. 159, 2008, pp. 395–414.
[19]    Devapriya, P., W. Ferrell, N. Geismar. Optimal fleet size of an integrated production and distribution scheduling problem for a perishable product. A Thesis Presented to The Graduate School of Clemson University, Clemson, SC. 2006.
[20]    Li, C.-L., G. Vairaktarakis, C.-Y. Lee. Machine scheduling with deliveries to multiple customer locations. European Journal of Operational Research, Vol. 164, 2005a, pp. 39–51.
[21]    A. Mensendiek, J. N. Gupta, and J. Herrmann, Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness, European Journal of Operational Research, vol. 243, 2009, pp. 514-522.
[22]    Rasti-Barzoki, M., Minimizing the weighted number of tardy jobs with group due date assignment and capacity-constrained deliveries.  International journal of industrial engineering and production management, In Press.
[23]    Ullrich, C.A. Integrated machine scheduling and vehicle routing with time windows.” European Journal of Operational Research ,http://dx.doi.org/10.1016/j.ejor.2 012.11.049. 2013, pp. 152-165.
[24]    A. Condotta, S. Knust, D. Meier, and N. V. Shakhlevich, Tabu search and lower bounds for a combined production–transportation problem, Computers & Operations Research, vol. 40, 2013, pp. 886-900.
[25]    W. Zhong, An improved algorithm for integrated production and distribution scheduling problem with committed delivery dates," Optimization Letters, vol. 9, 2015,  pp. 537-567.
[26]    K. Li, C. Zhou, J. Y. Leung, and Y. Ma, Integrated production and delivery with single machine and multiple vehicles, Expert Systems with Applications, vol. 57, 2016,  pp. 12-20.
[27]    Pinedo, M., L.,  Scheduling: Theory, Algorithm, and system. 3rd. Ed. Springer Science and Business Media, New york.2008.
[28]    Rabadi, G., Mollaghasemi, M., Anagnostopoulos, G.C.,  A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time.” Computers and Operations Research, Vol. 31, 2004, pp. 1727–1751.

Files

Share

How to cite

Statistics