@inproceedings{5a9ec6ca1b5b4a498fec8f06c97d9914,
title = "An improved approximation algorithm for the ancient scheduling problem with deadlines",
abstract = "The aim of this paper is to develop an improved polynomial-time approximation algorithm belonging to the family of the fully polynomial time approximation schemes (FPTAS), for an ancient scheduling problem with deadlines. The algorithm permits to answer a question posed more than three decades ago in Gens \& Levner (1981): 'Can an epsilon-approximation algorithm be found for the minimization version of the job-sequencing-with-deadlines problem running with the same complexity as the algorithms for the maximization form of the problem?' The new algorithm provides the positive answer.",
keywords = "Approximation algorithm, FPTAS, Job-sequencing-with-deadlines scheduling problem",
author = "Eugene Levner and Amir Elalouf",
note = "Publisher Copyright: {\textcopyright} 2014 IEEE.; 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014 ; Conference date: 03-11-2014 Through 05-11-2014",
year = "2014",
month = dec,
day = "23",
doi = "10.1109/CoDIT.2014.6996878",
language = "English",
series = "Proceedings - 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014",
publisher = "Institute of Electrical and Electronics Engineers",
pages = "113--116",
editor = "Imed Kacem and Pierre Laroche and Zsuzsanna Roka",
booktitle = "Proceedings - 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014",
address = "United States",
}