Abstract
Erratum to “Competitive Two-Agent Scheduling and Its Applications” The paper “Competitive Two-Agent Scheduling and Its Applications” by Leung, Pinedo, and Wan appeared in Operations Research in 2010. Because competitive agent scheduling has become an active area of research, the paper has garnered its share of citations over the years. This particular direction of scheduling research has become so popular that the book Multiagent Scheduling: Models and Algorithms by Agnetis, Billaut, Gawiejnowicz, Pacciarelli, and Soukhal appeared in 2014. However, one of the results in the Leung et al. paper had a minor error in it. The paper considers a two-agent scheduling problem with a single machine, with each one of the two agents having their own set of jobs. The first agent has as the objective the minimization of the total tardiness of her set of jobs, and the second agent has to ensure that the total completion time of her set of jobs is less than or equal to Q. Leung et al. showed, through a dynamic programming formulation, that this problem can be solved in pseudopolynomial time and determined the time complexity of their algorithm. Their proof contains a minor error. The proper algorithm is still pseudopolynomial but of a slightly higher time complexity.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
