Pages that link to "Item:Q614050"
From MaRDI portal
The following pages link to Improving the preemptive bound for the single machine dynamic maximum lateness problem (Q614050):
Displaying 3 items.
- Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. (Q1413906) (← links)
- Theoretical expectation versus practical performance of Jackson's heuristic (Q1665791) (← links)
- An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines (Q1870003) (← links)