Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Altiok, T. (2000). “Tandem Queues in Bulk Port Operations.” Annals of Operations Research 93, 1–14.
Auslander, A., R. Cominetti, and M. Haddou. (1997). “Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming.” Mathematics of Operational Research 22, 43–62.
Berry, D., G. Evans, and M. Naim. (1998). “Pipeline Information Survey: A UK Perspective.” Omega 26, 115–131.
Bradley, J. and B. Arntzen. (1999). “The Simultaneous Planning of Production, Capacity, and Inventory in Seasonal Demand Environments.” Operations Research 47, 795–806.
Chen, F. (1998). “Stationary Policies in Multiechelon Inventory Systems with Deterministic Demand and Backlogging.” Operations Research 46, S26–S34.
Dallery, Y. and S.B. Gershwin. (1992). “Manufacturing Flow Line Systems: A Review of Models and Analytical Results.” Queueing Systems Theory and Applications 12, 3–94.
Fisher, M. (1979). “The Lagrangian Relaxation Method for Solving Integer Programming Problems.” Management Science 22, 1–18.
FRONTLINE SYSTEMS 2000. Premium Solver Platform. http://www.frontsys.com
Ganesh, A.J. (1998). “Large Deviations of the Sojourn Time for Queues in Series.” Annals of Operations Research 79, 3–26.
Govil, M. and M. FU. (1999). “Queueing Theory in Manufacturing: A Survey.” Journal of Manufacturing Systems 18, 214–240.
Graves, S.C., D.B. Kletter, and W.B. Hetzel. (1998). “A Dynamic Model for Requirements Planning with Application to Supply Chain Optimization.” Operations Research 46, S35–S49.
Lane, D.C. (1998). “Can We Have Confidence in Generic Structures?” Journal of the Operational Research Society 49, 936–947.
Leon, L., Z. Przasnysky, and K. Seal. (1997). “Spreadsheets and OR/MS Models: An End-User Perspective.” Interfaces 26, 92–104.
Pinedo, M. and M. Singer. (1999). “A Shifting Bottleneck Heuristic for Minimizing the Total Weighted Tardiness in a Job Shop.” Naval Research and Logistics 46, 1–17.
Rosling, K. (1998). “Optimal Inventory Policies for Assembly Systems Under Random Demands.” Operations Research 37, 365–579.
Singer, M. (2000). “Forecasting Policies for Scheduling a Stochastic Due Date Job Shop.” International Journal of Production Research 38, 3623–3637.
Singer, M. (2001). “Decomposition Methods for Large Job Shops.” Computers and Operations Research 28, 193–207.
Singer, M., P. Donoso, and S. Jara. (2002). “Fleet Configuration Subject to Stochastic Demand: An Application in the Distribution of Liquefied Petroleum gas.” Journal of the Operations Research Society 53, 961–971.
Singer, M., P. Donoso, and F. Poblete. (2002). “Semi-Autonomous Planning Using Linear Programming in the Chilean General Treasury.” European Journal of Operations Research 140, 517–529.
Van Maaren, H. and T. Terlaky (1997). “Inverse Barriers and CES Functions in Linear Programming.” Operational Research Letters 20, 15–20.
Tan, B. and S. Yeralan. (1997). “A Decomposition Model for Continuous Materials Flow Production Systems.” International Journal of Production Research 35, 2759–2772.
Yang, J., H. Yan, and S. Sethi. (1999). “Optimal Production Planning in Pull Flow Lines with Multiple Products.” European Journal of Operational Research 119, 582–604.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Singer, M., Donoso, P. & Noguer, J.L. Optimal Planning of a Multi-Station System with Sojourn Time Constraints. Ann Oper Res 138, 203–222 (2005). https://doi.org/10.1007/s10479-005-2454-1
Issue Date:
DOI: https://doi.org/10.1007/s10479-005-2454-1