Dynamic non-preemptive single machine scheduling
From MaRDI portal
Recommendations
- A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
- Dynamic scheduling of stochastic jobs on a single machine
- An analysis of heuristics in a dynamic job shop with weighted tardiness objectives
- An evaluation of scheduling heuristics for dynamic single-processor scheduling with early/tardy costs
- A dynamic programming method for single machine scheduling
Cites work
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
- A survey of priority rule-based scheduling
- Algorithms for Solving Production-Scheduling Problems
- Tactically delayed versus non-delay scheduling: An experimental investigation
Cited in
(7)- Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming
- Dynamic single-machine scheduling under distributed decision-making
- On the flexibility of a decision theory-based heuristic for single machine scheduling
- Jackson's semi-preemptive scheduling on a single machine
- Tactically delayed versus non-delay scheduling: An experimental investigation
- 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
This page was built for publication: Dynamic non-preemptive single machine scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1360133)
