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

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Engineering optimization Ročník 51; číslo 11; s. 1938 - 1943
Hlavní autori: Zhao, Chuanli, Hsu, Chou-Jung
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Abingdon Taylor & Francis 02.11.2019
Taylor & Francis Ltd
Predmet:
Algorithms
Approximation
deteriorating jobs
Dynamic programming
fully polynomial-time approximation scheme
Mathematical analysis
Polynomials
Production scheduling
Scheduling
single machine
ISSN:0305-215X, 1029-0273
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia: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