Pages that link to "Item:Q1197982"

The following pages link to Scheduling multiprocessor tasks on three dedicated processors (Q1197982):

Displaying 23 items.

• 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)
• New perspectives in scheduling theory (Q892831) (← links)
• Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness (Q1261479) (← links)
• A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags (Q1293191) (← links)
• Complexity of scheduling multiprocessor tasks with prespecified processors allocations (Q1343144) (← 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)
• Hybrid flow-shop scheduling problems with multiprocessor task systems. (Q1410328) (← links)
• Complexity and approximation results for scheduling multiprocessor tasks on a ring. (Q1417558) (← links)
• Scheduling groups of tasks with precedence constraints on three dedicated processors. (Q1421466) (← links)
• An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems (Q1607020) (← links)
• A graph based model for survivability applications (Q1767688) (← links)
• An approximation algorithm for scheduling on three dedicated machines (Q1897367) (← links)
• Shop scheduling problems with multiprocessor tasks on dedicated processors (Q1897372) (← links)
• Scheduling independent tasks with multiple modes (Q1900136) (← links)
• Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors (Q1904737) (← links)
• Processor bounding for an efficient non-preemptive task scheduling algorithm (Q2009223) (← links)
• Scheduling: agreement graph vs resource constraints (Q2629638) (← links)
• On minimizing dataset transfer time in an acyclic network with four servers (Q2959189) (← links)
• Lower bound algorithms for multiprocessor task scheduling with ready times (Q3410325) (← links)
• Scheduling wagons to unload in bulk cargo ports with uncertain processing times (Q6068691) (← links)