Journal of Heuristics

, Volume 3, Issue 4, pp 287-297

First online:

A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs

  • Mikhail Y. KovalyovAffiliated withInstitute of Engineering Cybernetics, National Academy of Sciences of Belarus
  • , Wieslaw KubiakAffiliated withFaculty of Business Administration, Memorial University of Newfoundland

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


A fully polynomial approximation scheme for the problem of scheduling n deteriorating jobs on a single machine to minimize makespan is presented. Each algorithm of the scheme runs in O(n 5 L 4ɛ3) time, where L is the number of bits in the binary encoding of the largest numerical parameter in the input, and ɛ is required relative error. The idea behind the scheme is rather general and it can be used to develop fully polynomial approximation schemes for other combinatorial optimization problems. Main feature of the scheme is that it does not require any prior knowledge of lower and/or upper bounds on the value of optimal solutions.

fully polynomial approximation scheme deteriorating jobs