Sequencing deliveries to minimize inventory holding cost with dominant upstream supply chain partner

Abstract

This paper studies a two stage supply chain with a dominant upstream partner. Manufacturer is the dominant partner and operates in a Just-in-Time environment. Production is done in a single manufacturing line capable of producing two products without stopping the production for switching from one product to the other. The manufacturer imposes constraints on the distributor by adhering to his favorable production schedule which minimizes his manufacturing cost. Distributor on the other hand caters to retailers’ orders without incurring any shortages and is responsible for managing the inventory of finished goods. Adhering to manufacturer’s schedule may lead to high inventory carrying costs for the distributor. Distributor’s problem, which is to find an optimal distribution sequence which minimizes the distributor’s inventory cost under the constraint imposed by the manufacturer is proved NP-Hard by Manoj et al. (2008). Therefore, solving large size problems require efficient heuristics. We develop algorithms for the distribution problem by exploiting its structural properties. We propose two heuristics and use their solutions in the initial population of a genetic algorithm to arrive at solutions with an average deviation of less than 3.5% from the optimal solution for practical size problems.

Keywords

Supply chain scheduling / production and distribution system / logistics / genetic algorithm / optimized cross over

References

[1] Aggarwal C., Orlin J.B., Tai R.P.. Optimized crossover for the independent set problem. Operations Research, 1997, 45: 226-234.

[2] Agnetis A., Hall N.G., Pacciarelli D.. Supply chain scheduling: sequence coordination. Discrete Applied Mathematics, 2006, 154: 2044-2063.

[3] Blumenfeld D.E., Burns L.D., Daganzo C.F.. Synchronizing production and transportation schedules. Transportation Research B, 1991, 25: 23-37.

[4] Cachon G.. Supply chain coordination with contracts. Handbooks in Operations Research and Management Science: Supply Chain Management, 2003, 11: 229-340.

[5] Carter M.W., Farvolden J.M., Laporte G., Xu J.. Solving an integrated logistics problem arising in grocery distribution. INFOR, 1996, 34: 290-306.

[6] Chandra P., Fisher M.L.. Coordination of production and distribution planning. European Journal of Operational Research, 1994, 72: 503-517.

[7] Chang Y.C., Lee C.Y.. Logistics scheduling: analysis of two-stage problems. Journal of Systems Science and Systems Engineering, 2003, 12: 385-407.

[8] Chao I.M., Golden B.L., Wasil E.A.. An improved heuristic for the period vehicle routing problem. Networks, 1995, 26: 25-44.

[9] Chen Z.L., Hall N.G.. Supply chain scheduling: Conflict and cooperation in assembly systems. Operations Research, 2007, 55: 1072-1089.

[10] Chen Z.L., Vairaktarakis G.L.. Integrated scheduling of production and distribution operations. Management Science, 2005, 51: 614-628.

[11] Christofides N., Beasley J.E.. The period routing problem. Networks, 1984, 14: 237-256.

[12] Chung H.K., Norback J.P.. A clustering and insertion heuristic applied to a large routing problem in food distribution. Journal of the Operational Research Society, 1991, 42: 555-564.

[13] Cordeau J.F., Gendreau M., Laporte G.. A Tabu search heuristic for periodic and multi depot vehicle routing problems. Networks, 1997, 30: 105-119.

[14] Dawande M., Geismar H.N., Hall N.G., Sriskandarajah C.. Supply chain scheduling: distribution systems. Production and Operations Management, 2006, 15: 243-261.

[15] Defee, C. (2007). Is your company a supply chain leader? Industry Week, April 18

[16] Dong Y., Shankar V., Dresner M.. Efficient replenishment in the distribution channel. Journal of Retailing, 2007, 83(2): 253-278.

[17] Fisher M.L., Jaikumar R.. A generalized assignment heuristic for vehicle routing. Networks, 1981, 11: 109-124.

[18] Gardner. (1997). Production puzzle: Toyota rolls cars and minivans down the same line. The’ 98s Ward’s Auto World, October

[19] Gaudioso M., Paletta G.. A heuristic for the periodic vehicle routing problem. Transportation Science, 1992, 26: 86-92.

[20] Hadjiconstantinuo E., Baldacci R.. A multi-depot period vehicle routing problem arising in the utilities sector. Journal of Operations Research Society, 1998, 49: 1239-1248.

[21] Hall N.G., Potts C.N.. Supply chain scheduling: batching and delivery. Operations Research, 2003, 51: 566-584.

[22] Lau A.H.L., Lau H.S., Zhou Y.W.. A stochastic and asymmetricinformation framework for a dominantmanufacturer supply chain. European Journal of Operational Research, 2007, 176(1): 295-316.

[23] Lau A.H.L., Lau H.S., Wang J.C.. Pricing and volume discounting for a dominant retailer with uncertain manufacturing cost information. European Journal of Operational Research, 2007, 183(2): 848-870.

[24] Lee C.Y., Chen Z.L.. Machine scheduling with transportation considerations. Journal of Scheduling, 2001, 4: 3-2.

[25] Li C.L., Xiao W.Q.. Lot streaming with supplier-manufacturer coordination. Naval Research Logistics, 2004, 51: 522-542.

[26] Manoj U.V., Gupta J.N.D., Gupta S., Sriskandarajah C.. Supply chain scheduling: Just In Time environment. Annals of Operations Research, 2008, 161: 53-86.

[27] Nissan News. (2005). Available via DIALOG. http://www.nissannews.com/corporate/news/2005speeches/20050616120231.shtml

[28] Parthanadee P., Logendran R.. Periodic product distribution from multi-depots under limited supplies. IIE Transactions, 2005, 38: 1009-1026.

[29] Plewes, A. (2004). Collaboration: the supply chain reaction. Silicon. Com, June 25

[30] Russell R.A., Gribbin D.. A multiphase approach to the period routing problem. Networks, 1991, 21: 747-765.

[31] Sarmiento A.M., Nagi R.. A review of integrated analysis of productiondistribution systems. IIE Transactions, 1999, 31: 1061-1074.

[32] Taylor T.A.. Sale timing in a supply chain: when to sell to the retailer. Manufacturing and Service Operations Management, 2006, 8(1): 23-42.

[33] Vianna D.S., Ochi L.S., Drummond L.M.A.. A parallel hybrid evolutionary heuristics for the period vehicle routing problem. Lecture Notes in Computer Science, 1999, 1586: 183-191.

[34] Xia Y., Gilbert S.M.. Strategic interactions between channel structures and emand enhancing services. European Journal of Operational Research, 2007, 181(1): 252-265.

[35] Yang W.T., Chu L.C.. A heuristic algorithm for the multidepot periodic vehicle routing problem. Journal of Information & Optimization Sciences, 2000, 22: 359-367.