Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming

DOI10.1007/s10951-009-0160-6zbMath1208.90077MaRDI QIDQ633553

Débora P. Ronconi, Warren B. Powell

Publication date: 1 April 2011

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

Full work available at URL: https://doi.org/10.1007/s10951-009-0160-6

zbMATH Keywords

scheduling; single machine; tardiness; approximate dynamic programming

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

90C39: Dynamic programming

Related Items

An approximate dynamic programming approach for <scp>production‐delivery</scp> scheduling under non‐stationary demand, Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness, New heuristics for total tardiness minimization in a flexible flowshop, Stochastic single machine scheduling problem as a multi-stage dynamic random decision process, Approximate dynamic programming for an energy-efficient parallel machine scheduling problem, Analysis of computer job control under uncertainty

Cites Work

• Unnamed Item
• Unnamed Item
• Adaptive stepsizes for recursive estimation with applications in approximate dynamic programming
• Tactically delayed versus non-delay scheduling: An experimental investigation
• Dynamic non-preemptive single machine scheduling
• A weighted modified due date rule for sequencing to minimize weighted tardiness
• Minimizing Total Tardiness on One Machine is NP-Hard
• The Linear Programming Approach to Approximate Dynamic Programming
• Order review and release strategies ina job shop environment: A review and a classification
• Approximate Dynamic Programming