OPTIMIZATION MODELS FOR SOURCING DECISIONS IN SUPPLY CHAIN MANAGEMENT

of Dissertation Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy OPTIMIZATION MODELS FOR SOURCING DECISIONS IN SUPPLY CHAIN MANAGEMENT By Wei Huang August 2004 Chair: H. Edwin Romeijn Major Department: Industrial and Systems Engineering In this dissertation, we developed optimization models and algorithms for sourcing problems arising in supply chain management. We focused on problems in which a set of retailer demands needs to be assigned to either a set of production or storage facilities or a set of production resources in a dynamic environment. However, we first studied a much more general class of assignment problems (AP) in which we assume that the cost functions associated with assignments are separable in the agents, but otherwise arbitrary. We developed three solution methodologies for solving (AP), including a greedy heuristic, a very large-scale neighborhood search improvement algorithm, and a branch-and-price algorithm. We next studied three specific applications of (AP). In the first application, we considered the assignment of retailers to facilities over a discrete time horizon under dynamic demands and with a linear cost structure in the presence of constraints such as production capacity, throughput capacity, inventory capacity, and perishability. In the second application, we considered a continuous-time model in which the retailers face a constant demand rate, while each facility faces fixed-charge production costs. We derived a decreasing net revenue property that is satisfied by the optimal solution to (the linear relaxation of) an important subproblem, called the pricing problem, for a particular class of (AP). This class encompasses many variants of this application, including cases with production and inventory capacities, and cases with capacity expansion opportunities. In the third application we considered a manufacturer that has flexibility in meeting its demands, that is, each of its customers will accept product quantities within a specified range. We considered three different kinds of strategies, where we can stock raw materials only but produce just-in-time; stock only end products but acquire raw materials just-in-time; or stock both raw materials and end products. The pricing problem for this application is closely related to the so-called knapsack problem with expandable items, which we studied in detail and for which we developed new solution approaches. We performed extensive tests for all applications, and concluded that the developed heuristics usually produce very high quality solutions in limited time. CHAPTER

[1]  James B. Orlin,et al.  Theory of cyclic transfers , 1989 .

[2]  Awi Federgruen,et al.  Two-Echelon Distribution Systems with Vehicle Routing Costs and Central Inventories , 1993, Oper. Res..

[3]  Lap Mui Ann Chan,et al.  Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models , 1998, Oper. Res..

[4]  Shoshana Anily The general multi-retailer EOQ problem with vehicle routing costs , 1994 .

[5]  H. Edwin Romeijn,et al.  Logistics Network Design Evaluation in a Dynamic Environment , 1999 .

[6]  Dushyant Sharma,et al.  New neighborhood search structures for the capacitated minimum spanning tree problem , 1998 .

[7]  D. Myers,et al.  Meeting seasonal demand for products with limited shelf lives , 1997 .

[8]  R. Fahrion,et al.  On a Principle of Chain-exchange for Vehicle-routeing Problems (1-VRP) , 1990 .

[9]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[10]  Kamlesh Mathur,et al.  Integrating routing and inventory decisions in one-warehouse multiretailer multiproduct distribution systems , 1997 .

[11]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[12]  Z. Shen,et al.  Economic ordering decisions with market choice flexibility , 2004 .

[13]  David K. Smith Network Flows: Theory, Algorithms, and Applications , 1994 .

[14]  Maria Grazia Scutellà,et al.  A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems , 2004, J. Comb. Optim..

[15]  Albert P. M. Wagelmans,et al.  A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem , 1999, Oper. Res..

[16]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[17]  Dirk Cattrysse,et al.  A dual ascent and column generation heuristic for the discrete lotsizing and scheduling problem with setup times , 1993 .

[18]  F. Durán A large mixed integer production and distribution program , 1987 .

[19]  Guillermo Gallego,et al.  On the effectiveness of direct shipping strategy for the one-warehouse multi-retailer R -systems , 1990 .

