A note on a two-agent scheduling problem related to the total weighted late work

  • Yuan Zhang
  • Jinjiang YuanEmail author


We revisit a two-agent scheduling problem in which a set of jobs belonging to two agents A and B (without common jobs) will be processed on a single machine for minimizing the total weighted late work of agent A subject to the maximum cost of agent B being bounded. Zhang and Wang (J Comb Optim 33:945–955, 2017) studied three versions of the problem: (i) the A-jobs having a common due date, (ii) the A-jobs having a common processing time, (iii) the general version. The authors presented polynomial-time algorithms for the first two versions and a pseudo-polynomial-time algorithm for the last one. However, their algorithm for the first version is invalid. Then we show the NP-hardness and provide a pseudo-polynomial-time algorithm for the first version with the cost of agent B being makespan, present a polynomial-time algorithm for an extension of the second version, and show that the third version is solvable in pseudo-polynomial-time by a new technique.


Scheduling Single machine Two-agent Late work 



The authors would like to thank the associate editor and two anonymous referees for their constructive comments and kind suggestions. This research was supported by NSFC (11671368) and NSFC (11771406).


  1. Agnetis A, Mirchandani PB, Pacciarelli D, Pacifici A (2004) Scheduling problems with two competing agents. Oper Res 52:229–242MathSciNetCrossRefzbMATHGoogle Scholar
  2. Agnetis A, Pacciarelli D, Pacifici A (2007) Multi-agent single machine scheduling. Ann Oper Res 150:3–15MathSciNetCrossRefzbMATHGoogle Scholar
  3. Agnetis A, Billaut JC, Gawiejnowicz S, Pacciarelli D, Soukhal A (2014) Multiagent scheduling: models and algorithms. Springer, BerlinCrossRefzbMATHGoogle Scholar
  4. Baker KR, Smith JC (2003) A multiple-criterion model for machine scheduling. J Sched 6:7–16MathSciNetCrossRefzbMATHGoogle Scholar
  5. Blazewicz J (1984) Scheduling preemptible tasks on parallel processors with information loss. Tech Sci Inf 3(6):415–420MathSciNetzbMATHGoogle Scholar
  6. Chen B, Potts CN, Woeginger GJ (1998) A review of machine scheduling. In: Du D-Z, Pardalos PM (eds) Handbook of combinatorial optimization. Kluwer Academic Publishers, Boston, pp 21–169Google Scholar
  7. Cheng TCE, Ng CT, Yuan JJ (2006) Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. Theor Comput Sci 362:273–281MathSciNetCrossRefzbMATHGoogle Scholar
  8. Cheng TCE, Ng CT, Yuan JJ (2008) Multi-agent scheduling on a single machine with max-form criteria. Eur J Oper Res 188:603–609MathSciNetCrossRefzbMATHGoogle Scholar
  9. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San FranciscozbMATHGoogle Scholar
  10. Hariri AMA, Potts CN, Van Wassenhove LN (1995) Single machine scheduling to minimize total weighted late work. ORSA J Comput 7:232–242CrossRefzbMATHGoogle Scholar
  11. Lawler EL (1976) Combinatorial optimization: networks and matroids. Holt, Rinehart and Winston, New YorkzbMATHGoogle Scholar
  12. Leung JYT (2004) Minimizing total weighted error for imprecise computation tasks and related problems. In: Leung JYT (ed) Handbook of scheduling: algorithms, models, and performance analysis. CRC Press, Boca Raton, pp 34.1–34.16Google Scholar
  13. Ng CT, Cheng TE, Yuan JJ (2006) A note on the complexity of the problem of two-agent scheduling on a single machine. J Comb Optim 12:87–394MathSciNetCrossRefzbMATHGoogle Scholar
  14. Potts CN, Van Wassenhove LN (1992) Single machine scheduling to minimize total late work. Oper Res 40:586–595MathSciNetCrossRefzbMATHGoogle Scholar
  15. Sterna M (2011) A survey of scheduling problems with late work criteria. Omega 39:120–129CrossRefGoogle Scholar
  16. Wang DJ, Yin YQ, Cheng SR, Cheng TCE, Wu CC (2016) Due date assignment and scheduling on a single machine with two competing agents. Int J Prod Res 54:1152–1169CrossRefGoogle Scholar
  17. Wang DJ, Kang CC, Shiau YR, Wu CC, Hsu PH (2017) A two-agent single-machine scheduling problem with late work criteria. Soft Comput 21:2015–2033CrossRefzbMATHGoogle Scholar
  18. Yin YQ, Wang DJ, Wu CC, Cheng TCE (2016) CON/SLK due date assignment and scheduling on a single machine with two agents. Nav Res Logist 63:416–429MathSciNetCrossRefGoogle Scholar
  19. Yuan JJ (2016) Complexities of some problems on multi-agent scheduling on a single machine. J Oper Res Soc China 4:379–384MathSciNetCrossRefzbMATHGoogle Scholar
  20. Yuan JJ, Shang WP, Feng Q (2005) A note on the scheduling with two families of jobs. J Sched 8:537–542MathSciNetCrossRefzbMATHGoogle Scholar
  21. Zhang XG, Wang Y (2017) Two-agent scheduling problems on a single-machine to minimize the total weighted late work. J Comb Optim 33:945–955MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.School of Mathematics and StatisticsZhengzhou UniversityZhengzhouPeople’s Republic of China

Personalised recommendations