Pages that link to "Item:Q1702658"
From MaRDI portal
The following pages link to Approximation for scheduling on uniform nonsimultaneous parallel machines (Q1702658):
Displaying 13 items.
- A note on MULTIFIT scheduling for uniform machines (Q1272356) (← links)
- The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines (Q1304470) (← links)
- An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems (Q1607020) (← links)
- Fast approximation algorithms for uniform machine scheduling with processing set restrictions (Q1753462) (← links)
- Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (Q2001201) (← links)
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines (Q2373738) (← links)
- Exact performance of MULTIFIT for nonsimultaneous machines (Q2440111) (← links)
- Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems (Q2633602) (← links)
- Approximation Algorithms For Scheduling On Uniform Processors (Q4202255) (← links)
- Approximation algorithms for scheduling arithmetic expressions on pipelined machines (Q4203814) (← links)
- (Q4536969) (← links)
- (Q4537734) (← links)
- Performance guarantee of the jump neighborhood for scheduling jobs on uniformly related machines (Q5074358) (← links)