Scheduling jobs on heterogeneous processors
From MaRDI portal
Publication:2638924
DOI10.1007/BF02283615zbMath0717.90036OpenAlexW1991992568MaRDI QIDQ2638924
Publication date: 1991
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02283615
weighted flow timeweighted number of tardy jobsnonpreemptive schedulingweighted cost functions of job completion timesweighted discounted flowtime
Related Items (3)
Scheduling jobs on heterogeneous processors ⋮ A case for on-machine load balancing ⋮ Managing Queues with Heterogeneous Servers
Cites Work
- Unnamed Item
- Unnamed Item
- A note on Optimal control of a queueing system with two heterogeneous servers
- Job scheduling to minimize expected weighted flowtime on uniform processors
- Scheduling jobs on heterogeneous processors
- Necessary optimality conditions for priority policies in stochastic weighted flowtime scheduling problems
- Scheduling tasks with exponential service times on parallel processors
- A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors
- Optimal control of a queueing system with two heterogeneous servers
- The Stochastic Sequential Assignment Problem With Random Deadlines
- Individually optimal routing in parallel systems
- Minimizing expected makespans on uniform processor systems
- On the optimality of static priority policies in stochastic scheduling on parallel machines
- Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
- Approximating the Mean Time in System in a Multiple-Server Queue that Uses Threshold Scheduling
- Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions
- On the optimal assignment of servers and a repairman
- Scheduling jobs by stochastic processing requirements on parallel machines to minimize makespan or flowtime
- Scheduling of stochastic tasks on two parallel processors
- Applying a New Device in the Optimization of Exponential Queuing Systems
- A Sequential Stochastic Assignment Problem
- Stochastically maximizing the number of successes in a sequential assignment problem
This page was built for publication: Scheduling jobs on heterogeneous processors