Node generation and capacity reallocation in open Jackson networks

Imry Rosenbaum, Irad Ben-Gal and Uri Yechiali

IISE Transactions, 2013, vol. 45, issue 3, 259-272

Abstract: This article investigates methods for reallocation of service capacities in open Jackson networks in order to minimize either a system's mean total work-in-process or its response time. The focus is mainly on a method called node generation, by which capacity can be transferred from a node in echelon j to a newly generated node in echelon j + 1. The proposed procedure is compared with the more conventional capacity redistribution method, by which capacity can be transferred from any node in echelon j to existing successor nodes in echelon j + 1. Formulation of each method as a mathematical programming problem reveals the structure of the optimal solution for both problems. The motivation for considering these approaches stems from real-life settings, in particular, from a production line or supply chains where the two types of capacity reallocation are applied. Heuristic methods are developed to solve relatively large networks in tractable time. Numerical results and analyses are presented.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/0740817X.2012.677571 (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:taf:uiiexx:v:45:y:2013:i:3:p:259-272

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20

DOI: 10.1080/0740817X.2012.677571

Access Statistics for this article

IISE Transactions is currently edited by Jianjun Shi

More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().