The following pages link to (Q4368203):
Displaying 9 items.
- Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions (Q280185) (← links)
- Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime (Q341463) (← links)
- Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times (Q1271384) (← links)
- Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times (Q1318658) (← links)
- Exact bounds of the modified LPT algorithms applying to parallel machines scheduling with nonsimultaneous machine available times (Q1355924) (← links)
- Uniform machine scheduling with machine available constraints (Q1568243) (← links)
- The effect of machine availability on the worst-case performance of LPT (Q1775060) (← links)
- An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines (Q2463519) (← links)
- (Q4508391) (← links)
