@inproceedings{7c85fa75433145c380cd47e2f566a4a1,
title = "Approximation scheme for scheduling resumable proportionally deteriorating jobs",
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).",
keywords = "Complexity, Non-availability, Proportionally deteriorating, Resumable, Scheduling",
author = "Wenchang Luo and Lin Chen",
year = "2011",
doi = "10.1007/978-3-642-21204-8_8",
language = "English",
isbn = "9783642212031",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "36--45",
booktitle = "Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Joint International Conference, FAW-AAIM 2011, Proceedings",
note = "null ; Conference date: 28-05-2011 Through 31-05-2011",
}