Pages that link to "Item:Q3503217"
From MaRDI portal
The following pages link to A New Approximation Algorithm for the Nonpreemptive Scheduling of Independent Jobs on Identical Parallel Processors (Q3503217):
Displayed 5 items.
- A composite algorithm for multiprocessor scheduling (Q544815) (← links)
- Minimizing the makespan in nonpreemptive parallel machine scheduling problem (Q655176) (← links)
- Partial solutions and multifit algorithm for multiprocessor scheduling (Q894528) (← links)
- A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria (Q1762126) (← links)
- A note on posterior tight worst-case bounds for longest processing time schedules (Q2423296) (← links)