An improved approximation algorithm for the ancient scheduling problem with deadlines

Eugene Levner; Amir Elalouf

doi:10.1109/CoDIT.2014.6996878

An improved approximation algorithm for the ancient scheduling problem with deadlines

Eugene Levner, Amir Elalouf

Department of Management

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

5 Scopus citations

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.

Original language	English
Title of host publication	Proceedings - 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014
Editors	Imed Kacem, Pierre Laroche, Zsuzsanna Roka
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	113-116
Number of pages	4
ISBN (Electronic)	9781479967735
DOIs	https://doi.org/10.1109/CoDIT.2014.6996878
State	Published - 23 Dec 2014
Event	2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014 - Metz, France Duration: 3 Nov 2014 → 5 Nov 2014

Publication series

Name	Proceedings - 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014

Conference

Conference	2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014
Country/Territory	France
City	Metz
Period	3/11/14 → 5/11/14

Bibliographical note

Funding Information:
We would like to thank the HST project for the award of director’s discretionary time in support of the Capella simultaneous campaign. J. J. D. extends warm thanks to the CXC mission planning scientists, in particular Jan Vrtilek, for making the special effort to mesh the Chandra schedule with that of the three other participating satellites. O. J., J. J. D., N. S. B., P. F., and V. K. were supported by NASA contract NAS8-39073 to the CXC during the course of this research. A. K. D. and P. R. Y. acknowledge support, in part, from NASA grant G00-1044X. V. K. was also supported by NASA grants NAG5-9105 and NAG5-6675 and NASA HST grant GO-08546.01-A.

Publisher Copyright:
© 2014 IEEE.

Keywords

Approximation algorithm
FPTAS
Job-sequencing-with-deadlines scheduling problem

Access to Document

10.1109/CoDIT.2014.6996878

Cite this

Levner, E., & Elalouf, A. (2014). An improved approximation algorithm for the ancient scheduling problem with deadlines. In I. Kacem, P. Laroche, & Z. Roka (Eds.), Proceedings - 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014 (pp. 113-116). Article 6996878 (Proceedings - 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CoDIT.2014.6996878

Levner, Eugene ; Elalouf, Amir. / An improved approximation algorithm for the ancient scheduling problem with deadlines. Proceedings - 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014. editor / Imed Kacem ; Pierre Laroche ; Zsuzsanna Roka. Institute of Electrical and Electronics Engineers Inc., 2014. pp. 113-116 (Proceedings - 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014).

@inproceedings{c7350158d9e2412fbca7948fbbb19ab4,

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 = "אנגלית",

series = "Proceedings - 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

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 = "ארצות הברית",

}

Levner, E & Elalouf, A 2014, An improved approximation algorithm for the ancient scheduling problem with deadlines. in I Kacem, P Laroche & Z Roka (eds), Proceedings - 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014., 6996878, Proceedings - 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014, Institute of Electrical and Electronics Engineers Inc., pp. 113-116, 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014, Metz, France, 3/11/14. https://doi.org/10.1109/CoDIT.2014.6996878

An improved approximation algorithm for the ancient scheduling problem with deadlines. / Levner, Eugene; Elalouf, Amir.
Proceedings - 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014. ed. / Imed Kacem; Pierre Laroche; Zsuzsanna Roka. Institute of Electrical and Electronics Engineers Inc., 2014. p. 113-116 6996878 (Proceedings - 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - An improved approximation algorithm for the ancient scheduling problem with deadlines

AU - Levner, Eugene

AU - Elalouf, Amir

PY - 2014/12/23

Y1 - 2014/12/23

N2 - 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.

AB - 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.

KW - Approximation algorithm

KW - FPTAS

KW - Job-sequencing-with-deadlines scheduling problem

UR - http://www.scopus.com/inward/record.url?scp=84921417585&partnerID=8YFLogxK

U2 - 10.1109/CoDIT.2014.6996878

DO - 10.1109/CoDIT.2014.6996878

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84921417585

T3 - Proceedings - 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014

SP - 113

EP - 116

BT - Proceedings - 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014

A2 - Kacem, Imed

A2 - Laroche, Pierre

A2 - Roka, Zsuzsanna

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014

Y2 - 3 November 2014 through 5 November 2014

ER -

Levner E, Elalouf A. An improved approximation algorithm for the ancient scheduling problem with deadlines. In Kacem I, Laroche P, Roka Z, editors, Proceedings - 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014. Institute of Electrical and Electronics Engineers Inc. 2014. p. 113-116. 6996878. (Proceedings - 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014). doi: 10.1109/CoDIT.2014.6996878

An improved approximation algorithm for the ancient scheduling problem with deadlines

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this