Pages that link to "Item:Q4924641"
From MaRDI portal
The following pages link to A Greedy Approximation Algorithm for Minimum-Gap Scheduling (Q4924641):
Displaying 6 items.
- The triangle scheduling problem (Q1617282) (← links)
- Scheduling with gaps: new models and algorithms (Q2059088) (← links)
- A greedy algorithm for the solution of the classical NP-hard scheduling problem of minimizing the total delay (Q2069704) (← links)
- A greedy approximation algorithm for minimum-gap scheduling (Q2400437) (← links)
- Scheduling to minimize gaps and power consumption (Q2434309) (← links)
- Scheduling with Gaps: New Models and Algorithms (Q2947014) (← links)