Pages that link to "Item:Q1219159"
From MaRDI portal
The following pages link to Algorithms minimizing mean flow time: Schedule-length properties (Q1219159):
Displaying 11 items.
- Comparing the minimum completion times of two longest-first scheduling-heuristics (Q300962) (← links)
- Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime (Q341463) (← links)
- Bicriteria scheduling problem for unrelated parallel machines with release dates (Q342063) (← links)
- Scheduling with bully selfish jobs (Q692928) (← links)
- Approximation ratio of LD algorithm for multi-processor scheduling and the Coffman-Sethi conjecture (Q783686) (← links)
- An algorithm for flow time minimization and its asymptotic makespan properties (Q1198009) (← 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)
- Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time (Q2098029) (← links)
- Minimizing makespan subject to minimum flowtime on two identical parallel machines (Q5939974) (← links)
- Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations (Q6164589) (← links)
