Pages that link to "Item:Q1360133"
From MaRDI portal
The following pages link to Dynamic non-preemptive single machine scheduling (Q1360133):
Displaying 4 items.
- Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming (Q633553) (← links)
- On the flexibility of a decision theory-based heuristic for single machine scheduling (Q1628046) (← links)
- New heuristics for total tardiness minimization in a flexible flowshop (Q1947616) (← links)
- A heuristic algorithm to minimize total weighted tardiness on a single machine with release times (Q4670675) (← links)
