On the Asymptotic Optimality of Multiprocessor Scheduling Heuristics for the Makespan Minimization Problem

DOI10.1287/ijoc.7.2.201zbMath0859.90083OpenAlexW2128392441MaRDI QIDQ4896447

Joseph Y.-T. Leung, Sunan Han, Dawei Hong

Publication date: 10 April 1997

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.7.2.201

zbMATH Keywords

multiprocessor scheduling problemasymptotic performance of heuristic algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

List scheduling algorithms to minimize the makespan on identical parallel machines

This page was built for publication: On the Asymptotic Optimality of Multiprocessor Scheduling Heuristics for the Makespan Minimization Problem