A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria

DOI10.1016/j.cor.2011.08.007zbMath1251.90126OpenAlexW2050314922MaRDI QIDQ1762126

Johnny C. Ho, Anthony Cossari, Giuseppe Paletta, Alex J. Ruiz-Torres

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.08.007

zbMATH Keywords

heuristicsparallel machines schedulingnormalized sum of square for workload deviationsstatistical measures of dispersion

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Improved algorithms to minimize workload balancing criteria on identical parallel machines ⋮ A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A composite algorithm for multiprocessor scheduling
• Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines
• Scheduling jobs with equal processing times and time windows on identical parallel machines
• A state-of-the-art review of parallel-machine scheduling research
• A new modeling and solution approach for the number partitioning problem
• Exact and approximate algorithms for high-multiplicity parallel machine scheduling
• Multiprocessor scheduling: Combining LPT and MULTIFIT
• Applying tabu search with influential diversification to multiprocessor scheduling
• A Short Note on an Advance in Estimating the Worst-Case Performance Ratio of the MPS Algorithm
• 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
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria