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

Marcos Singer (), Patricio Donoso and José Noguer

Annals of Operations Research, 2005, vol. 138, issue 1, 203-222

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. Copyright Springer Science + Business Media, Inc. 2005

Keywords: dynamic system; sojourn times; Lagrangian relaxation; operations planning; resource allocation (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-005-2454-1 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:138:y:2005:i:1:p:203-222:10.1007/s10479-005-2454-1

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-005-2454-1

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().