Performance analysis and buffer allocations in some open assembly systems.
From MaRDI portal
Recommendations
- Analysis of the fork-join queue
- Structured buffer-allocation problems
- Queueing-model based analysis of assembly lines with finite buffers and general service times
- Assembly-like queues with finite capacity: Bounds, asymptotics and approximations
- Throughput equivalencies in fork/ join queueing networks with finite buffers and general service times
Cites work
- scientific article; zbMATH DE number 4043000 (Why is no real title available?)
- scientific article; zbMATH DE number 47258 (Why is no real title available?)
- scientific article; zbMATH DE number 236854 (Why is no real title available?)
- A review of L= W and extensions
- Analysis of the fork-join queue
- Control policies for multi-product multi-stage manufacturing systems: An experimental approach
- Properties of serial kanban systems
- Safety Stock versus Safety Time in MRP Controlled Production Systems
- Scheduling manufacturing systems with work-in-process inventory control: multiple-part-type systems
- Stochastic modelling of flexible manufacturing systems
Cited in
(9)- A multi-objective lead time control problem in multistage assembly systems using an interactive method
- Analysis of a finite capacity assembly system
- Due-date assignment for multi-server multi-stage assembly systems
- The time buffer approximated buffer allocation problem: a row-column generation approach
- A multi-objective lead time control problem in multi-stage assembly systems using genetic algorithms
- Due date assignment for multistage assembly systems
- Modelling complex assemblies as a queueing network for lead time control
- A tandem network with a sharing buffer
- Performance analysis of a kitting process in stochastic assembly systems
This page was built for publication: Performance analysis and buffer allocations in some open assembly systems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870823)
