scientific article; zbMATH DE number 1305441
From MaRDI portal
Publication:4252325
zbMath0944.90028MaRDI QIDQ4252325
Publication date: 17 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Parallel numerical computation (65Y05)
Related Items
Scheduling parallel jobs to minimize the makespan ⋮ Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks ⋮ Improved results for scheduling batched parallel jobs by using a generalized analysis framework ⋮ Parallel scheduling problems in next generation wireless networks ⋮ On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems ⋮ An approximation algorithm for scheduling trees of malleable tasks