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

DOI10.1007/s10951-019-00616-8zbMath1455.90067OpenAlexW2964614857WikidataQ127411493 ScholiaQ127411493MaRDI QIDQ2215197

Nir Halman

Publication date: 11 December 2020

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-019-00616-8

zbMATH Keywords

dynamic schedulingFPTAS\(K\)-approximation sets and functions

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Scheduling jobs with a V-shaped time-dependent processing time ⋮ Strongly polynomial FPTASes for monotone dynamic programs ⋮ Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier

Cites Work

• Time-dependent scheduling
• On a scheduling problem of time deteriorating jobs
• A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
• Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
• On the complexity of energy storage problems
• The TV advertisements scheduling problem
• Bi-criteria path problem with minimum length and maximum survival probability
• A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand
• Scheduling deteriorating jobs to minimize makespan
• Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs

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