Skip to main content
SpringerLink
Log in

Complexities of four problems on two-agent scheduling

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

In the two-agent scheduling with the global objective function to be minimized being the number of tardy jobs and the specified agent’s objective function to be minimized being makespan or maximum lateness, the computational complexities of four problems were posed as open in the literature. We show in this paper that the four problems are binary NP-hard and two of them are solvable in pseudo-polynomial time.

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.

Similar content being viewed by others

References

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

    Article  MathSciNet  MATH  Google Scholar 

  2. Baker, K.R., Smith, J.C.: A multiple-criterion model for machine scheduling. J. Sched. 6, 7–16 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  3. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  4. Huynh-Tuong, N., Soukhal, A.: Single machine scheduling with interfering jobs. In: International Conference on Project Management and Scheduling, PMS. Tours, France, pp. 243–247 (2010)

  5. Huynh-Tuong, N., Soukhal, A., Billaut, J.C.: Single-machine multi-agent scheduling problems with a global objective function. J. Sched. 15, 311–321 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  6. Moore, J.M.: An \(n\) job, one machine sequencing algorithm for minimizing the number of late jobs. Manag. Sci. 15, 102–109 (1968)

    Article  MATH  Google Scholar 

  7. Perez-Gonzalez, P., Framinan, J.M.: A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems. Eur. J. Oper. Res. 235, 1–16 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  8. Sahni, S.: Algorithms for scheduling independent tasks. J. Assoc. Comput. Mach. 23, 116–127 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  9. T’kindt, V., Billaut, J.C.: Multicriteria Scheduling: Theory, Models and Algorithms, 2nd edn. Springer, Berlin (2006)

    MATH  Google Scholar 

Download references

Acknowledgements

We 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 NSF-Henan (15IRTSTHN006).

Author information

Authors and Affiliations

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

    Jinjiang Yuan

Authors
  1. 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

Yuan, J. Complexities of four problems on two-agent scheduling. Optim Lett 12, 763–780 (2018). https://doi.org/10.1007/s11590-017-1141-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-017-1141-x

Keywords

Search

Navigation