Pages that link to "Item:Q1343144"

The following pages link to Complexity of scheduling multiprocessor tasks with prespecified processors allocations (Q1343144):

Displaying 34 items.

• Scheduling problem with multi-purpose parallel machines (Q496686) (← links)
• Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications (Q835582) (← links)
• A simple linear time approximation algorithm for multi-processor job scheduling on four processors (Q867026) (← links)
• On the complexity of adjacent resource scheduling (Q880528) (← links)
• Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems (Q1266535) (← links)
• Scheduling multiprocessor tasks -- An overview (Q1278297) (← links)
• Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors (Q1278299) (← links)
• A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags (Q1293191) (← links)
• Efficiency and effectiveness of normal schedules on three dedicated processors (Q1356693) (← links)
• Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors (Q1372768) (← links)
• On maximizing the throughput of multiprocessor tasks. (Q1401335) (← links)
• An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems (Q1607020) (← links)
• On spectrum assignment in elastic optical tree-networks (Q1730219) (← links)
• An approximation algorithm for scheduling on three dedicated machines (Q1897367) (← links)
• Shop scheduling problems with multiprocessor tasks on dedicated processors (Q1897372) (← links)
• Discrete optimization with polynomially detectable boundaries and restricted level sets (Q1944392) (← links)
• Processor bounding for an efficient non-preemptive task scheduling algorithm (Q2009223) (← links)
• Multistage stochastic programming approach for joint optimization of job scheduling and material ordering under endogenous uncertainties (Q2029905) (← links)
• Minimizing total completion time in multiprocessor job systems with energy constraint (Q2117638) (← links)
• Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion (Q2149611) (← links)
• A polynomial algorithm for some preemptive multiprocessor task scheduling problems (Q2432888) (← links)
• Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates (Q2459394) (← links)
• Minimum sum multicoloring on the edges of trees (Q2503344) (← links)
• Open block scheduling in optical communication networks (Q2503353) (← links)
• Scheduling: agreement graph vs resource constraints (Q2629638) (← links)
• On Multi-product Lot-Sizing and Scheduling with Multi-machine Technologies (Q2806947) (← links)
• Scheduling on parallel machines considering job-machine dependency constraints (Q2883591) (← links)
• On minimizing dataset transfer time in an acyclic network with four servers (Q2959189) (← links)
• Scheduling multiprocessor tasks on two parallel processors (Q3148375) (← links)
• Lower bound algorithms for multiprocessor task scheduling with ready times (Q3410325) (← links)
• Nonpreemptive scheduling of independent tasks with prespecified processor allocations (Q4319223) (← links)
• The complexity of path coloring and call scheduling (Q5941061) (← links)
• Comparability graph augmentation for some multiprocessor scheduling problems (Q5961606) (← links)
• A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring (Q6047981) (← links)