Improving the solution complexity of the scheduling problem with deadlines: A general technique

Amir Elalouf; Eugene Levner

doi:10.1051/ro/2016021

Improving the solution complexity of the scheduling problem with deadlines: A general technique

Research output: Contribution to journal › Article › peer-review

Abstract

The aim of this paper is to develop improved polynomial-time approximation algorithms belonging to the family of the fully polynomial time approximation schemes (FPTAS) for a group of scheduling problems. In particular, the new technique provides a positive answer to a question posed more than three decades ago by Gens and Levner [G.V. Gens and E.V. Levner, Discrete Appl. Math.

Original language	American English
Pages (from-to)	681-687
Number of pages	7
Journal	RAIRO - Operations Research
Volume	50
Issue number	4-5
DOIs	https://doi.org/10.1051/ro/2016021
State	Published - 1 Oct 2016
Externally published	Yes

Keywords

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

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science Applications
Management Science and Operations Research

Access to Document

10.1051/ro/2016021

Cite this

@article{b50edcfa85d948a090ed5dfa7f093ab6,

title = "Improving the solution complexity of the scheduling problem with deadlines: A general technique",

abstract = "The aim of this paper is to develop improved polynomial-time approximation algorithms belonging to the family of the fully polynomial time approximation schemes (FPTAS) for a group of scheduling problems. In particular, the new technique provides a positive answer to a question posed more than three decades ago by Gens and Levner [G.V. Gens and E.V. Levner, Discrete Appl. Math.",

keywords = "Approximation algorithm, FPTAS, Job-sequencing-with-deadlines scheduling problem",

author = "Amir Elalouf and Eugene Levner",

note = "Publisher Copyright: {\textcopyright} 2016 EDP Sciences, ROADEF, SMAI.",

year = "2016",

month = oct,

day = "1",

doi = "10.1051/ro/2016021",

language = "American English",

volume = "50",

pages = "681--687",

journal = "RAIRO - Operations Research",

issn = "0399-0559",

publisher = "EDP Sciences",

number = "4-5",

}

TY - JOUR

T1 - Improving the solution complexity of the scheduling problem with deadlines

T2 - A general technique

AU - Elalouf, Amir

AU - Levner, Eugene

PY - 2016/10/1

Y1 - 2016/10/1

N2 - The aim of this paper is to develop improved polynomial-time approximation algorithms belonging to the family of the fully polynomial time approximation schemes (FPTAS) for a group of scheduling problems. In particular, the new technique provides a positive answer to a question posed more than three decades ago by Gens and Levner [G.V. Gens and E.V. Levner, Discrete Appl. Math.

AB - The aim of this paper is to develop improved polynomial-time approximation algorithms belonging to the family of the fully polynomial time approximation schemes (FPTAS) for a group of scheduling problems. In particular, the new technique provides a positive answer to a question posed more than three decades ago by Gens and Levner [G.V. Gens and E.V. Levner, Discrete Appl. Math.

KW - Approximation algorithm

KW - FPTAS

KW - Job-sequencing-with-deadlines scheduling problem

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

U2 - 10.1051/ro/2016021

DO - 10.1051/ro/2016021

M3 - Article

SN - 0399-0559

VL - 50

SP - 681

EP - 687

JO - RAIRO - Operations Research

JF - RAIRO - Operations Research

IS - 4-5

ER -

Improving the solution complexity of the scheduling problem with deadlines: A general technique

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this