Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs

This article considers a single machine scheduling problem in which the processing time of a job is a linear increasing function of its starting time. The objective is to minimize the weighted number of tardy jobs. A pseudo-polynomial dynamic programming algorithm and a fully polynomial-time approxi...

Full description

Saved in:
Bibliographic Details
Published inEngineering optimization Vol. 51; no. 11; pp. 1938 - 1943
Main Authors Zhao, Chuanli, Hsu, Chou-Jung
Format Journal Article
LanguageEnglish
Published Abingdon Taylor & Francis 02.11.2019
Taylor & Francis Ltd
Subjects
Algorithms
Approximation
deteriorating jobs
Dynamic programming
fully polynomial-time approximation scheme
Mathematical analysis
Polynomials
Production scheduling
Scheduling
single machine
Online AccessGet full text
ISSN0305-215X
1029-0273
DOI10.1080/0305215X.2018.1558446

Cover

More Information
Summary:This article considers a single machine scheduling problem in which the processing time of a job is a linear increasing function of its starting time. The objective is to minimize the weighted number of tardy jobs. A pseudo-polynomial dynamic programming algorithm and a fully polynomial-time approximation scheme are proposed.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0305-215X
1029-0273
DOI:10.1080/0305215X.2018.1558446