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

DOI10.1007/s10951-009-0160-6zbMath1208.90077OpenAlexW1989343205MaRDI 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

schedulingsingle machinetardinessapproximate dynamic programming

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)

Related Items (6)

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

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

This page was built for publication: Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming