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.

Saved in:
Bibliographic Details
Published in:Journal of scheduling Vol. 23; no. 6; pp. 643 - 648
Main Author: Halman, Nir
Format: Journal Article
Language:English
Published: New York Springer US 01.12.2020
Springer Nature B.V
Subjects:
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 Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography: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