A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times

Fully polynomial time approximation schemes for scheduling deteriorating jobs with nonlinear processing times on a single machine are given via an application of the K -approximation sets and functions technique.

Uložené v:
Podrobná bibliografia
Vydané v:Journal of scheduling Ročník 23; číslo 6; s. 643 - 648
Hlavný autor: Halman, Nir
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer US 01.12.2020
Springer Nature B.V
Predmet:
Approximation
Artificial Intelligence
Business and Management
Calculus of Variations and Optimal Control; Optimization
Job shops
Mathematical analysis
Operations Research/Decision Theory
Optimization
Polynomials
Production scheduling
Supply Chain Management
approximation sets and functions
FPTAS
Dynamic scheduling
ISSN:1094-6136, 1099-1425
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Fully polynomial time approximation schemes for scheduling deteriorating jobs with nonlinear processing times on a single machine are given via an application of the K -approximation sets and functions technique.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1094-6136
1099-1425
DOI:10.1007/s10951-019-00616-8