Pages that link to "Item:Q4319223"
From MaRDI portal
The following pages link to Nonpreemptive scheduling of independent tasks with prespecified processor allocations (Q4319223):
Displaying 23 items.
- An approximation result for a duo-processor task scheduling problem (Q286992) (← links)
- Graph models for scheduling systems with machine saturation property (Q883067) (← links)
- Almost nonpreemptive schedules (Q922279) (← links)
- Scheduling multiprocessor tasks -- An overview (Q1278297) (← links)
- Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors (Q1278299) (← links)
- Heuristics for multimode scheduling problems with dedicated resources (Q1296081) (← links)
- Multi-resource shop scheduling with resource flexibility (Q1296087) (← links)
- Nearly on line scheduling of preemptive independent tasks (Q1346697) (← 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)
- Scheduling groups of tasks with precedence constraints on three dedicated processors. (Q1421466) (← links)
- Non-preemptive scheduling with setup times: a PTAS (Q1693204) (← links)
- Little-preemptive scheduling on unrelated processors (Q1868263) (← links)
- On non-preemptive scheduling of recurring tasks using inserted idle times (Q1891163) (← 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)
- Solving the resource constrained project scheduling problem with optimization subroutine library (Q1919788) (← links)
- Scheduling: agreement graph vs resource constraints (Q2629638) (← links)
- (Q5708530) (← links)
- Preemptive scheduling with dedicated processors: applications of fractional graph coloring (Q5892097) (← links)
- Comparability graph augmentation for some multiprocessor scheduling problems (Q5961606) (← links)
- Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs (Q6066713) (← links)
