Pages that link to "Item:Q5438152"
From MaRDI portal
The following pages link to Solution of the NP-hard total tardiness minimization problem in scheduling theory (Q5438152):
Displaying 4 items.
- A hybrid algorithm for the single-machine total tardiness problem (Q954025) (← links)
- The single-machine total tardiness scheduling problem: review and extensions (Q1038369) (← links)
- A note on the equivalence of two heuristics to minimize total tardiness (Q1278526) (← links)
- A greedy algorithm for the solution of the classical NP-hard scheduling problem of minimizing the total delay (Q2069704) (← links)