Machine scheduling with resource dependent processing times
From MaRDI portal
Publication:877194
DOI10.1007/s10107-006-0059-3zbMath1192.90073WikidataQ57338964 ScholiaQ57338964MaRDI QIDQ877194
Alexander Grigoriev, Marc Uetz, M. I. Sviridenko
Publication date: 19 April 2007
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://cris.maastrichtuniversity.nl/ws/files/1470765/guid-c1a0e789-9594-4763-ae85-36a7a7f4f440-ASSET1.0.pdf
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68W25: Approximation algorithms
Related Items
Online Scheduling on a CPU-GPU Cluster, Scheduling parallel dedicated machines with the speeding‐up resource, Approximate algorithms for unrelated machine scheduling to minimize makespan, An approximation algorithm for identical parallel machine scheduling with resource dependent processing times, Scheduling jobs with time-resource tradeoff via nonlinear programming, Algorithms for the unrelated parallel machine scheduling problem with a resource constraint, Approximation algorithms for scheduling on multi-core processor with shared speedup resources, Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources, Parallel machine scheduling with speed-up resources, Scheduling on two identical machines with a speed-up resource, Scheduling with an orthogonal resource constraint, Parallel machine scheduling with additional resources: notation, classification, models and solution methods, A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting, Task swapping networks in distributed systems, Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget
Cites Work
- Unnamed Item
- Simultaneous job scheduling and resource allocation on parallel machines
- Approximation algorithms for scheduling unrelated parallel machines
- Scheduling subject to resource constraints: Classification and complexity
- An approximation algorithm for the generalized assignment problem
- Scheduling problems for parallel dedicated machines under multiple resource constraints.
- Scheduling parallel dedicated machines under a single non-shared resource
- Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme
- Approximation schemes for parallel machine scheduling problems with controllable processing times
- Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
- LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times
- Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Approximation and Online Algorithms