Performance analysis and buffer allocations in some open assembly systems.

DOI10.1016/S0305-0548(02)00034-5zbMath1035.90021MaRDI QIDQ1870823

Sarat Kumar Eedupuganti, Nandyala Hemachandra

Publication date: 14 May 2003

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

modelsPerformance evaluationFork-join queueingOpen assembly systemsOptimal buffer allocations

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (8)

Performance analysis of a kitting process in stochastic assembly systems ⋮ Modelling complex assemblies as a queueing network for lead time control ⋮ A multi-objective lead time control problem in multi-stage assembly systems using genetic algorithms ⋮ A tandem network with a sharing buffer ⋮ A multi-objective lead time control problem in multistage assembly systems using an interactive method ⋮ The time buffer approximated buffer allocation problem: a row-column generation approach ⋮ Due date assignment for multistage assembly systems ⋮ Due-date assignment for multi-server multi-stage assembly systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A review of \(L=\lambda W\) and extensions
• Stochastic modelling of flexible manufacturing systems
• Properties of serial kanban systems
• Analysis of the fork-join queue
• Control policies for multi-product multi-stage manufacturing systems: An experimental approach
• Scheduling manufacturing systems with work-in-process inventory control: multiple-part-type systems
• Safety Stock versus Safety Time in MRP Controlled Production Systems

This page was built for publication: Performance analysis and buffer allocations in some open assembly systems.