Approximability of scheduling problems with resource consuming jobs
From MaRDI portal
(Redirected from Publication:256641)
Recommendations
- Approximation schemes for parallel machine scheduling with non-renewable resources
- Approximability of total weighted completion time with resource consuming jobs
- Approximation schemes for single machine scheduling with non-renewable resource constraints
- 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
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 results for the resource-constrained project scheduling problem with a single type of resources
- 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
- On the approximability of single-machine scheduling with precedence constraints
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Optimization, approximation, and complexity classes
- 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
- 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
- Some APX-completeness results for cubic graphs
- Tight approximation algorithms for maximum separable assignment problems
Cited in
(19)- A PTAS for a resource scheduling problem with arbitrary number of parallel machines
- 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
- scientific article; zbMATH DE number 7650890 (Why is no real title available?)
- Assessing the resource usage in scheduling with incompatibilities
- An FPTAS of minimizing total weighted completion time on single machine with position constraint
- A unified approach to approximating resource allocation and scheduling
- 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
- A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource
- 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
- Job release scheduling problem: complexity and an approximation algorithm
- Approximation schemes for parallel machine scheduling with non-renewable resources
- Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem
- Approximability of total weighted completion time with resource consuming jobs
- Minimizing makespan on a single machine with release dates and inventory constraints
- Approximate solution of a resource-constrained scheduling problem
This page was built for publication: Approximability of scheduling problems with resource consuming jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q256641)
