Modeling a class of state-dependent routing in flexible manufacturing systems

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

58 Scopus Citations
View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Pages (from-to)153-167
Journal / PublicationAnnals of Operations Research
Volume3
Issue number3
Publication statusPublished - Mar 1985
Externally publishedYes

Abstract

We develop a closed queueing network model for flexible manufacturing systems (FMSs), where parts routing follows a probabilistic shortest-queue (PSQ) scheme, i.e. parts are routed to the shortest queue (or the most empty station) with the highest probability. We allow limited local buffer at each work station. We prove that with the PSQ routing, the Markovian queue-length process satisfies time reversibility and has a product-form equilibrium distribution. An algorithm is developed to compute the solutions to the model. The model can be used as a performance evaluation tool to study FMSs. © 1985 J.C. Baltzer A.G., Scientific Publishing Company.

Research Area(s)

  • Closed queueing network, flexible manufacturing, reversible Markov process, state-dependent routing