A composite algorithm for multiprocessor scheduling
From MaRDI portal
Publication:544815
DOI10.1007/s10732-010-9135-1zbMath1214.90059MaRDI QIDQ544815
Giuseppe Paletta, Francesca Vocaturo
Publication date: 16 June 2011
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-010-9135-1
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68W25: Approximation algorithms
Related Items
Partial solutions and multifit algorithm for multiprocessor scheduling, A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A state-of-the-art review of parallel-machine scheduling research
- Improved 0/1-interchange scheduling
- Design and evaluation of tabu search algorithms for multiprocessor scheduling
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
- Applying tabu search with influential diversification to multiprocessor scheduling
- An exact algorithm for the identical parallel machine scheduling problem.
- A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
- Heuristic solution of open bin packing problems
- Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem
- A linear time approximation algorithm for multiprocessor scheduling
- A New Approximation Algorithm for the Nonpreemptive Scheduling of Independent Jobs on Identical Parallel Processors
- An Application of Bin-Packing to Multiprocessor Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimal Scheduling of Tasks on Identical Parallel Processors
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
