Pages that link to "Item:Q1034607"
From MaRDI portal
The following pages link to Scheduling multiprocessor UET tasks of two sizes (Q1034607):
Displaying 8 items.
- Scheduling UET-UCT tasks: Branch-and-bound search in the priority space (Q622602) (← links)
- UET-scheduling with constrained processor allocations (Q1185984) (← links)
- An iterative algorithm for scheduling UET tasks with due dates and release times. (Q1399585) (← links)
- Scheduling UET task systems with concurrency on two parallel identical processors (Q1401638) (← links)
- A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness (Q1404273) (← links)
- A note on scheduling multiprocessor tasks with identical processing times. (Q1413834) (← links)
- (Q4843446) (← links)
- A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring (Q6047981) (← links)