LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times
DOI10.1007/11830924_15zbMATH Open1155.90382OpenAlexW2137652805MaRDI QIDQ3595396FDOQ3595396
Authors: Alexander Grigoriev, Maxim Sviridenko, Marc Uetz 
Publication date: 28 August 2007
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11830924_15
Recommendations
- Machine scheduling with resource dependent processing times
- Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times
- A unified approach to scheduling on unrelated parallel machines
- An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
- Approximation and Online Algorithms
Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cited In (8)
- Production, maintenance and resource scheduling: a review
- Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times
- Machine scheduling with resource dependent processing times
- Approximation algorithms for scheduling on multi-core processor with shared speedup resources
- Scheduling jobs with time-resource tradeoff via nonlinear programming
- Resource Minimization Job Scheduling
- LP rounding and combinatorial algorithms for minimizing active and busy time
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods
This page was built for publication: LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595396)
