Pages that link to "Item:Q880560"
From MaRDI portal
The following pages link to Scheduling parallel jobs to minimize the makespan (Q880560):
Displayed 29 items.
- A new lower bound for online strip packing (Q322552) (← links)
- The generalization of scheduling with machine cost (Q392182) (← links)
- Improved online algorithms for parallel job scheduling and strip packing (Q627112) (← links)
- Rectangle packing with one-dimensional resource augmentation (Q834190) (← links)
- Improved upper bounds for online malleable job scheduling (Q892840) (← links)
- Online scheduling of parallel jobs on two machines is 2-competitive (Q924886) (← links)
- On-line scheduling of parallel jobs in a list (Q954256) (← 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)
- Preemptive scheduling in the presence of transportation times (Q1010294) (← links)
- A note on online strip packing (Q1029271) (← 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)
- Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion (Q2149611) (← links)
- Approximation algorithms for energy-efficient scheduling of parallel jobs (Q2215201) (← links)
- Improved lower bound for online strip packing (Q2344211) (← links)
- A tight analysis of Brown-Baker-Katseff sequences for online strip packing (Q2392732) (← links)
- A fuzzy random resource-constrained scheduling model with~multiple projects and its application to a working procedure in a large-scale water conservancy and hydropower construction project (Q2434282) (← links)
- Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems (Q2633602) (← links)
- Coordination Mechanisms for Selfish Parallel Jobs Scheduling (Q2898033) (← 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)
- Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms (Q3453298) (← 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)
- An improved approximation algorithm for scheduling monotonic moldable tasks (Q6106483) (← links)
- Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms (Q6136082) (← links)