A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints

From MaRDI portal
Publication:714856

DOI10.1016/J.TCS.2012.07.009zbMath1252.68052OpenAlexW1998658360MaRDI QIDQ714856

Wenhua Li, Junling Yuan, Jinjiang Yuan

Publication date: 11 October 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.07.009




Related Items (1)




Cites Work




This page was built for publication: A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints