Pages that link to "Item:Q818662"
From MaRDI portal
The following pages link to Minimizing makespan and preemption costs on a system of uniform machines (Q818662):
Displaying 6 items.
- Mathematical programming algorithms for bin packing problems with item fragmentation (Q336982) (← links)
- An AFPTAS for variable sized bin packing with general activation costs (Q340560) (← links)
- Robust algorithms for preemptive scheduling (Q472464) (← links)
- Parametric analysis of the quality of single preemption schedules on three uniform parallel machines (Q829195) (← links)
- Approximation schemes for packing with item fragmentation (Q927410) (← links)
- Optimal and online preemptive scheduling on uniformly related machines (Q1041344) (← links)
