Pages that link to "Item:Q1278297"
From MaRDI portal
The following pages link to Scheduling multiprocessor tasks -- An overview (Q1278297):
Displaying 41 items.
- A note on scheduling multiprocessor tasks with precedence constraints on parallel processors (Q287150) (← links)
- Increasing the revenue of self-storage warehouses by optimizing order scheduling (Q322833) (← links)
- On excessive index of certain networks (Q391312) (← links)
- Handling precedence constraints in scheduling problems by the sequence pair representation (Q511691) (← links)
- A Lagrangian heuristic for satellite range scheduling with resource constraints (Q716351) (← links)
- Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications (Q835582) (← links)
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- Maximizing the throughput of parallel jobs on hypercubes (Q846023) (← links)
- Reliability of fault-tolerant systems with parallel task processing (Q856235) (← links)
- Models and complexity of multibin packing problems (Q864931) (← links)
- On-line scheduling mesh jobs with dependencies (Q870843) (← links)
- A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks (Q880507) (← links)
- On the complexity of adjacent resource scheduling (Q880528) (← links)
- Scheduling parallel jobs to minimize the makespan (Q880560) (← links)
- Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements (Q924628) (← links)
- On-line scheduling of parallel jobs in a list (Q954256) (← links)
- A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints (Q967430) (← links)
- A projective algorithm for preemptive open shop scheduling with two multiprocessor groups (Q969520) (← links)
- Computational complexity of some scheduling problems with multiprocessor tasks (Q1019301) (← links)
- Heuristic algorithms for a complex parallel machine scheduling problem (Q1022398) (← links)
- Scheduling multiprocessor UET tasks of two sizes (Q1034607) (← links)
- An exact method for minimizing the makespan of an application processed on a master slave bus oriented multiprocessor system (Q1293189) (← links)
- Scheduling multiprocessor tasks on parallel processors with limited availability. (Q1399581) (← links)
- Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. (Q1399584) (← links)
- On maximizing the throughput of multiprocessor tasks. (Q1401335) (← links)
- Hybrid flow-shop scheduling problems with multiprocessor task systems. (Q1410328) (← links)
- Complexity and approximation results for scheduling multiprocessor tasks on a ring. (Q1417558) (← links)
- Graph multi-coloring for a job scheduling application (Q1686066) (← links)
- Optimal workforce assignment to operations of a paced assembly line (Q1694335) (← links)
- A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis (Q1866998) (← links)
- Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires (Q1959184) (← links)
- Scheduling multiprocessor tasks for mean flow time criterion (Q1977621) (← links)
- Approximation algorithms for two-stage flexible flow shop scheduling (Q2292124) (← links)
- Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width (Q2436669) (← links)
- Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates (Q2459394) (← links)
- Scheduling malleable tasks with interdependent processing rates: comments and observations (Q2476250) (← links)
- On Multi-product Lot-Sizing and Scheduling with Multi-machine Technologies (Q2806947) (← links)
- Scheduling multiprocessor tasks on two parallel processors (Q3148375) (← links)
- Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms (Q3453298) (← links)
- A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks (Q3527950) (← links)
- A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring (Q6047981) (← links)
