Assigning Identical Operators to Different Machines

  • Jan van der Wal
Conference paper
Part of the Operations Research Proceedings book series (ORP, volume 1993)

Abstract

Consider a system with M different machines and s identical operators. No machine can work without the constant attention of an operator and all operators can serve all machines. At machine m jobs arrive according to a Poisson arrival process with rate λ m and service time distribution F m .A job arriving at machine m can be served at machine m only. Whenever an operator finishes a job a decision has to be taken about the machine where he should go to next.

References

  1. [1]
    Durlinger, P.P.J. and J.H.J. Geurts, Determining work order throughput times in dual constrained production departments, Eindhoven University of Technology, Department of Industrial Engineering, Working paper BDK/KBS/89-13, December 1989.Google Scholar
  2. [2]
    Kok, A.G. de, and J. van der Wal, Assigning identical operators to different machines, Eindhoven University of Technology, Department of Mathematics and Computing Science, Memorandum COSOR 93-31, November 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin · Heidelberg 1994

Authors and Affiliations

  • Jan van der Wal
    • 1
  1. 1.Eindhoven University of TechnologyThe Netherlands

Personalised recommendations