Pages that link to "Item:Q1673705"
From MaRDI portal
The following pages link to Estimation of the absolute error and polynomial solvability for a classical NP-hard scheduling problem (Q1673705):
Displaying 3 items.
- Metric approach for finding approximate solutions of scheduling problems (Q2048806) (← links)
- A greedy algorithm for the solution of the classical NP-hard scheduling problem of minimizing the total delay (Q2069704) (← links)
- A metric approach for scheduling problems with minimizing the maximum penalty (Q2245804) (← links)
