Pages that link to "Item:Q2048806"
From MaRDI portal
The following pages link to Metric approach for finding approximate solutions of scheduling problems (Q2048806):
Displaying 4 items.
- Estimation of the absolute error and polynomial solvability for a classical NP-hard scheduling problem (Q1673705) (← links)
- Using metric spaces in optimum scheduling (Q1778762) (← links)
- Metric interpolation for the problem of minimizing the maximum lateness for a single machine (Q2069682) (← links)
- A metric approach for scheduling problems with minimizing the maximum penalty (Q2245804) (← links)