Priority algorithms for makespan minimization in the subset model.
From MaRDI portal
Publication:1853127
DOI10.1016/S0020-0190(02)00264-8zbMath1042.68019MaRDI QIDQ1853127
Publication date: 21 January 2003
Published in: Information Processing Letters (Search for Journal in Brave)
68W05: Nonnumerical algorithms
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Advice complexity of priority algorithms, Advice complexity of adaptive priority algorithms, Toward a model for backtracking and dynamic programming, Limitations of incremental dynamic programming, A stronger model of dynamic programming algorithms, Hierarchies for classes of priority algorithms for job scheduling, Characterizing sets of jobs that admit optimal greedy-like algorithms, Randomized priority algorithms, Priority algorithms for the subset-sum problem, On the Structure of Optimal Greedy Computation (for Job Scheduling)
Cites Work