A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs

A fully polynomial approximation scheme for the problem of scheduling n deteriorating jobs on a single machine to minimize makespan is presented. Each algorithm of the scheme runs in O(n^sup 5^ L^sup 4^^sup 3^) time, where L is the number of bits in the binary encoding of the largest numerical param...

Full description

Saved in:
Bibliographic Details
Published inJournal of heuristics Vol. 3; no. 4; pp. 287 - 297
Main Authors Kovalyov, Mikhail Y., Kubiak, Wieslaw
Format Journal Article
LanguageEnglish
Published Boston Springer Nature B.V 01.03.1998
Subjects
Algorithms
Approximation
Heuristic
Job shops
Optimization
Studies
Online AccessGet full text
ISSN1381-1231
1572-9397
DOI10.1023/A:1009626427432

Cover

More Information
Summary:A fully polynomial approximation scheme for the problem of scheduling n deteriorating jobs on a single machine to minimize makespan is presented. Each algorithm of the scheme runs in O(n^sup 5^ L^sup 4^^sup 3^) time, where L is the number of bits in the binary encoding of the largest numerical parameter in the input, and is required relative error. The idea behind the scheme is rather general and it can be used to develop fully polynomial approximation schemes for other combinatorial optimization problems. Main feature of the scheme is that it does not require any prior knowledge of lower and/or upper bounds on the value of optimal solutions.[PUBLICATION ABSTRACT]
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1381-1231
1572-9397
DOI:10.1023/A:1009626427432