Capacitated production and subcontracting in a serial supply chain

This paper extends a series of recent results regarding the polynomial solvability of single and two-echelon deterministic lot sizing models. In particular, we consider a two-echelon supply chain in which production, inventory, transportation, backlogging, and subcontracting decisions are integrated. We allow for arbitrary concave cost functions and for stationary production and subcontracting capacities. We develop dynamic programming algorithms for various problems in this class that run in polynomial time in the planning horizon of the problem.

[1]  J. K. Lenstra,et al.  Deterministic Production Planning: Algorithms and Complexity , 1980 .

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

[3]  Alok Aggarwal,et al.  Improved Algorithms for Economic Lot Size Problems , 1993, Oper. Res..

[4]  Apm Wagelmans,et al.  Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions , 1994 .

[5]  Alper Atamtürk,et al.  Capacity Acquisition, Subcontracting, and Lot Sizing , 2001, Manag. Sci..

[6]  Albert P. M. Wagelmans,et al.  An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem , 2006, Comput. Oper. Res..

[7]  Chien-Hua M. Lin,et al.  An OT2 Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem , 1988 .

[8]  Albert P. M. Wagelmans,et al.  An $O(T^3)$ algorithm for the economic lot-sizing problem with constant capacities , 1993 .

[9]  Awi Federgruen,et al.  A simple forward algorithm to solve general dynamic lot sizing models with n periods in O(n logn) or , 1991 .

[10]  Albert P. M. Wagelmans,et al.  Integrated Lot Sizing in Serial Supply Chains with Production Capacities , 2005, Manag. Sci..

[11]  Lap Mui Ann Chan,et al.  On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures , 2002, Oper. Res..

[12]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[13]  G. Bitran,et al.  Computational Complexity of the Capacitated Lot Size Problem , 1982 .

[14]  M. Florian,et al.  DETERMINISTIC PRODUCTION PLANNING WITH CONCAVE COSTS AND CAPACITY CONSTRAINTS. , 1971 .

[15]  A. Federgruen,et al.  A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0n log n or 0n Time , 1991 .

[16]  Albert P. M. Wagelmans,et al.  Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case , 1992, Oper. Res..

[17]  W. Zangwill.  A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System---A Network Approach , 1969 .

[18]  W. Zangwill.  Minimum Concave Cost Flows in Certain Networks , 1968 .

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

[20]  Lap Mui Ann Chan,et al.  Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures , 2002, Manag. Sci..