A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints
From MaRDI portal
Publication:3602833
DOI10.1007/978-3-540-93980-1_9zbMath1209.90187OpenAlexW2138846348MaRDI QIDQ3602833
Clemens Thielen, Sven O. Krumke
Publication date: 12 February 2009
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-93980-1_9
Deterministic scheduling theory in operations research (90B35) Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25)
Related Items (2)
An improved monotone algorithm for scheduling related machines with precedence constraints ⋮ Multistage interval scheduling games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A monotone approximation algorithm for scheduling with precedence constraints
- Online algorithms. The state of the art
- Structure of a simple scheduling polyhedron
- Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
- STACS 2004
- Algorithms – ESA 2005
- Bounds for Certain Multiprocessing Anomalies
- Structural Information and Communication Complexity
- STACS 2005
This page was built for publication: A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints