The following pages link to (Q4228496):
Displaying 15 items.
- On-line scheduling to minimize Max flow time: an optimal preemptive algorithm (Q813965) (← links)
- Minimizing average completion time in the presence of release dates (Q1290642) (← links)
- Minimizing flow time on a constant number of machines with preemption (Q1779706) (← links)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
- Lower bounds for on-line single-machine scheduling. (Q1874403) (← links)
- Average stretch without migration (Q1878679) (← links)
- The online food delivery problem on stars (Q2079861) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective (Q2465959) (← links)
- Optimal on-line flow time with resource augmentation (Q2489955) (← links)
- Designing PTASs for MIN-SUM scheduling problems (Q2489956) (← links)
- Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models (Q2500540) (← links)
- Approximating total flow time on parallel machines (Q2641865) (← links)
- (Q5743472) (← links)
- Minimizing the maximum flow time in the online food delivery problem (Q6130315) (← links)
