Location of Repository

Complexity and approximability of scheduling resumable proportionally deteriorating jobs

By Stanislaw Gawiejnowicz and Alexander Kononov

Abstract

A set of independent, resumable and proportionally deteriorating jobs is to be executed on a single machine. The machine is not continuously available for processing but the number of non-availability periods, the start time and end time of each period are known in advance. The criterion of schedule optimality is the maximum completion time. It is proved that the decision version of the problem with a single non-availability period is ordinarily -complete. It is also proved that for the problem with a single non-availability period there exists a fully polynomial-time approximation scheme. Finally, it is proved that for the problem with two or more non-availability periods there does not exist a polynomial-time approximation algorithm with a constant worst-case ratio, unless .Scheduling Deteriorating jobs Complexity theory Fully polynomial-time approximation scheme

OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.sciencedirect.com/s... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.