Improved algorithms to minimize workload balancing criteria on identical parallel machines

DOI10.1016/j.cor.2018.01.018zbMath1391.90313OpenAlexW2792318737MaRDI QIDQ1652586

Rico Walter, Stefan Schwerdfeger

Publication date: 11 July 2018

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

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

zbMATH Keywords

heuristicsschedulingidentical parallel machinesexact algorithmsworkload balancingNSSWD-criterion

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines
• A performance guarantee for the greedy set-partitioning algorithm
• A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria
• Improved approaches to the exact solution of the machine covering problem
• Tight bounds for the identical parallel machine scheduling problem
• Optimal Scheduling of Tasks on Identical Parallel Processors