Tractable supply chain production planning, modeling nonlinear lead time and quality of service constraints

被引:11
作者
Anli, Osman Murat [1 ]
Caramanis, Michael C. [2 ,3 ]
Paschalidis, Ioannis Ch. [2 ,3 ]
机构
[1] Isik Univ, Dept Ind Engn, TR-34980 Istanbul, Turkey
[2] Boston Univ, CISE, Boston, MA 02215 USA
[3] Boston Univ, Dept Mfg Engn, Boston, MA 02215 USA
关键词
D O I
10.1016/j.jmsy.2008.05.001
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper addresses the task of coordinated planning of a supply chain (SC). Work in process (WIP) in each facility participating in the SC, finished goods inventory, and backlogged demand costs are minimized over the planning horizon. In addition to the usual modeling of linear material flow balance equations, variable lead time (LT) requirements, resulting from the increasing incremental WIP as a facility's utilization increases, are also modeled. In recognition of the emerging significance of quality of service (QoS), that is control of stockout probability to meet demand on time, maximum stockout probability constraints are also modeled explicitly. Lead time and QoS modeling require incorporation of nonlinear constraints in the production planning optimization process. The quantification of these nonlinear constraints must capture statistics of the stochastic behaviour of production facilities revealed during a time scale for shorter than the customary weekly time scale of the planning process. The apparent computational complexity of planning production against variable LT and QoS constraints has long resulted in MRP-based scheduling practices that ignore the LT and QoS constraints has long resulted in MRP-based scheduling practices that ignore the LT and QoS impact to the plan's detriment. The computational complexity challenge was overcome by proposing and adopting a time-scale decomposition approach to production planning where short-time-scale stochastic dynamics are modeled in multiple facility-specific subproblems that receive tentative targets from a deterministic master problem and return statistics to it. A converging and scalable iterative methodology is implemented, providing evidence that significantly lower cost production plans are achievable in a computationally tractable manner. (C) 2008 The Society of Manufacturing Engineers. Published by Elsevier Ltd All rights reserved.
引用
收藏
页码:116 / 134
页数:19
相关论文
共 57 条
[1]  
ANLI OM, 2002, ITERATIVE APPROXIMAT
[2]  
ANLI OM, 2003, THESIS BOSTON U CTR
[3]  
[Anonymous], N HOLLAND TIMS STUDI, DOI DOI 10.1016/S1570-7946(09)70240-8
[4]   Tractable nonlinear production planning models for semiconductor wafer fabrication facilities [J].
Asmundsson, J ;
Rardin, RL ;
Uzsoy, R .
IEEE TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING, 2006, 19 (01) :95-111
[5]  
BARD Y, 1979, PERFORMANCE COMPUTER
[6]  
Bertsekas D.P., 2005, DYNAMIC PROGRAMMING, V1
[7]  
Bertsekas DP, 1995, Dynamic Programming and Optimal Control, V2
[8]   Probabilistic service level guarantees in make-to-stock manufacturing systems [J].
Bertsimas, D ;
Paschalidis, IC .
OPERATIONS RESEARCH, 2001, 49 (01) :119-133
[9]   OPTIMIZATION OF MULTICLASS QUEUEING NETWORKS: POLYHEDRAL AND NONLINEAR CHARACTERIZATIONS OF ACHIEVABLE PERFORMANCE [J].
Bertsimas, Dimitris ;
Paschalidis, Ioannis Ch. ;
Tsitsiklis, John N. .
ANNALS OF APPLIED PROBABILITY, 1994, 4 (01) :43-75
[10]  
BITRAN GR, 1993, LOGISTICS PRODUCTION, V4, pCH10