Skip to main content
SpringerLink
Log in

Strong NP-hardness of scheduling problems with learning or aging effect

  • Short Note
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Proofs of strong NP-hardness of single machine and two-machine flowshop scheduling problems with learning or aging effect given in Rudek (Computers & Industrial Engineering 61:20–31, 2011; Annals of Operations Research 196(1):491–516, 2012a; International Journal of Advanced Manufacturing Technology 59:299–309, 2012b; Applied Mathematics and Computations 218:6498–6510, 2012c; Applied Mathematical Modelling 37:1523–1536, 2013) contain a common mistake that make them incomplete. We reveal the mistake and provide necessary corrections for the problems in Rudek (Computers & Industrial Engineering 61:20–31, 2011; Annals of Operations Research 196(1):491–516, 2012a; Applied Mathematical Modelling 37:1523–1536, 2013). NP-hardness of problems in Rudek (International Journal of Advanced Manufacturing Technology 59:299–309, 2012b; Applied Mathematics and Computations 218:6498–6510, 2012c) remains unknown because of another mistake which we are unable to correct.

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

References

  • Kuo, W.-H. (2012). Single-machine group scheduling with time-dependent learning effect and position-based setup time learning effect. Annals of Operations Research, 196(1), 349–359.

    Article  Google Scholar 

  • Rudek, R. (2011). Computational complexity and solution algorithms for flowshop scheduling problems with the learning effect. Computers & Industrial Engineering, 61, 20–31.

    Article  Google Scholar 

  • Rudek, R. (2012a). Scheduling problems with position dependent job processing times: computational complexity results. Annals of Operations Research, 196(1), 491–516.

    Article  Google Scholar 

  • Rudek, R. (2012b). Some single-machine scheduling problems with the extended sum-of-processing-time-based aging effect. International Journal of Advanced Manufacturing Technology, 59, 299–309.

    Article  Google Scholar 

  • Rudek, R. (2012c). The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect. Applied Mathematics and Computing, 218, 6498–6510.

    Article  Google Scholar 

  • Rudek, R. (2013). On single processor scheduling problems with learning dependent on the number of processed jobs. Applied Mathematical Modelling, 37, 1523–1536.

    Article  Google Scholar 

  • Wang, J.-B., & Wang, M.-Z. (2011). Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects. Annals of Operations Research, 191(1), 155–169.

    Article  Google Scholar 

  • Yang, D.-L., & Kuo, W.-H. (2009). Single-machine scheduling with both deterioration and learning effects. Annals of Operations Research, 172(1), 315–327.

    Article  Google Scholar 

  • Zhang, X., Yan, G., Huang, W., & Tang, G. (2011). Single-machine scheduling problems with time and position dependent processing times. Annals of Operations Research, 186(1), 345–356.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Wrocław University of Technology, Wrocław, Poland

    Adam Janiak & Maciej Lichtenstein

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

    Mikhail Y. Kovalyov

Authors
  1. Adam Janiak
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mikhail Y. Kovalyov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maciej Lichtenstein
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Adam Janiak.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Janiak, A., Kovalyov, M.Y. & Lichtenstein, M. Strong NP-hardness of scheduling problems with learning or aging effect. Ann Oper Res 206, 577–583 (2013). https://doi.org/10.1007/s10479-013-1364-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-013-1364-x

Keywords

Search

Navigation