Approximation schemes for parallel machine scheduling with non-renewable resources
From MaRDI portal
Recommendations
- A PTAS for a resource scheduling problem with arbitrary number of parallel machines
- Approximability of scheduling problems with resource consuming jobs
- Approximation schemes for single machine scheduling with non-renewable resource constraints
- Job Shop Scheduling under a Non-Renewable Resource Constraint
- New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
- Approximability of scheduling problems with resource consuming jobs
- Approximability of total weighted completion time with resource consuming jobs
- Approximation algorithms for inventory constrained scheduling on a single machine
- Approximation schemes for single machine scheduling with non-renewable resource constraints
- Basic scheduling problems with raw material constraints
- Complexity of single machine scheduling subject to nonnegative inventory constraints
- Exact algorithms for inventory constrained scheduling on a single machine
- Khachiyan’s algorithm for linear programming
- Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints
- On a resource-constrained scheduling problem with application to distributed systems reconfiguration
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling with a convex resource consumption function
- Polynomial algorithms for single machine scheduling problems with financial constraints
- Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
- Project scheduling with inventory constraints
- Reductions between scheduling problems with non-renewable resources and knapsack problems
- Resource management in machine scheduling problems: a survey
- Scheduling subject to nonrenewable-resource constraints
- Scheduling under a Non-renewable Resource Constraint
- Single machine scheduling problems with financial resource constraints: some complexity results and properties
- The design of approximation algorithms
- Uniform parallel machine scheduling with resource consumption constraint
Cited in
(14)- Approximability of scheduling problems with resource consuming jobs
- A PTAS for a resource scheduling problem with arbitrary number of parallel machines
- Approximation schemes for single machine scheduling with non-renewable resource constraints
- Reductions between scheduling problems with non-renewable resources and knapsack problems
- A multivariate complexity analysis of the material consumption scheduling problem
- Scheduling with non-renewable resources: minimizing the sum of completion times
- New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints
- Approximation schemes for machine scheduling with resource (in-)dependent processing times
- Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
- EPTAS for load balancing problem on parallel machines with a non-renewable resource
- EPTAS for load balancing problem on parallel machines with a non-renewable resource
- Unrelated parallel machine energy-efficient scheduling considering sequence-dependent setup times and time-of-use electricity tariffs
- Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget
- Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem
This page was built for publication: Approximation schemes for parallel machine scheduling with non-renewable resources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1698888)
