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

Podrobná bibliografie

Vydáno v:	Engineering optimization Ročník 51; číslo 11; s. 1938 - 1943
Hlavní autoři:	Zhao, Chuanli, Hsu, Chou-Jung
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Abingdon Taylor & Francis 02.11.2019 Taylor & Francis Ltd
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!