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

Christos Koulamas (), George Kyparisis (), Michael Pinedo () and Guohua Wan ()
Additional contact information
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

Operations Research, 2024, vol. 72, issue 4, 1749-1750

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.

Keywords: Optimization; production/scheduling; sequencing; deterministic; single machine (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.2023.0368 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:72:y:2024:i:4:p:1749-1750

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().