Pages that link to "Item:Q924886"
From MaRDI portal
The following pages link to Online scheduling of parallel jobs on two machines is 2-competitive (Q924886):
Displayed 17 items.
- A new lower bound for online strip packing (Q322552) (← links)
- The generalization of scheduling with machine cost (Q392182) (← links)
- Online multiple-strip packing (Q621841) (← links)
- Improved online algorithms for parallel job scheduling and strip packing (Q627112) (← links)
- Online scheduling of malleable parallel jobs with setup times on two identical machines (Q976487) (← links)
- On-line scheduling of multi-core processor tasks with virtualization (Q991470) (← links)
- A note on online strip packing (Q1029271) (← links)
- Online over time processing of combinatorial problems (Q1617394) (← links)
- New upper bounds for online strip packing (Q1751205) (← links)
- A new upper bound for the online square packing problem in a strip (Q2012894) (← links)
- Improved lower bound for online strip packing (Q2344211) (← links)
- A tight analysis of Brown-Baker-Katseff sequences for online strip packing (Q2392732) (← links)
- WORST-CASE PERFORMANCE EVALUATION ON MULTIPROCESSOR TASK SCHEDULING WITH RESOURCE AUGMENTATION (Q3016228) (← links)
- ONLINE SCHEDULING OF PARALLEL JOBS WITH BOUNDED PROCESSING TIMES ON TWO MACHINES (Q3063612) (← links)
- Online scheduling of two type parallel jobs on identical machines (Q3170006) (← links)
- Improved Algorithms for Online Scheduling of Malleable Parallel Jobs on Two Identical Machines (Q3455878) (← links)
- Online Algorithm for Parallel Job Scheduling and Strip Packing (Q5443373) (← links)