Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
From MaRDI portal
Cited in
(62)- Coordination mechanisms for selfish scheduling
- A new heuristic for task scheduling in heterogeneous computing environment
- Worst-case analysis of a scheduling algorithm
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines
- An asymptotically exact polynomial algorithm for equipartition problems
- Heuristics for unrelated machine scheduling with precedence constraints
- Feasibility of scheduling lot sizes of two frequencies on one machine
- Unrelated parallel machine scheduling using local search
- A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search
- Exact and approximation algorithms for makespan minimization on unrelated parallel machines
- Task scheduling using two-phase variable neighborhood search algorithm on heterogeneous computing and grid environments
- A strategy optimization approach for mission deployment in distributed systems
- ZENTURIO: a grid service-based tool for optimising parallel and grid applications
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
- A cutting plane algorithm for the unrelated parallel machine scheduling problem
- Coordination mechanisms for parallel machine scheduling
- Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs
- Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs
- Heuristics for scheduling unrelated parallel machines
- A note on the lower bound for the price of anarchy of scheduling games on unrelated machines
- Priority-grouping method for parallel multi-scheduling in grid
- The shortest first coordination mechanism for a scheduling game with parallel-batching machines
- Efficient coordination mechanisms for unrelated machine scheduling
- Implementation of optimal schedules in outsourcing with identical suppliers
- The price of anarchy for utilitarian scheduling games on related machines
- A note on posterior tight worst-case bounds for longest processing time schedules
- Heuristics and augmented neural networks for task scheduling with non-identical machines
- Inefficiency of Nash equilibria with parallel processing policy
- Artificial life techniques for load balancing in computational grids
- An optimal rounding gives a better approximation for scheduling unrelated machines
- Decentralized utilitarian mechanisms for scheduling games
- Strategic scheduling games: equilibria and efficiency
- Multiobjective evolutionary algorithms for energy and service level scheduling in a federation of distributed datacenters
- The price of multi-organization constraint in unrelated parallel machine scheduling
- A comparison of random task graph generation methods for scheduling problems
- Static scheduling of directed acyclic data flow graphs onto multiprocessors using particle swarm optimization
- An efficient implementation of the Min-Min heuristic
- Adaptive online scheduling of tasks with anytime property on heterogeneous resources
- Optimal coordination mechanisms for unrelated machine scheduling
- scientific article; zbMATH DE number 8821 (Why is no real title available?)
- Coordination mechanisms with hybrid local policies
- NP-Complete operations research problems and approximation algorithms
- Approximation scheduling algorithms: a survey
- A hybrid branch-and-bound and evolutionary approach for allocating strings of applications to heterogeneous distributed computing systems
- Static heuristics for robust resource allocation of continuously executing applications
- Stochastic robustness metric and its use for static resource allocations
- Scheduling in a dynamic heterogeneous distributed system using estimation error
- Static resource allocation for heterogeneous computing environments with tasks having dependencies, priorities, deadlines, and multiple versions
- A PC-based production scheduling system using a mixed integer programming approach
- Probabilistic resource allocation in heterogeneous distributed systems with random failures
- scientific article; zbMATH DE number 849179 (Why is no real title available?)
- Unrelated parallel machine scheduling -- perspectives and progress
- A coordination mechanism for a scheduling game with parallel-batching machines
- Performance of the LPT algorithm in multiprocessor scheduling
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
- Environment-conscious scheduling of HPC applications on distributed cloud-oriented data centers
- Joint task assignment and cache partitioning with cache locking for WCET minimization on MPSoC
- Non-clairvoyant scheduling games
- Multi-heuristic dynamic task allocation using genetic algorithms in a heterogeneous distributed system
- Coordination mechanisms on unrelated machines with arbitrary priority lists
- An improved bound for the price of anarchy for related machine scheduling
- Iterated greedy local search methods for unrelated parallel machine scheduling
This page was built for publication: Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4160662)
