Scheduling multiprocessor tasks on parallel processors with limited availability.
DOI10.1016/S0377-2217(02)00760-9zbMATH Open1033.90033DBLPjournals/eor/BlazewiczDDM03OpenAlexW2009097977WikidataQ57387807 ScholiaQ57387807MaRDI QIDQ1399581FDOQ1399581
Authors: Jacek Blazewicz, Paolo Dell'Olmo, M. Drozdowski, Przemysław Mączka 
Publication date: 30 July 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00760-9
Recommendations
- Scheduling preemptable tasks on parallel processors with limited availability
- Multiprocessor scheduling with availability constraints
- scientific article; zbMATH DE number 4072695
- Parallel Processor Scheduling with Limited Number of Preemptions
- Multiprocessor scheduling with machine allotment and parallelism constraints
- scientific article; zbMATH DE number 838793
- scientific article; zbMATH DE number 1979517
- Parallel processor scheduling with delay constraints
- Scheduling on parallel processors with varying processing times
parallel computingschedulingtime windowsparallel tasksbandwidth allocationmultiprocessor tasksSchedulingco-schedulinggang
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Machine scheduling with availability constraints
- Scheduling with limited machine availability
- Scheduling multiprocessor tasks -- An overview
- Scheduling multiprocessor tasks with chain constraints
- Scheduling with deadlines and loss functions
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
- Multiprocessor scheduling with communication delays
- Preemptive Scheduling of Uniform Processor Systems
- Preemptive scheduling with variable profile, precedence constraints and due dates
- Scheduling on semi-identical processors
- Bin packing with divisible item sizes
- Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
- On the complexity of multiprocessor task scheduling
- Scheduling independent multiprocessor tasks on a uniform \(k\)-processor system
- Scheduling UET task systems with concurrency on two parallel identical processors
- Scheduling multiprocessor tasks on hypercubes
- Bandwidth Allocation with Preemption
- Evaluation of design choices for gang scheduling using distributed hierarchical control
- Title not available (Why is that?)
Cited In (13)
- Parallel machine scheduling with machine availability and eligibility constraints
- Scheduling multiprocessor tasks on two parallel processors
- Scalable scheduling for symmetric multiprocessors (SMP).
- A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
- On a scheduling problem where a job can be executed only by a limited number of processors
- Scheduling multiprocessor tasks in presence of correlated failures.
- Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays
- Scheduling on semi-identical processors
- An online scheduling of two type parallel jobs on identical machines
- Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
- An FPTAS of minimizing total weighted completion time on single machine with position constraint
- Reliability of fault-tolerant systems with parallel task processing
- Multiprocessor scheduling with availability constraints
This page was built for publication: Scheduling multiprocessor tasks on parallel processors with limited availability.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399581)
