scientific article; zbMATH DE number 2086932
From MaRDI portal
Publication:4737537
zbMATH Open1049.90025MaRDI QIDQ4737537FDOQ4737537
Authors: Lorant Porkolab, Klaus Jansen 
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2337/23370329.htm
Title of this publication is not available (Why is that?)
Recommendations
- On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes
- Approximation algorithms for scheduling with resource and precedence constraints
- scientific article; zbMATH DE number 3898230
- Precedence constrained scheduling: A case in \({\mathbf P}\)
- An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems
- On the complexity of interval scheduling with a resource constraint
- scientific article; zbMATH DE number 4149886
- APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS
- scientific article; zbMATH DE number 1875414
- A monotone approximation algorithm for scheduling with precedence constraints
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Cited In (12)
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
- Scheduling with an orthogonal resource constraint
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
- A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays
- Linear programming based algorithms for preemptive and non-preemptive RCPSP
- An approximation algorithm for the general max-min resource sharing problem
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling.
- Preemptive scheduling of interval orders is polynomial
- On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes
- An applicable method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources
- Bounding the Power of Preemption in Randomized Scheduling
- The preemptive resource allocation problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737537)
