Skip to main content
SpringerLink
Log in

Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

Tang et al. (Eur J Oper Res 263:401–411, 2017) have recently introduced a parallel-batching machine scheduling problem with linearly deteriorating jobs of two agents and presented a computational complexity classification of various special cases of this problem, including a number of NP-hardness proofs. We refine these results by demonstrating strong NP-hardness of several special cases, which are proved NP-hard in the ordinary sense in Tang et al. (Eur J Oper Res 263:401–411, 2017). Our reduction employs the problem studied in the first issue of Journal of Scheduling.

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.

References

  1. Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M. Y., Potts, C. N., Tautenhahn, T., et al. (1998). Scheduling a batching machine. Journal of Scheduling, 1, 31–54.

    Article  Google Scholar 

  2. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco, CA: W.H. Freeman and Co.

    Google Scholar 

  3. Li, S. S., Ng, C. T., Cheng, T. C. E., & Yuan, J. J. (2011). Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan. European Journal of Operational Research, 210, 482–488.

    Article  Google Scholar 

  4. Tang, L., Zhao, X., Liu, J., & Leung, J. Y.-T. (2017). Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine. European Journal of Operational Research, 263, 401–411.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. United Institute of Informatics Problems, National Academy of Sciences of Belarus, Minsk, Belarus

    Mikhail Y. Kovalyov

  2. Vilnius Gediminas Technical University, Vilnius, Lithuania

    Mikhail Y. Kovalyov & Dmitrij Šešok

Authors
  1. Mikhail Y. Kovalyov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dmitrij Šešok
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dmitrij Šešok.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kovalyov, M.Y., Šešok, D. Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity. J Sched 22, 603–606 (2019). https://doi.org/10.1007/s10951-019-00613-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-019-00613-x

Keywords

Search

Navigation