Pages that link to "Item:Q4238573"
From MaRDI portal
The following pages link to General multiprocessor task scheduling (Q4238573):
Displaying 25 items.
- Multitasking via alternate and shared processing: algorithms and complexity (Q284835) (← links)
- An effective approximation algorithm for the malleable parallel task scheduling problem (Q433456) (← links)
- A job-shop problem with one additional resource type (Q640303) (← links)
- A Lagrangian heuristic for satellite range scheduling with resource constraints (Q716351) (← links)
- Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions (Q835601) (← links)
- Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search (Q846170) (← links)
- Mass customization in videotape duplication and conversion: challenges of flexible duplication systems, fast delivery, and electronic service (Q850876) (← links)
- A simple linear time approximation algorithm for multi-processor job scheduling on four processors (Q867026) (← links)
- A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks (Q880507) (← links)
- Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements (Q924628) (← links)
- Scheduling of a single crane in batch annealing process (Q1017463) (← links)
- Deterministic multiprocessor scheduling with multiple objectives (Q1195096) (← links)
- Approximation algorithms for general parallel task scheduling (Q1603514) (← links)
- Graph multi-coloring for a job scheduling application (Q1686066) (← links)
- Shared multi-processor scheduling (Q1753597) (← links)
- A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis (Q1866998) (← links)
- The consecutive multiprocessor job scheduling problem (Q2178063) (← links)
- Shared processor scheduling of multiprocessor jobs (Q2282535) (← links)
- A class of generalized multiprocessor scheduling problems (Q2721956) (← links)
- A polynomial algorithm for multiprocessor scheduling with two job lengths. (Q2757667) (← links)
- A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks (Q3527950) (← links)
- Minimizing makespan in a multimode multiprocessor shop scheduling problem (Q4943556) (← links)
- Heterogeneous Multi-resource Allocation with Subset Demand Requests (Q5057984) (← links)
- The price of anarchy for a berth allocation game (Q6547129) (← links)
- A theoretical and empirical study of job scheduling in cloud computing environments: the weighted completion time minimization problem with capacitated parallel machines (Q6588490) (← links)
