LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times

DOI10.1007/11830924_15MaRDI QIDQ3595396zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

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

Cited in

(9)

• Scheduling jobs with time-resource tradeoff via nonlinear programming
• LP rounding and combinatorial algorithms for minimizing active and busy time
• Approximation algorithms for scheduling on multi-core processor with shared speedup resources
• Production, maintenance and resource scheduling: a review
• Parallel machine scheduling with additional resources: notation, classification, models and solution methods
• Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times
• Resource Minimization Job Scheduling
• A tabu search algorithm for unspecified parallel machine scheduling with shift consideration
• Machine scheduling with resource dependent processing times

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)