[20]  A. M. Geoffrion,et al.  Multicommodity Distribution System Design by Benders Decomposition , 1974 .

[21]  Michael Thompson Paul Local search algorithms for vehicle routing and other combinatorial problems , 1988 .

[22]  Joseph Geunes,et al.  Production Planning with Flexible Product Specifications: An Application to Specialty Steel Manufacturing , 2003, Oper. Res..

[23]  H. Edwin Romeijn,et al.  A class of greedy algorithms for the generalized assignment problem , 2000, Discret. Appl. Math..

[24]  William L. Maxwell,et al.  Establishing Consistent and Realistic Reorder Intervals in Production-Distribution Systems , 1985, Oper. Res..

[25]  Ford W. Harris,et al.  How Many Parts to Make at Once , 1990, Oper. Res..

[26]  Abraham P. Punnen,et al.  A survey of very large-scale neighborhood search techniques , 2002, Discret. Appl. Math..

[27]  Terry P. Harrison,et al.  Global Supply Chain Management at Digital Equipment Corporation , 1995 .

[28]  Dolores Romero Morales,et al.  A probabilistic analysis of the multi-period single-sourcing problem , 2001, Discret. Appl. Math..

[29]  Chung-Yee Lee,et al.  Stock Replenishment and Shipment Scheduling for Vendor-Managed Inventory Systems , 2000 .

[30]  Martin E. Dyer,et al.  Probabilistic analysis of the generalised assignment problem , 1990, IPCO.

[31]  H. Edwin Romeijn,et al.  A Probabilistic Feasibility and Value Analysis of the Generalized Assignment Problem , 2000, J. Comb. Optim..

[32]  Dolores Romero Morales,et al.  Optimization Problems in Supply Chain Management , 2000 .

[33]  Michel Gendreau,et al.  Neighborhood Search Heuristics for a Dynamic Vehicle Dispatching Problem with Pick-ups and Deliveries , 2006 .

[34]  Ravindra K. Ahuja,et al.  Very large-scale neighborhood search , 2000 .

[35]  Paul M. Thompson,et al.  Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems , 1993, Oper. Res..

[36]  M. Trick A Linear Relaxation Heuristic for the Generalized Assignment Problem , 1992 .

[37]  B. Fleischmann Designing distribution systems with transport economies of scale , 1993 .

[38]  Philip M. Kaminsky,et al.  Production and Distribution Lot Sizing in a Two Stage Supply Chain , 2003 .

[39]  Martin W. P. Savelsbergh,et al.  A Branch-and-Price Algorithm for the Generalized Assignment Problem , 1997, Oper. Res..

[40]  H. Romeijn,et al.  Polynomial Time Algorithms for Some Multi-Level Lot-Sizing Problems with Production Capacities , 2002 .

[41]  Sila Çetinkaya,et al.  Optimal outbound dispatch policies: Modeling inventory and cargo capacity , 2002 .

[42]  H. Edwin Romeijn,et al.  Asymptotic Analysis of a Greedy Heuristic for the Multi-Period Single-Sourcing Problem: The Acyclic Case , 2004, J. Heuristics.

[43]  W. Maxwell,et al.  The Joint Replenishment Problem with a Powers-of-Two Restriction , 1985 .

[44]  H. Romeijn,et al.  An asymptotically optimal greedy heuristic for the multiperiod single‐sourcing problem: The cyclic case , 2003 .

[45]  Harvey M. Wagner,et al.  Dynamic Version of the Economic Lot Size Model , 2004, Manag. Sci..

[46]  Awi Federgruen,et al.  One warehouse multiple retailer systems with vehicle routing costs , 1990 .

[47]  R. Roundy 98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems , 1985 .

[48]  John M. Wilson,et al.  An Algorithm for the Generalized Assignment Problem with Special Ordered Sets , 2005, J. Heuristics.

[49]  D. Simchi-Levi,et al.  Probabilistic Analyses and Algorithms for Three-Level Distribution Systems , 1998 .