Pages that link to "Item:Q296690"
From MaRDI portal
The following pages link to Fast approximation algorithms for bi-criteria scheduling with machine assignment costs (Q296690):
Displaying 5 items.
- Acquisition planning and scheduling of computing resources (Q342569) (← links)
- Scheduling to minimize the maximum total completion time per machine (Q726222) (← links)
- Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time (Q2098029) (← links)
- Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs (Q2304114) (← links)
- Minimizing machine assignment costs over \(\Delta\)-approximate solutions of the scheduling problem \(P||C_{\max}\) (Q2326400) (← links)
