Skip to main content

Advertisement

Springer Nature Link
Log in

A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times

  • Original Article
  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract

We consider a scheduling problem in which the processing time of each job deteriorates, i.e. it increases as time passes after the release date of the job. We present a dynamic programming algorithm coupled with upper bounding and lower bounding techniques to compute exact solutions. We report on problem instances of different size and we analyze the dependence between the ranges to which the data belong and the computing time.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

  • Bosio A, Righini G (2006) A dynamic programming algorithm for the single-machine scheduling problem with deteriorating processing times. In: Fifth Cologne-Twente workshop on graphs and combinatorial optimization, Lambrecht. Electronic notes in discrete mathematics, vol 25, pp 139–142

  • Browne S, Yechiali U (1990) Scheduling deteriorating jobs on a single processor. Oper Res 38: 495–498

    Article  MATH  Google Scholar 

  • Cheng TCE, Ding Q (1998) The complexity of scheduling starting time dependent tasks with release times. Inf Process Lett 65: 75–79

    Article  MathSciNet  Google Scholar 

  • Cheng TCE, Ding Q, Lin BMT (2004) A concise survey of scheduling with time-dependent processing times. Eur J Oper Res 152: 1–13

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Tecnologie dell’Informazione, Università degli Studi di Milano, via Bramante 65, 26013, Crema, Italy

    Alberto Bosio & Giovanni Righini

Authors
  1. Alberto Bosio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giovanni Righini
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Giovanni Righini.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bosio, A., Righini, G. A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times. Math Meth Oper Res 69, 271–280 (2009). https://doi.org/10.1007/s00186-008-0258-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00186-008-0258-1

Keywords