Skip to main content
SpringerLink
Log in

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

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Agnetis A, Mirchandani PB, Pacciarelli D, Pacifici A (2004) Scheduling problems with two competing agents. Oper Res 52:229–242

    Article  MathSciNet  MATH  Google Scholar 

  • Agnetis A, Pacciarelli D, Pacifici A (2007) Multi-agent single machine scheduling. Ann Oper Res 150:3–15

    Article  MathSciNet  MATH  Google Scholar 

  • Agnetis A, Billaut JC, Gawiejnowicz S, Pacciarelli D, Soukhal A (2014) Multiagent scheduling: models and algorithms. Springer, Berlin

    Book  MATH  Google Scholar 

  • Baker KR, Smith JC (2003) A multiple-criterion model for machine scheduling. J Sched 6:7–16

    Article  MathSciNet  MATH  Google Scholar 

  • Blazewicz J (1984) Scheduling preemptible tasks on parallel processors with information loss. Tech Sci Inf 3(6):415–420

    MathSciNet  MATH  Google Scholar 

  • 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–169

    Google Scholar 

  • 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–281

    Article  MathSciNet  MATH  Google Scholar 

  • Cheng TCE, Ng CT, Yuan JJ (2008) Multi-agent scheduling on a single machine with max-form criteria. Eur J Oper Res 188:603–609

    Article  MathSciNet  MATH  Google Scholar 

  • Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco

    MATH  Google Scholar 

  • Hariri AMA, Potts CN, Van Wassenhove LN (1995) Single machine scheduling to minimize total weighted late work. ORSA J Comput 7:232–242

    Article  MATH  Google Scholar 

  • Lawler EL (1976) Combinatorial optimization: networks and matroids. Holt, Rinehart and Winston, New York

    MATH  Google Scholar 

  • 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.16

    Google Scholar 

  • 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–394

    Article  MathSciNet  MATH  Google Scholar 

  • Potts CN, Van Wassenhove LN (1992) Single machine scheduling to minimize total late work. Oper Res 40:586–595

    Article  MathSciNet  MATH  Google Scholar 

  • Sterna M (2011) A survey of scheduling problems with late work criteria. Omega 39:120–129

    Article  Google Scholar 

  • 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–1169

    Article  Google Scholar 

  • 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–2033

    Article  MATH  Google Scholar 

  • 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–429

    Article  MathSciNet  Google Scholar 

  • Yuan JJ (2016) Complexities of some problems on multi-agent scheduling on a single machine. J Oper Res Soc China 4:379–384

    Article  MathSciNet  MATH  Google Scholar 

  • Yuan JJ, Shang WP, Feng Q (2005) A note on the scheduling with two families of jobs. J Sched 8:537–542

    Article  MathSciNet  MATH  Google Scholar 

  • 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–955

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

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).

Author information

Authors and Affiliations

  1. School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, 450001, Henan, People’s Republic of China

    Yuan Zhang & Jinjiang Yuan

Authors
  1. Yuan Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jinjiang Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jinjiang Yuan.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, Y., Yuan, J. A note on a two-agent scheduling problem related to the total weighted late work. J Comb Optim 37, 989–999 (2019). https://doi.org/10.1007/s10878-018-0337-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-018-0337-z

Keywords

Search

Navigation