Priority algorithms for makespan minimization in the subset model.

DOI10.1016/S0020-0190(02)00264-8zbMath1042.68019MaRDI QIDQ1853127

Oded Regev

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

SchedulingApproximation algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (10)

Hierarchies for classes of priority algorithms for job scheduling ⋮ On the Structure of Optimal Greedy Computation (for Job Scheduling) ⋮ Advice complexity of adaptive priority algorithms ⋮ Toward a model for backtracking and dynamic programming ⋮ Limitations of incremental dynamic programming ⋮ Characterizing sets of jobs that admit optimal greedy-like algorithms ⋮ A stronger model of dynamic programming algorithms ⋮ Randomized priority algorithms ⋮ Advice complexity of priority algorithms ⋮ Priority algorithms for the subset-sum problem

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• An approximation algorithm for the generalized assignment problem
• The Competitiveness of On-Line Assignments

This page was built for publication: Priority algorithms for makespan minimization in the subset model.