Minimum Required Local Storages of an Automated Assembly System

DOI10.1057/JORS.1992.16MaRDI QIDQ4006903zbMATH OpenOpenAlexFDO

Authors Behnam Pourbabai

Publication date 27 September 1992

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.1992.16

zbMATH Keywords

finite capacity assembly line systemfinite capacity flexible assembly line systemheuristic algorithmmixed non-Markovian queueing network

Mathematics Subject Classification ID

Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Queues and service in operations research (90B22) Reliability, availability, maintenance, inspection in operations research (90B25) Production models (90B30) Stochastic programming (90C15) Applications of mathematical programming (90C90)

Recommendations

• Operating a flexible assembly line: To control the bottleneck
• An optimal policy for controlling the flow time in an assembly line system
• An Operational Strategy for Throughput Maximization and Bottleneck Control in an Assembly Line System: By Selection of the Processing Rates
• scientific article; zbMATH DE number 4106589
• Analysis of a finite capacity assembly system

Cited in

(1)

• An Operational Strategy for Throughput Maximization and Bottleneck Control in an Assembly Line System: By Selection of the Processing Rates

This page was built for publication: Minimum Required Local Storages of an Automated Assembly System

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4006903)