Optimal dynamic routing in flexible manufacturing systems with limited buffers

DOI10.1007/BF02186800zbMath0705.90034MaRDI QIDQ918382

Abraham Seidmann

Publication date: 1988

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

convergenceroboticsoptimal routingcomputational stabilityFlexible Manufacturing Systemscontinuous-time, semi-Markovian decision processergodic solution algorithmlimited buffers

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Stochastic programming (90C15) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Application models in control theory (93C95) Markov and semi-Markov decision processes (90C40)

Related Items (2)

Allocation of flows in closed bipartite queueing networks ⋮ Optimal Routing in Closed Queueing Networks with State Dependent Queues

Cites Work

• On the existence of relative values for undiscounted Markovian decision processes with a scalar gain rate
• On queueing network models of flexible manufacturing systems
• Iterative solution of the functional equations of undiscounted Markov renewal programming
• On Sequential Decisions and Markov Chains
• Modelling the performance of flexible manufacturing systems
• The Optimality of Unbalancing Both Workloads and Machine Group Sizes in Closed Queueing Networks of Multiserver Queues
• The Optimal Input Rates To A System Of Manufacturing Cells
• Optimal Server Allocation in a System of Multi-Server Stations
• Queuing Network Models with State-Dependent Routing
• Markov-Renewal Programming. I: Formulation, Finite Return Models
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal dynamic routing in flexible manufacturing systems with limited buffers