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 13 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)
- Algorithms with limited number of preemptions for scheduling on parallel machines (Q2015808) (← links)
- Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes (Q2059895) (← links)
- How small are shifts required in optimal preemptive schedules? (Q2341389) (← links)
- Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times (Q2398640) (← links)
- Schedules with a single preemption on uniform parallel machines (Q2414478) (← links)
- Dynamic Windows Scheduling with Reallocation (Q5102055) (← links)
- Preemptive Scheduling on Selfish Machines (Q5458506) (← links)
