Dynamic non-preemptive single machine scheduling

DOI10.1016/S0305-0548(96)00025-1zbMath0876.90059OpenAlexW2016749971MaRDI QIDQ1360133

Sri V. Sridharan, Zhuoqun Zhou

Publication date: 15 July 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(96)00025-1

zbMATH Keywords

job shop schedulingdecision theory-tactically delayeddynamic single machine problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

On the flexibility of a decision theory-based heuristic for single machine scheduling ⋮ Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming ⋮ New heuristics for total tardiness minimization in a flexible flowshop ⋮ A heuristic algorithm to minimize total weighted tardiness on a single machine with release times

Cites Work

• Unnamed Item
• Tactically delayed versus non-delay scheduling: An experimental investigation
• A survey of priority rule-based scheduling
• A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
• Algorithms for Solving Production-Scheduling Problems