Machine scheduling with resource dependent processing times
From MaRDI portal
Publication:877194
DOI10.1007/S10107-006-0059-3zbMATH Open1192.90073DBLPjournals/mp/GrigorievSU07OpenAlexW2101937070WikidataQ57338964 ScholiaQ57338964MaRDI QIDQ877194FDOQ877194
Authors: Alexander Grigoriev, Marc Uetz, Maxim 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
Recommendations
- Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times
- LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times
- Approximation and Online Algorithms
- An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
- A unified approach to scheduling on unrelated parallel machines
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- An approximation algorithm for the generalized assignment problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Approximation algorithms for scheduling unrelated parallel machines
- Scheduling subject to resource constraints: Classification and complexity
- Approximation algorithms for the discrete time-cost tradeoff problem
- Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme
- A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
- Scheduling problems for parallel dedicated machines under multiple resource constraints.
- Approximation schemes for parallel machine scheduling problems with controllable processing times
- Simultaneous job scheduling and resource allocation on parallel machines
- Scheduling parallel dedicated machines under a single non-shared resource
- Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times
- Approximation and Online Algorithms
Cited In (32)
- LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times
- Production, maintenance and resource scheduling: a review
- Title not available (Why is that?)
- A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting
- Min-max controllable risk problems
- Scheduling with an orthogonal resource constraint
- Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times
- Restricted assignment scheduling with resource constraints
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
- Scheduling on two identical machines with a speed-up resource
- Improved scheduling with a shared resource
- Min‐sum controllable risk problems with concave risk functions of the same value range
- A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions
- Approximate algorithms for unrelated machine scheduling to minimize makespan
- Approximation schemes for machine scheduling with resource (in-)dependent processing times
- Approximation schemes for machine scheduling with resource (in-)dependent processing times
- Approximation algorithms for parallel machine scheduling with speed-up resources
- Task swapping networks in distributed systems
- Related machine scheduling with machine speeds satisfying linear constraints
- 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
- Time-sharing scheduling with tolerance capacities
- SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE
- Online Scheduling on a CPU-GPU Cluster
- Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget
- Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost
- Scheduling parallel dedicated machines with the speeding-up resource
- Algorithms for the unrelated parallel machine scheduling problem with a resource constraint
- An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
- Parallel machine scheduling with speed-up resources
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods
This page was built for publication: Machine 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 Q877194)
