Databases selected:  ABI/INFORM Research, Hoover's Company Records

Document View

               
Print  |  Email  |  Copy link  |  Cite this  | 
 
Other available formats:
References:
A Simple and Effective Component Procurement Policy for Stochastic Assembly Systems
Jeremie Gallien, Lawrence M. Wein. Queueing Systems. Basel: Jun 2001. Vol. 38, Iss. 2; pg. 221

Abstract (Summary)

We examine the component procurement problem in a single-item, make-to-stock assembly system. The suppliers are uncapacitated and have independent but non-identically distributed stochastic delivery lead times. Assembly is instantaneous, product demand follows a Poisson process and unsatisfied demand is backordered. The objective is to minimize the sum of steady-state holding and backorder costs over a pre-specified class of replenishment policies. To keep the analysis tractable, we impose a synchronization assumption that no mixing occurs between sets of component orders. Combining existing results from queueing theory with original results concerning distributions that are closed under maximization and translation, we derive a simple approximate solution to the problem when lead time variances are identical. In simulations, our derived policy is within 2% of optimal and significantly outperforms policies that ignore either component dependence or lead time stochasticity. It is also quite robust with respect to various model assumptions, except the synchronization one.

References

Indexing (document details)

Subjects:Studies,  Stochastic models,  Purchasing,  Inventory control,  Queuing theory,  Simulation
Classification Codes9130 Experimental/theoretical,  2600 Management science/operations research,  5330 Inventory management
Author(s):Jeremie Gallien,  Lawrence M. Wein
Document types:Feature
Publication title:Queueing Systems. Basel: Jun 2001. Vol. 38, Iss. 2;  pg. 221
Source type:Periodical
ISSN:02570130
ProQuest document ID:355899461
Text Word Count11555
Document URL:

Print  |  Email  |  Copy link  |  Cite this  |  Publisher Information
^ Back to Top                
Copyright © 2010 ProQuest LLC. All rights reserved. Terms and Conditions
Text-only interface