Pages that link to "Item:Q1356693"
From MaRDI portal
The following pages link to Efficiency and effectiveness of normal schedules on three dedicated processors (Q1356693):
Displaying 7 items.
- A simple linear time approximation algorithm for multi-processor job scheduling on four processors (Q867026) (← links)
- Graph models for scheduling systems with machine saturation property (Q883067) (← links)
- Scheduling groups of tasks with precedence constraints on three dedicated processors. (Q1421466) (← links)
- An approximation result for the interval coloring problem on claw-free chordal graphs (Q1613366) (← links)
- Lower bound algorithms for multiprocessor task scheduling with ready times (Q3410325) (← links)
- Comparability graph augmentation for some multiprocessor scheduling problems (Q5961606) (← links)
- Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs (Q6066713) (← links)