Name
hu — is scheduling algorithm for P|in-tree,pj=1|Cmax problem (can be called on labeled taskset with problem P2|prec,pj=1|Cmax )
Synopsis
TS = HU(T, prob, m)
TS = HU(T, prob, m, verbose)
TS = HU(T, prob, m, options)
Webmaster - Jan Dvořák (2004 - 2025)