IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v72y2024i4p1749-1750.html
   My bibliography  Save this article

Erratum to “Competitive Two-Agent Scheduling and Its Applications”

Author

Listed:
  • Christos Koulamas

    (Department of Information Systems and Business Analytics, College of Business, Florida International University, Miami, Florida 33199)

  • George Kyparisis

    (Department of Information Systems and Business Analytics, College of Business, Florida International University, Miami, Florida 33199)

  • Michael Pinedo

    (Stern School of Business, New York University, New York, New York 10012)

  • Guohua Wan

    (Department of Management Science, Antai College of Economics and Management, Shanghai Jiao Tong University, Shanghai 200240, China)

Abstract

Leung et al. (2010) [Leung JY-T, Pinedo M, Wan G (2010) Competitive two-agent scheduling and its applications. Oper. Res . 58:458–469] considered a two-agent nonpreemptive single-machine scheduling problem. Agent A is responsible for n 1 jobs with due dates d 1 , … , d n and has as the objective the minimization of the total tardiness of the n 1 jobs. Agent B is responsible for n 2 jobs and has as the objective the minimization of the total completion time of the n 2 jobs. The problem is to find a schedule for the n 1 + n 2 jobs that minimizes the objective of agent A (with regard to his n 1 jobs) while keeping the objective of agent B (with regard to his n 2 jobs) below or at a fixed level Q . Leung et al. (2010) [Leung JY-T, Pinedo M, Wan G (2010) Competitive two-agent scheduling and its applications. Oper. Res. 58:458–469], in their theorem 3, showed that this problem can be solved through dynamic programming in pseudopolynomial time. However, in the proof of their theorem and in their dynamic programming formulation, there is an error that requires some changes in their proof.

Suggested Citation

  • Christos Koulamas & George Kyparisis & Michael Pinedo & Guohua Wan, 2024. "Erratum to “Competitive Two-Agent Scheduling and Its Applications”," Operations Research, INFORMS, vol. 72(4), pages 1749-1750, July.
    • Handle: RePEc:inm:oropre:v:72:y:2024:i:4:p:1749-1750
    DOI: 10.1287/opre.2023.0368
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2023.0368
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2023.0368?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
    ---><---

    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:inm:oropre:v:72:y:2024:i:4:p:1749-1750. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.