Pages that link to "Item:Q1304470"
From MaRDI portal
The following pages link to The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines (Q1304470):
Displaying 12 items.
- Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime (Q341463) (← links)
- Scheduling on same-speed processors with at most one downtime on each machine (Q429662) (← links)
- Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines (Q906399) (← links)
- On the worst-case ratio of a compound multiprocessor scheduling algorithm (Q1097028) (← links)
- A note on MULTIFIT scheduling for uniform machines (Q1272356) (← links)
- Worst-case analysis of scheduling heuristics of parallel systems (Q1274368) (← links)
- Approximation for scheduling on uniform nonsimultaneous parallel machines (Q1702658) (← links)
- Scheduling on uniform processors with at most one downtime on each machine (Q1751114) (← links)
- The effect of machine availability on the worst-case performance of LPT (Q1775060) (← links)
- The multifit algorithm for set partitioning containing kernels (Q1807874) (← links)
- Optimal online algorithm for scheduling on two identical machines with machine availability constraints. (Q1853092) (← links)
- Exact performance of MULTIFIT for nonsimultaneous machines (Q2440111) (← links)
