Scheduling multiprocessor tasks -- An overview
From MaRDI portal
Publication:1278297
DOI10.1016/0377-2217(96)00123-3zbMath0949.68506OpenAlexW1998948241WikidataQ94701697 ScholiaQ94701697MaRDI QIDQ1278297
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(96)00123-3
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
A note on scheduling multiprocessor tasks with precedence constraints on parallel processors, Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications, Scheduling with conflicts: Online and offline algorithms, Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms, Maximizing the throughput of parallel jobs on hypercubes, Increasing the revenue of self-storage warehouses by optimizing order scheduling, Reliability of fault-tolerant systems with parallel task processing, Models and complexity of multibin packing problems, On-line scheduling mesh jobs with dependencies, A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks, On the complexity of adjacent resource scheduling, Scheduling parallel jobs to minimize the makespan, On excessive index of certain networks, Graph multi-coloring for a job scheduling application, A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring, Scheduling multiprocessor tasks on parallel processors with limited availability., Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop., On maximizing the throughput of multiprocessor tasks., Optimal workforce assignment to operations of a paced assembly line, Hybrid flow-shop scheduling problems with multiprocessor task systems., Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width, Complexity and approximation results for scheduling multiprocessor tasks on a ring., A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks, Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires, Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements, Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates, Scheduling multiprocessor tasks for mean flow time criterion, PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS, Handling precedence constraints in scheduling problems by the sequence pair representation, On-line scheduling of parallel jobs in a list, Scheduling malleable tasks with interdependent processing rates: comments and observations, A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints, A projective algorithm for preemptive open shop scheduling with two multiprocessor groups, New applications of the Muntz and Coffman algorithm, A Lagrangian heuristic for satellite range scheduling with resource constraints, Approximation algorithms for two-stage flexible flow shop scheduling, On Multi-product Lot-Sizing and Scheduling with Multi-machine Technologies, Scheduling DAGs with random parallel tasks on binarily partitionable systems, Computational complexity of some scheduling problems with multiprocessor tasks, Heuristic algorithms for a complex parallel machine scheduling problem, Scheduling multiprocessor UET tasks of two sizes, An exact method for minimizing the makespan of an application processed on a master slave bus oriented multiprocessor system, A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis, Scheduling multiprocessor tasks on two parallel processors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling independent two processor tasks on a uniform duo-processor system
- List scheduling of parallel tasks
- Scheduling independent 2-processor tasks to minimize schedule length
- Preemptive scheduling of independent jobs with release times and deadlines on a hypercube
- An \(O(n \log n)\) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube
- Multiprocessor scheduling with communication delays
- Scheduling subject to resource constraints: Classification and complexity
- UET scheduling with unit interprocessor communication delays
- On a scheduling problem where a job can be executed only by a limited number of processors
- The complexity of scheduling independent two-processor tasks on dedicated processors
- Preemptive scheduling of independent jobs on a hypercube
- Scheduling unit-time jobs on processors with different capabilities
- Scheduling independent jobs on partitionable hypercubes
- Scheduling on a hypercube
- UET-scheduling with constrained processor allocations
- Gang scheduling performance benefits for fine-grain synchronization
- Models and algorithms for coscheduling compute-intensive tasks on a network of workstations
- Scheduling parallel I/O operations in multiple bus systems
- Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
- Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
- Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors
- Scheduling independent multiprocessor tasks on a uniform \(k\)-processor system
- Corrigendum to: ``Scheduling multiprocessor tasks on three dedicated processors
- Tree scheduling with communication delays
- Complexity of scheduling multiprocessor tasks with prespecified processors allocations
- Real-time scheduling of linear speedup parallel tasks
- On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs
- Preemptive multiprocessor task scheduling with release times and time windows
- Scheduling parallel tasks with sequential heads and tails
- Scheduling multiprocessor tasks on hypercubes
- An approximation algorithm for scheduling on three dedicated machines
- Shop scheduling problems with multiprocessor tasks on dedicated processors
- Scheduling independent tasks with multiple modes
- Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors
- On the complexity of multiprocessor task scheduling
- Deadline scheduling of multiprocessor tasks
- Scheduling with constrained processor allocation for interval orders
- Scheduling File Transfers
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
- Simultaneous Resource Scheduling to Minimize Weighted Flow Times
- Complexity of Scheduling Parallel Task Systems
- Concurrent Task Systems
- C.P.M. Scheduling with Small Communication Delays and Task Duplication
- A Heuristic of Scheduling Parallel Tasks and Its Analysis
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Application scheduling and processor allocation in multiprogrammed parallel processing systems
- Scheduling preemptive multiprocessor tasks on dedicated processors
- Nonpreemptive scheduling of independent tasks with prespecified processor allocations
- Characterization of Connection Assignment of Diagnosable Systems
- Minimization of the maximum delay in servicing systems with interruption
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
- The STAR (Self-Testing And Repairing) Computer: An Investigation of the Theory and Practice of Fault-Tolerant Computer Design
