Tradeoff Curves, Targeting and Balancing in Manufacturing Queueing Networks Export

@article{citeulike:4204137, abstract = {In this paper, we introduce the notions of tradeoff curves, targeting and balancing in manufacturing systems to describe the relationship between variables such as work-in-process, lead-time and capacity. We consider multiproduct manufacturing systems modeled by open networks of queues and formulate the targeting (TP) and balancing (BP) problems as nonlinear programs. These formulations are based primarily on parametric decomposition methods for estimating performance measures in open queueing networks. Since TP and BP typically are hard to solve, we show that under fairly realistic conditions they can be approximated by easily solvable convex programs. We present heuristics to obtain approximate solutions to these problems and to derive tradeoff curves. We also provide bounds on the performance of the heuristics, relative to the approximation problems, and show that they are asymptotically optimal under mild conditions.}, author = {Bitran, Gabriel R. and Tirupati, Devanath}, citeulike-article-id = {4204137}, citeulike-linkout-0 = {http://dx.doi.org/10.2307/171256}, citeulike-linkout-1 = {http://www.jstor.org/stable/171256}, doi = {10.2307/171256}, issn = {0030364X}, journal = {Operations Research}, keywords = {article, masters, mcp, pegging, queueing, resourceallocation}, number = {4}, pages = {547--564}, posted-at = {2009-03-21 20:19:17}, priority = {2}, publisher = {INFORMS}, title = {Tradeoff Curves, Targeting and Balancing in Manufacturing Queueing Networks}, url = {http://dx.doi.org/10.2307/171256}, volume = {37}, year = {1989} }

TY - JOUR ID - citeulike:4204137 L3 - citeulike-article-id:4204137 N2 - In this paper, we introduce the notions of tradeoff curves, targeting and balancing in manufacturing systems to describe the relationship between variables such as work-in-process, lead-time and capacity. We consider multiproduct manufacturing systems modeled by open networks of queues and formulate the targeting (TP) and balancing (BP) problems as nonlinear programs. These formulations are based primarily on parametric decomposition methods for estimating performance measures in open queueing networks. Since TP and BP typically are hard to solve, we show that under fairly realistic conditions they can be approximated by easily solvable convex programs. We present heuristics to obtain approximate solutions to these problems and to derive tradeoff curves. We also provide bounds on the performance of the heuristics, relative to the approximation problems, and show that they are asymptotically optimal under mild conditions. IS - 4 JF - Operations Research SN - 0030364X EP - 564 TI - Tradeoff Curves, Targeting and Balancing in Manufacturing Queueing Networks PB - INFORMS VL - 37 SP - 547 KW - article KW - masters KW - mcp KW - pegging KW - queueing KW - resourceallocation AU - Bitran, Gabriel AU - Tirupati, Devanath PY - 1989/// UR - http://dx.doi.org/10.2307/171256 ER -