Optimal Planning of a Multi-Station System with Sojourn Time Constraints

This paper studies a dynamic production system where multiple products must visit stations where inventories are constrained by maximum and minimum sojourn times with neither negative flow nor backlog being allowed. A resource availability constraint limits the aggregate throughput of the stations. The objective is to minimize the sum of flow and inventory cost. The problem is broken down into several single-product serial systems that serve as subroutines of a Lagrangian relaxation routine. This model is implemented in a spreadsheet so that it can be used by the officials of a Chilean institution for planning the operations and defining the optimal allocation of resources.

[1]  B. Tan,et al.  A DECOMPOSITION MODEL FOR CONTINUOUS MATERIALS FLOW PRODUCTION SYSTEMS , 1997 .

[2]  James R. Bradley,et al.  The Simultaneous Planning of Production, Capacity, and Inventory in Seasonal Demand Environments , 1999, Oper. Res..

[3]  Allen C Miller,et al.  The Value of Sequential Information , 1975 .

[4]  Suresh P. Sethi,et al.  Optimal production planning in pull flow lines with multiple products , 1999, Eur. J. Oper. Res..

[5]  Marcos Singer,et al.  Decomposition methods for large job shops , 2001, Comput. Oper. Res..

[6]  Tayfur Altiok.  Tandem queues in bulk port operations , 2000, Ann. Oper. Res..

[7]  Yves Dallery,et al.  Manufacturing flow line systems: a review of models and analytical results , 1992, Queueing Syst. Theory Appl..

[8]  Danny Berry,et al.  Pipeline Information Survey: a UK Perspective , 1998 .

[9]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[10]  Patricio Donoso,et al.  Semi-autonomous planning using linear programming in the Chilean General Treasury , 2002, Eur. J. Oper. Res..

[11]  Stephen C. Graves,et al.  A Dynamic Model for Requirements Planning with Application to Supply Chain Optimization , 1998, Oper. Res..

[12]  Fangruo Chen.  Stationary Policies in Multiechelon Inventory Systems with Deterministic Demand and Backlogging , 1998, Oper. Res..

[13]  Michael Pinedo,et al.  A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop , 1999 .

[14]  Linda Leon,et al.  Spreadsheets and OR/MS Models: An End-User Perspective , 1996 .

[15]  Kaj Rosling,et al.  Optimal Inventory Policies for Assembly Systems Under Random Demands , 1989, Oper. Res..

[16]  Hans van Maaren,et al.  Inverse barriers and CES-functions in linear programming , 1997, Oper. Res. Lett..

[17]  Barış Tan,et al.  A station model for continuous materials flow production systems , 1997 .

[18]  Marcos Singer,et al.  Forecasting policies for scheduling a stochastic due date job shop , 2000 .

[19]  Roberto Cominetti,et al.  Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming , 1997, Math. Oper. Res..

[20]  Ayalvadi J. Ganesh,et al.  Large deviations of the sojourn time for queues in series , 1998, Ann. Oper. Res..

[21]  Patricio Donoso,et al.  Fleet configuration subject to stochastic demand: an application in the distribution of liquefied petroleum gas , 2002, J. Oper. Res. Soc..

[22]  Michael C. Fu,et al.  Queueing theory in manufacturing: A survey , 1999 .

[23]  David C. Lane,et al.  Can we have confidence in generic structures? , 1998, J. Oper. Res. Soc..