A note on LPT scheduling
From MaRDI portal
Publication:5903677
DOI10.1016/0167-6377(88)90069-7zbMath0647.90043OpenAlexW1970146973MaRDI QIDQ5903677
Publication date: 1988
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(88)90069-7
independent tasksworst case boundlongest processing time-firstLPT-algortihmparallel, uniform processors
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
This page was built for publication: A note on LPT scheduling