On the Optimal Buffer Allocation of an FMS with Finite In-Process Buffers

DOI10.1007/11751595_81MaRDI QIDQ3600162zbMATH OpenOpenAlexFDO

Authors Soo-Tae Kwon

Publication date 10 February 2009

Published in Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11751595_81

zbMATH Keywords

bufferFMSqueueing networkthroughput

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Production models (90B30)

Recommendations

• Allocation of buffer spaces in a flexible manufacturing system: a model and a case example
• Buffer allocation in flow-shop-type production systems with general arrival and service patterns
• Optimal dynamic routing in flexible manufacturing systems with limited buffers
• Efficient algorithms for buffer space allocation
• Structured buffer-allocation problems

Cited in

(10)

• A buffer minimization problem for the design of embedded systems
• A buffer storage resource allocation model for cellular manufacturing systems
• Structured buffer-allocation problems
• Efficient algorithms for buffer space allocation
• Automated flow lines with shared buffer
• scientific article; zbMATH DE number 3864971 (Why is no real title available?)
• Buffer sizing in complex cellular manufacturing systems
• The Optimal Input Rates To A System Of Manufacturing Cells
• Allocation of buffer spaces in a flexible manufacturing system: a model and a case example
• Buffer allocation in flow-shop-type production systems with general arrival and service patterns

This page was built for publication: On the Optimal Buffer Allocation of an FMS with Finite In-Process Buffers

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