IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v155y2007i1p227-25510.1007-s10479-007-0206-0.html
   My bibliography  Save this article

Distributed personnel scheduling—negotiation among scheduling agents

Author

Listed:
  • Eliezer Kaplansky
  • Amnon Meisels

Abstract

This paper introduces a model for Distributed Employee Timetabling Problems (DisETPs) and proposes a general architecture for solving DisETPs by using a Multi Agent System (MAS) paradigm. The architecture is composed of a set of autonomous software Scheduling Agents (SAs) that solve the Employee Timetabling Problems (ETP) for each department. Each agent has its own local ETP problem and its own goals. The Scheduling Agents must coordinate their local solution with the other agents in order to achieve a global solution for the whole organization that yields a better result with respect to the organization’s global targets. To achieve a coherent and consistent global solution, the SAs make use of a sophisticated negotiation protocol among scheduling agents that always ends in an agreement (not ensured to be optimal). The main functionalities of this protocol are agent to agent relation definition, a mechanism to approve a chain of Request for Changes and an electronic marketplace for bidding on preferred common time slots. Experimental analysis of the implemented Multi Agent System for the Soroka medical center is presented. The results of our study indicate that the proposed framework has the potential to reduce the cost of transportation for the nurses that traveling to and from the hospital. Copyright Springer Science+Business Media, LLC 2007

Suggested Citation

  • Eliezer Kaplansky & Amnon Meisels, 2007. "Distributed personnel scheduling—negotiation among scheduling agents," Annals of Operations Research, Springer, vol. 155(1), pages 227-255, November.
    • Handle: RePEc:spr:annopr:v:155:y:2007:i:1:p:227-255:10.1007/s10479-007-0206-0
    DOI: 10.1007/s10479-007-0206-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-007-0206-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-007-0206-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    References listed on IDEAS

    as
    1. Meisels, Amnon & Kaplansky, Eliezer, 2004. "Iterative restart technique for solving timetabling problems," European Journal of Operational Research, Elsevier, vol. 153(1), pages 41-50, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sanja Petrovic & Greet Berghe, 2012. "A comparison of two approaches to nurse rostering problems," Annals of Operations Research, Springer, vol. 194(1), pages 365-384, April.
    2. Leung, Polly P.L. & Wu, C.H. & Kwong, C.K. & Ip, W.H. & Ching, W.K., 2021. "Digitalisation for optimising nursing staff demand modelling and scheduling in nursing homes," Technological Forecasting and Social Change, Elsevier, vol. 164(C).
    3. Peña Diana A. & Osorio Andrés F. & Orejuela Juan P. & Idarraga Juan C., 2023. "Multi-skilled workforce scheduling with training and welfare considerations," Engineering Management in Production and Services, Sciendo, vol. 15(3), pages 27-41, September.
    4. An Pan & Tsan-Ming Choi, 2016. "An agent-based negotiation model on price and delivery date in a fashion supply chain," Annals of Operations Research, Springer, vol. 242(2), pages 529-557, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Salem Al-Yakoob & Hanif Sherali & Mona Al-Jazzaf, 2010. "A mixed-integer mathematical modeling approach to exam timetabling," Computational Management Science, Springer, vol. 7(1), pages 19-46, January.

    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:spr:annopr:v:155:y:2007:i:1:p:227-255:10.1007/s10479-007-0206-0. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.