Skip to main content
SpringerLink
Log in

A note on the complexity of scheduling problems with linear job deterioration

  • Letter to the Editor
  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

Jafari and Moslehi (J Glob Optim 54:389–404, 2012) state that certain single-machine scheduling problems with linear job deterioration are NP-hard. We show that this is not the case for the maximum lateness minimization problem and point out the issues in the analysis of Jafari and Moslehi (J Glob Optim 54:389–404, 2012).

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

  1. Cheng, T.C.E., Ding, Q.: The complexity of scheduling time dependent tasks with release times. Inf. Process. Lett. 65, 75–79 (1998)

    Article  MathSciNet  Google Scholar 

  2. Cheng, T.C.E., Ding, Q.: Single machine scheduling with deadlines and increasing rates of processing times. Acta Inform. 36, 673–692 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Jafari, A., Moslehi, G.: Scheduling linear deteriorating jobs to minimize the number of tardy jobs. J. Glob. Optim. 54, 389–404 (2012)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

We would like to thank the reviewer for his/her valuable comments which helped us improve an earlier version of this note.

Author information

Authors and Affiliations

  1. College of Business, Florida International University, Miami, FL, 33199, USA

    Christos Koulamas

  2. Carey Business School, Johns Hopkins University, 100 International Drive, Baltimore, MD, 21202, USA

    S. S. Panwalkar

Authors
  1. Christos Koulamas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. S. Panwalkar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christos Koulamas.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Koulamas, C., Panwalkar, S.S. A note on the complexity of scheduling problems with linear job deterioration. J Glob Optim 62, 409–410 (2015). https://doi.org/10.1007/s10898-014-0254-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-014-0254-3

Keywords

Search

Navigation