IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v30y2017i3p289-320.html
   My bibliography  Save this article

Machines interference problem with several operators and several service types that have different priorities

Author

Listed:
  • Baruch Keren
  • Gregory Gurevich
  • Yossi Hadad

Abstract

This paper proposes a model for a special case of the machine-repairman problem, which is also known as the machine interference problem (MIP), where each of N identical machines randomly requests several different service types that are provided by a group of K identical operators. Each service type has a different priority and the operators serve the machines according to these priorities. The model allows the calculation of the expected number of machines that are waiting for each type of service, based on the multinomial distribution. The model enables us to determine the optimal number of operators and the optimal queue discipline that minimises the total manufacturing cost per unit (TCU). The paper provides a proof that the sum of the expected number of machines that are waiting for all service types is a constant, and does not depend on the service priorities. The conclusion is that queue discipline has no influence on throughput or loads. To demonstrate the applicability of the model, a theoretical analysis and a real case study are presented.

Suggested Citation

  • Baruch Keren & Gregory Gurevich & Yossi Hadad, 2017. "Machines interference problem with several operators and several service types that have different priorities," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 30(3), pages 289-320.
    • Handle: RePEc:ids:ijores:v:30:y:2017:i:3:p:289-320
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=87274
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijores:v:30:y:2017:i:3:p:289-320. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.