IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-41880-8_1.html
   My bibliography  Save this book chapter

Multiagent Scheduling Fundamentals

In: Multiagent Scheduling

Author

Listed:
  • Alessandro Agnetis

    (Università di Siena)

  • Jean-Charles Billaut

    (Université François Rabelais Tours)

  • Stanisław Gawiejnowicz

    (Adam Mickiewicz University)

  • Dario Pacciarelli

    (Università Roma Tre)

  • Ameur Soukhal

    (Université François Rabelais Tours)

Abstract

This chapter gives a general introduction to multicriteria and multiagent scheduling. Basic concepts from the two research areas are presented and a classification of considered problems, illustrating the presentation by examples, is proposed.

Suggested Citation

  • Alessandro Agnetis & Jean-Charles Billaut & Stanisław Gawiejnowicz & Dario Pacciarelli & Ameur Soukhal, 2014. "Multiagent Scheduling Fundamentals," Springer Books, in: Multiagent Scheduling, edition 127, chapter 0, pages 1-22, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-41880-8_1
    DOI: 10.1007/978-3-642-41880-8_1
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Shen, Zuo-Jun Max & Xie, Jingui & Zheng, Zhichao & Zhou, Han, 2023. "Dynamic scheduling with uncertain job types," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1047-1060.
    2. Zhongyi Jiang & Fangfang Chen & Xiandong Zhang, 2022. "Single-machine scheduling problems with general truncated sum-of-actual-processing-time-based learning effect," Journal of Combinatorial Optimization, Springer, vol. 43(1), pages 116-139, January.
    3. Ahmadian, Mohammad Mahdi & Khatami, Mostafa & Salehipour, Amir & Cheng, T.C.E., 2021. "Four decades of research on the open-shop scheduling problem to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 295(2), pages 399-426.
    4. Qi Feng & Shisheng Li, 2022. "Algorithms for Multi-Customer Scheduling with Outsourcing," Mathematics, MDPI, vol. 10(9), pages 1-12, May.
    5. Oron, Daniel, 2021. "Two-agent scheduling problems under rejection budget constraints," Omega, Elsevier, vol. 102(C).
    6. Wenhua Li & Libo Wang & Xing Chai & Hang Yuan, 2020. "Online Batch Scheduling of Simple Linear Deteriorating Jobs with Incompatible Families," Mathematics, MDPI, vol. 8(2), pages 1-12, February.

    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:sprchp:978-3-642-41880-8_1. 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: 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.