On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines
From MaRDI portal
(Redirected from On the optimality of the TLS algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines)
On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines
On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.
