Operations Research · 1989 · 116 citations · 20 references
BusinessIndustrial EngineeringManufacturing EngineeringCapacity PlanningOptimizationQueuing TheoryApproximation AlgorithmsNetworks Of QueuesQueueing AnalysisQueueing NetworksQueueing SystemsQueueing TheoryHeuristicsManufacturing Systems DesignOpen Queueing NetworksQueueing Network Approximation
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.
20
A Proof for the Queuing Formula: <i>L</i> = λ<i>W</i>
John D. C. Little · Operations Research · 1961 · 2.7K citations
Ward Whitt · Bell System Technical Journal · 1983 · 1K citations
Performance of the Queueing Network Analyzer
Ward Whitt · Bell System Technical Journal · 1983 · 176 citations