Improving the complexities of FPTAS for scheduling and routing problems

E. Levner; A. Elalouf; I. Kacem

Improving the complexities of FPTAS for scheduling and routing problems

E. Levner, A. Elalouf, I. Kacem

Department of Management

Research output: Contribution to conference › Paper › peer-review

Abstract

We suggest a general technique for improving the complexity of fully polynomial time approximation schemes (FPTAS) for several combinatorial problems. Using the dynamic approximate binary search, we first obtain an improved FPTAS for a problem of scheduling temperature-dependent operations on a single machine. Then, we show that the suggested technique can be used for improving the worst-case complexities of earlier FPTASs for several other routing and scheduling problems.

Original language	English
State	Published - 2015
Event	45th International Conference on Computers and Industrial Engineering, CIE 2015 - Metz, France Duration: 28 Oct 2015 → 30 Oct 2015

Conference

Conference	45th International Conference on Computers and Industrial Engineering, CIE 2015
Country/Territory	France
City	Metz
Period	28/10/15 → 30/10/15

Keywords

Complexity
FPTAS
Scheduling and routing problems

Cite this

@conference{fe7903cfea96451da22f03d7a3bd8e31,

title = "Improving the complexities of FPTAS for scheduling and routing problems",

abstract = "We suggest a general technique for improving the complexity of fully polynomial time approximation schemes (FPTAS) for several combinatorial problems. Using the dynamic approximate binary search, we first obtain an improved FPTAS for a problem of scheduling temperature-dependent operations on a single machine. Then, we show that the suggested technique can be used for improving the worst-case complexities of earlier FPTASs for several other routing and scheduling problems.",

keywords = "Complexity, FPTAS, Scheduling and routing problems",

author = "E. Levner and A. Elalouf and I. Kacem",

year = "2015",

language = "אנגלית",

note = "45th International Conference on Computers and Industrial Engineering, CIE 2015 ; Conference date: 28-10-2015 Through 30-10-2015",

}

TY - CONF

T1 - Improving the complexities of FPTAS for scheduling and routing problems

AU - Levner, E.

AU - Elalouf, A.

AU - Kacem, I.

PY - 2015

Y1 - 2015

N2 - We suggest a general technique for improving the complexity of fully polynomial time approximation schemes (FPTAS) for several combinatorial problems. Using the dynamic approximate binary search, we first obtain an improved FPTAS for a problem of scheduling temperature-dependent operations on a single machine. Then, we show that the suggested technique can be used for improving the worst-case complexities of earlier FPTASs for several other routing and scheduling problems.

AB - We suggest a general technique for improving the complexity of fully polynomial time approximation schemes (FPTAS) for several combinatorial problems. Using the dynamic approximate binary search, we first obtain an improved FPTAS for a problem of scheduling temperature-dependent operations on a single machine. Then, we show that the suggested technique can be used for improving the worst-case complexities of earlier FPTASs for several other routing and scheduling problems.

KW - Complexity

KW - FPTAS

KW - Scheduling and routing problems

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

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:84963682713

T2 - 45th International Conference on Computers and Industrial Engineering, CIE 2015

Y2 - 28 October 2015 through 30 October 2015

ER -

Improving the complexities of FPTAS for scheduling and routing problems

Abstract

Conference

Keywords

Other files and links

Fingerprint

The 45th International Conference on Computers & Industrial Engineering (CIE45)

Cite this

Improving the complexities of FPTAS for scheduling and routing problems

Abstract

Conference

Keywords

Other files and links

Fingerprint

Activities

The 45th International Conference on Computers & Industrial Engineering (CIE45)

Cite this