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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of scheduling Jg. 23; H. 6; S. 643 - 648
1. Verfasser: Halman, Nir
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.12.2020
Springer Nature B.V
Schlagworte:
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
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie: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