The following pages link to (Q4051615):
Displaying 11 items.
- Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime (Q341463) (← links)
- Scheduling with bully selfish jobs (Q692928) (← links)
- Approximation ratio of LD algorithm for multi-processor scheduling and the Coffman-Sethi conjecture (Q783686) (← links)
- The impact of local policies on the quality of packet routing in paths, trees, and rings (Q835620) (← links)
- An algorithm for flow time minimization and its asymptotic makespan properties (Q1198009) (← links)
- On batch scheduling of jobs with stochastic service times and cost structures on a single server (Q1227237) (← links)
- A graph model for scheduling processes in systems with parallel computations (Q1238748) (← links)
- Minimizing makespan subject to minimum total flow-time on identical parallel machines (Q1580983) (← links)
- Makespan minimization subject to flowtime optimality on identical parallel machines (Q1885968) (← links)
- Faster Algorithms for Semi-Matching Problems (Q2799478) (← links)
- Bicriteria multi-machine scheduling with equal processing times subject to release dates (Q6145328) (← links)
