The Effectiveness of Several Performance Bounds for Capacitated Production, Partial-Order-Service, Assemble-to-Order Systems

Authors:
Savas Dayanik;Jing-Sheng Song;Susan H. Xu
Affiliations:
-;-;-
Venue:
Manufacturing & Service Operations Management
Year:
2003

Citing 0
Cited 5

A General Decomposition Algorithm for Parallel Queues with Correlated Arrivals

Queueing Systems: Theory and Applications
Production and Inventory Control of a Single Product Assemble-to-Order System with Multiple Customer Classes

Management Science
Dynamic Control of a Multiclass Queue with Thin Arrival Streams

Operations Research
Production and Inventory Control of a Single Product Assemble-to-Order System with Multiple Customer Classes

Management Science
Comparing Markov Chains: Aggregation and Precedence Relations Applied to Sets of States, with Applications to Assemble-to-Order Systems

Mathematics of Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider an assemble-to-order (ATO) system: Components are made to stock by production facilities with finite capacities, and final products are assembled only in response to customers' orders. The key performance measures in this system, such as order fill rates, involve evaluation of multivariate probability distributions, which is computationally demanding if not intractable. The purpose of this paper is to develop computationally efficient performance estimates. We examine several ideas scattered in diverse literatures on approximations for multivariate probability distributions, and determine which approach is most effective in the ATO application. To do so, we first tailor different approximation ideas to the ATO setting to derive performance bounds, and then compare these bounds theoretically and numerically. The bounds also allow us to make connections between capacitated and uncapacitated ATO systems and gain various insights.