Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

An Allocation Problem in a Certain Class of Flexible Manufacturing Systems

  • Published : 1988.06.01
Download PDF
⟨ Previous Next ⟩

Abstract

We study the optimal allocation of machines and pallets in a class of manufacturing systems. The FMS is modeled as a closed queueing network with balanced loading of the stations. An Algorithm is developed, which exploits the properties of the throughput function and solves the allocation problem for increasing concave profit and convex cost. We also study the more general case of allocating machines and pallets among a set of FMSs. A dynamic programming approach is developed, which solves the problem with O(M$^{3}$N$^{2}$) operations.

Keywords

References

  1. Operations Research v.15 Closed Queueing Networks with Exponential Servers Gorden,W.J.;G.F.Newell
  2. Finite Markov Chains Kemeny,J.G.;J.l.Cnell
  3. manuscript On the Superiority of Balanced Loading in Flexible Manufacturing System Shanthikumar,J.G.
  4. European Journal of Operational Research v.26 no.2 Reducing Work-in-Process Inventory in Certain Class of Flexible Manufacturing Systems Shanthikumar,J.G.;K.E.Stecke
  5. Management Science v.33 no.9 Optimal Server Allocation in a System of Multi-Server Stations Shanthikumar,J.G.;D.D.Yao
  6. Introduction to Stochastic Dynamic Programming Ross,S.
  7. Operations Research letters v.3 Some Properties of the Throughput Function of the Closed Networks of Queues Yao,D.D.