A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints
DOI10.1007/978-3-540-93980-1_9zbMATH Open1209.90187OpenAlexW2138846348MaRDI QIDQ3602833FDOQ3602833
Authors: 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
Recommendations
Deterministic scheduling theory in operations research (90B35) Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Online algorithms. The state of the art
- Bounds for Certain Multiprocessing Anomalies
- Scheduling algorithms
- Structure of a simple scheduling polyhedron
- Title not available (Why is that?)
- Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
- Title not available (Why is that?)
- STACS 2004
- STACS 2005
- A monotone approximation algorithm for scheduling with precedence constraints
- Algorithms – ESA 2005
- Structural Information and Communication Complexity
Cited In (7)
- Deterministic monotone algorithms for scheduling on related machines
- An improved monotone algorithm for scheduling related machines with precedence constraints
- Scheduling with bully selfish jobs
- A monotone approximation algorithm for scheduling with precedence constraints
- Multistage interval scheduling games
- Approximation and Online Algorithms
- Algorithms – ESA 2005
This page was built for publication: A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602833)
