The following pages link to A note on online strip packing (Q1029271):
Displaying 21 items.
- A new lower bound for online strip packing (Q322552) (← links)
- The generalization of scheduling with machine cost (Q392182) (← links)
- Online square packing with gravity (Q476449) (← links)
- Parameterized complexity of strip packing and minimum volume packing (Q501656) (← links)
- Online multiple-strip packing (Q621841) (← links)
- Improved online algorithms for parallel job scheduling and strip packing (Q627112) (← links)
- Improved upper bounds for online malleable job scheduling (Q892840) (← 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)
- New upper bounds for online strip packing (Q1751205) (← links)
- Online malleable job scheduling for \(m\leq 3\) (Q1944031) (← links)
- A new upper bound for the online square packing problem in a strip (Q2012894) (← links)
- Online scheduling of moldable parallel tasks (Q2317140) (← links)
- Improved lower bound for online strip packing (Q2344211) (← links)
- A tight analysis of Brown-Baker-Katseff sequences for online strip packing (Q2392732) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Coordination Mechanisms for Selfish Parallel Jobs Scheduling (Q2898033) (← links)
- WORST-CASE PERFORMANCE EVALUATION ON MULTIPROCESSOR TASK SCHEDULING WITH RESOURCE AUGMENTATION (Q3016228) (← links)
- Improved Algorithms for Online Scheduling of Malleable Parallel Jobs on Two Identical Machines (Q3455878) (← links)
- (Q5002616) (← links)
- Online Algorithm for Parallel Job Scheduling and Strip Packing (Q5443373) (← links)
