Pages that link to "Item:Q3832306"

The following pages link to Complexity of Scheduling Parallel Task Systems (Q3832306):

Displaying 50 items.

• Scheduling malleable tasks with precedence constraints (Q414874) (← links)
• Online multiple-strip packing (Q621841) (← links)
• List scheduling of parallel tasks (Q758191) (← links)
• Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications (Q835582) (← links)
• Maximizing the throughput of parallel jobs on hypercubes (Q846023) (← links)
• Models and complexity of multibin packing problems (Q864931) (← links)
• On-line scheduling mesh jobs with dependencies (Q870843) (← links)
• A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks (Q880507) (← links)
• On the complexity of adjacent resource scheduling (Q880528) (← links)
• Scheduling parallel jobs to minimize the makespan (Q880560) (← links)
• Improved upper bounds for online malleable job scheduling (Q892840) (← links)
• On-line scheduling of parallel jobs in a list (Q954256) (← links)
• A note on online strip packing (Q1029271) (← links)
• Scheduling multiprocessor tasks on three dedicated processors (Q1197982) (← links)
• Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness (Q1261479) (← links)
• Scheduling multiprocessor tasks -- An overview (Q1278297) (← links)
• Scheduling multiprocessor tasks with chain constraints (Q1278298) (← links)
• Complexity of scheduling tasks with time-dependent execution times (Q1334634) (← links)
• Real-time scheduling of linear speedup parallel tasks (Q1350756) (← links)
• Efficiency and effectiveness of normal schedules on three dedicated processors (Q1356693) (← links)
• Distributed processing of divisible jobs with communication startup costs (Q1363737) (← links)
• Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. (Q1399584) (← links)
• Hybrid flow-shop scheduling problems with multiprocessor task systems. (Q1410328) (← links)
• A note on scheduling multiprocessor tasks with identical processing times. (Q1413834) (← links)
• Fairness in parallel job scheduling (Q1588058) (← links)
• Linear and quadratic algorithms for scheduling chains and opposite chains (Q1600834) (← links)
• An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems (Q1607020) (← links)
• Optimal workforce assignment to operations of a paced assembly line (Q1694335) (← links)
• Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors (Q1904737) (← links)
• Deadline scheduling of multiprocessor tasks (Q1917262) (← links)
• Scheduling parallel jobs using migration and consolidation in the cloud (Q1955088) (← links)
• Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models (Q2089685) (← links)
• Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion (Q2149611) (← links)
• A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds (Q2164700) (← links)
• Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width (Q2436669) (← links)
• Competitive online scheduling of perfectly malleable jobs with setup times (Q2467259) (← links)
• A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks (Q2503351) (← links)
• (Q2779606) (← links)
• APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS (Q3021973) (← links)
• Scheduling multiprocessor tasks on two parallel processors (Q3148375) (← links)
• On-line scheduling of parallel jobs (Q5096875) (← links)
• Scheduling and stability aspects of a general class of parallel processing systems (Q5286072) (← links)
• (Q5875469) (← links)
• Bounding the running time of algorithms for scheduling and packing problems (Q5890508) (← links)
• Complexity and inapproximability results for parallel task scheduling and strip packing (Q5915576) (← links)
• On-line scheduling of parallel jobs with runtime restrictions (Q5958714) (← links)
• Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness (Q5961604) (← links)
• Malleable scheduling beyond identical machines (Q6090217) (← links)
• An improved approximation algorithm for scheduling monotonic moldable tasks (Q6106483) (← links)
• Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms (Q6136082) (← links)