Makespan of a batch of partitionable tasks
From MaRDI portal
Publication:5483791
zbMATH Open1115.68412MaRDI QIDQ5483791FDOQ5483791
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Recommendations
- Scheduling malleable tasks on parallel processors to minimize the makespan
- scientific article; zbMATH DE number 1234084
- Optimal Scheduling of Tasks on Identical Parallel Processors
- scientific article; zbMATH DE number 3941253
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
This page was built for publication: Makespan of a batch of partitionable tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5483791)
