scientific article; zbMATH DE number 1783868
From MaRDI portal
Publication:4546239
zbMath1042.90566MaRDI QIDQ4546239
Publication date: 19 August 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
makespan minimizationHu's algorithmscheduling unit execution time jobstight upper bound for the Brucker-Garey-Johnson algorithm
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)
Related Items (2)
The worst-case analysis of the Garey-Johnson algorithm ⋮ Performance of critical path type algorithms for scheduling on parallel processors
This page was built for publication: