Pages that link to "Item:Q790814"
From MaRDI portal
The following pages link to A performance guarantee for the greedy set-partitioning algorithm (Q790814):
Displaying 9 items.
- Comparing the minimum completion times of two longest-first scheduling-heuristics (Q300962) (← links)
- A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines (Q342416) (← links)
- Maximizing the minimum load: the cost of selfishness (Q390908) (← links)
- A greedy heuristic for 3-partitioning with similar elements (Q685863) (← links)
- The exact LPT-bound for maximizing the minimum completion time (Q1196214) (← links)
- Tighter bounds on a heuristic for a partition problem (Q1350239) (← links)
- Improved algorithms to minimize workload balancing criteria on identical parallel machines (Q1652586) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- (Q4520507) (← links)