Priority algorithms for makespan minimization in the subset model.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 2119736 (Why is no real title available?)
- An approximation algorithm for the generalized assignment problem
- Approximation algorithms for scheduling unrelated parallel machines
- The Competitiveness of On-Line Assignments
Cited in
(12)- Characterizing sets of jobs that admit optimal greedy-like algorithms
- Priority algorithms for the subset-sum problem
- Toward a model for backtracking and dynamic programming
- A stronger model of dynamic programming algorithms
- On the Structure of Optimal Greedy Computation (for Job Scheduling)
- Advice complexity of adaptive priority algorithms
- (Incremental) priority algorithms
- Priority Algorithms for the Subset-Sum Problem
- scientific article; zbMATH DE number 2119736 (Why is no real title available?)
- Limitations of incremental dynamic programming
- Hierarchies for classes of priority algorithms for job scheduling
- Randomized priority algorithms
This page was built for publication: Priority algorithms for makespan minimization in the subset model.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853127)