Pages that link to "Item:Q1897372"
From MaRDI portal
The following pages link to Shop scheduling problems with multiprocessor tasks on dedicated processors (Q1897372):
Displaying 13 items.
- Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications (Q835582) (← links)
- Feasible insertions in job shop scheduling, short cycles and stable sets (Q856271) (← links)
- A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks (Q880507) (← links)
- Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems (Q1266535) (← links)
- Scheduling multiprocessor tasks -- An overview (Q1278297) (← links)
- Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors (Q1372768) (← links)
- Tabu-search for the multi-mode job-shop problem (Q1384220) (← links)
- Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. (Q1399584) (← links)
- Surgical case scheduling as a generalized job shop scheduling problem (Q2464181) (← links)
- Feasible job insertions in the multi-processor-task job shop (Q2464217) (← links)
- Scheduling multiprocessor tasks on two parallel processors (Q3148375) (← links)
- A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring (Q6047981) (← links)
- Mixed graph colouring as scheduling multi-processor tasks with equal processing times (Q6669643) (← links)
