An LPT-bound for a parallel multiprocessor scheduling problem

DOI10.1006/jmaa.1995.1405zbMath0842.90059OpenAlexW1988087589MaRDI QIDQ1910052

Farid Harche, Sridhar Seshadri

Publication date: 4 June 1996

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jmaa.1995.1405

zbMATH Keywords

makespanworst-case behavior

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Minimizing labor requirements in a periodic vehicle loading problem