Machine scheduling with resource dependent processing times
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
- An approximation algorithm for the generalized assignment problem
- Approximation algorithms for scheduling unrelated parallel machines
- Approximation algorithms for the discrete time-cost tradeoff problem
- Approximation and Online Algorithms
- Approximation schemes for parallel machine scheduling problems with controllable processing times
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme
- Scheduling parallel dedicated machines under a single non-shared resource
- Scheduling problems for parallel dedicated machines under multiple resource constraints.
- Scheduling subject to resource constraints: Classification and complexity
- Simultaneous job scheduling and resource allocation on parallel machines
- Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times
Cited in
(32)- Approximation schemes for machine scheduling with resource (in-)dependent processing times
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods
- Approximation schemes for machine scheduling with resource (in-)dependent processing times
- Time-sharing scheduling with tolerance capacities
- Online Scheduling on a CPU-GPU Cluster
- LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times
- 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
- Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget
- Algorithms for the unrelated parallel machine scheduling problem with a resource constraint
- Improved scheduling with a shared resource
- A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions
- A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting
- Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost
- Approximation algorithms for parallel machine scheduling with speed-up resources
- Scheduling with an orthogonal resource constraint
- Approximate algorithms for unrelated machine scheduling to minimize makespan
- Approximation algorithms for scheduling on multi-core processor with shared speedup resources
- Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times
- Task swapping networks in distributed systems
- Scheduling jobs with time-resource tradeoff via nonlinear programming
- Min‐sum controllable risk problems with concave risk functions of the same value range
- Scheduling parallel dedicated machines with the speeding-up resource
- scientific article; zbMATH DE number 1082109 (Why is no real title available?)
- Min-max controllable risk problems
- Restricted assignment scheduling with resource constraints
- An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
- Resource Minimization Job Scheduling
- Production, maintenance and resource scheduling: a review
- Related machine scheduling with machine speeds satisfying linear constraints
- SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE
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)
