IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-3-030-90374-9_9.html
   My bibliography  Save this book chapter

Noncooperative Supply Chain Scheduling

In: Supply Chain Scheduling

Author

Listed:
  • Zhi-Long Chen

    (University of Maryland)

  • Nicholas G. Hall

    (Ohio State University)

Abstract

This chapter discusses the application of noncooperative solution methods, especially noncooperative game theory, to decentralized supply chain scheduling problems. We consider a wide variety of scheduling problems that have classically been modeled and analyzed from the perspective of a centralized decision maker. By viewing the jobs or resources within these applications as individual self-interested players, noncooperative supply chain scheduling games are defined over those problems. We consider games with complete information, first without and second with structural enhancements, as well as games where the players have private information which they may report untruthfully. Within private information games, we study mechanism design both without and with payments and illustrate various concepts of truthfulness that are established by deterministic or randomized mechanisms. Our analysis of these games applies all the main concepts of noncooperative games, from the perspective of finding equilibrium solutions and analyzing their quality.

Suggested Citation

  • Zhi-Long Chen & Nicholas G. Hall, 2022. "Noncooperative Supply Chain Scheduling," International Series in Operations Research & Management Science, in: Supply Chain Scheduling, chapter 0, pages 549-659, Springer.
    • Handle: RePEc:spr:isochp:978-3-030-90374-9_9
    DOI: 10.1007/978-3-030-90374-9_9
    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. Slikker, Marco, 2023. "The stable gain splitting rule for sequencing situations," European Journal of Operational Research, Elsevier, vol. 310(2), pages 902-913.
    2. Berghman, Lotte & Kergosien, Yannick & Billaut, Jean-Charles, 2023. "A review on integrated scheduling and outbound vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 311(1), pages 1-23.

    More about this item

    Statistics

    Access and download statistics

    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:isochp:978-3-030-90374-9_9. 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.