Pages that link to "Item:Q1278298"
From MaRDI portal
The following pages link to Scheduling multiprocessor tasks with chain constraints (Q1278298):
Displaying 14 items.
- A note on scheduling multiprocessor tasks with precedence constraints on parallel processors (Q287150) (← links)
- Scheduling three chains on two parallel machines (Q1040986) (← links)
- Scheduling with semaphore constraints (Q1096534) (← links)
- Chains and trees: `Strong' -- `weak' order in job scheduling (Q1267547) (← links)
- Scheduling multiprocessor tasks on parallel processors with limited availability. (Q1399581) (← links)
- Scheduling groups of tasks with precedence constraints on three dedicated processors. (Q1421466) (← links)
- Linear and quadratic algorithms for scheduling chains and opposite chains (Q1600834) (← links)
- Scheduling chained multiprocessor tasks onto large multiprocessor system (Q1700868) (← links)
- Scheduling chain-structured tasks to minimize makespan and mean flow time (Q1814098) (← links)
- Packing-based branch-and-bound for discrete malleable task scheduling (Q2093190) (← links)
- Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width (Q2436669) (← links)
- Scheduling multiprocessor tasks on two parallel processors (Q3148375) (← links)
- CHAIN STRUCTURES IN SCHEDULES TASKS (Q5150747) (← links)
- APPROXIMATION SCHEMES FOR SCHEDULING JOBS WITH CHAIN PRECEDENCE CONSTRAINTS (Q5187850) (← links)
