Approximation scheme for scheduling resumable proportionally deteriorating jobs

Authors:
Wenchang Luo;Lin Chen
Affiliations:
Faculty of Science, Ningbo University, Ningbo, China;College of Computer Science, Zhejiang University, Hangzhou, China
Venue:
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Year:
2011

Citing 7
Cited 0

Scheduling jobs under simple linear deterioration

Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

INFORMS Journal on Computing
Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine

Information Processing Letters
Scheduling linear deteriorating jobs with an availability constraint on a single machine

Theoretical Computer Science
A survey of scheduling with deterministic machine availability constraints

Computers and Industrial Engineering
Scheduling resumable simple linear deteriorating jobs on a single machine with an availability constraint to minimize makespan

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we investigate the problem of scheduling resumable proportionally deteriorating jobs on a single machine with a non-availability constraint. The goal is to minimize the total completion time. We show the problem is NP-hard. Furthermore, we present a fully polynomial time approximation scheme (FPTAS).