Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
From MaRDI portal
Publication:2294889
Recommendations
- New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints
- Scheduling with non-renewable resources: minimizing the sum of completion times
- A 3-approximation list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource and total weighted completion time criterion
- Approximability of total weighted completion time with resource consuming jobs
- Approximation schemes for single machine scheduling with non-renewable resource constraints
Cites work
- A PTAS for a resource scheduling problem with arbitrary number of parallel machines
- Approximability of scheduling problems with resource consuming jobs
- Approximability of total weighted completion time with resource consuming jobs
- Approximation schemes for parallel machine scheduling with non-renewable resources
- Approximation schemes for single machine scheduling with non-renewable resource constraints
- Basic scheduling problems with raw material constraints
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Polynomial algorithms for single machine scheduling problems with financial constraints
- Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
- Reductions between scheduling problems with non-renewable resources and knapsack problems
- Scheduling under a Non-renewable Resource Constraint
- Single machine scheduling problems with financial resource constraints: some complexity results and properties
Cited in
(19)- Approximation schemes for single machine scheduling with non-renewable resource constraints
- A multivariate complexity analysis of the material consumption scheduling problem
- Single machine scheduling problems with financial resource constraints: some complexity results and properties
- Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost
- Scheduling with non-renewable resources: minimizing the sum of completion times
- Machine Scheduling to Minimize Weighted Completion Times
- NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time
- A 3-approximation list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource and total weighted completion time criterion
- Minimizing the total weighted completion time in the relocation problem
- Scheduling to minimize the total weighted completion time with a constraint on the release time resource consumption
- Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution
- A global constraint for total weighted completion time for unary resources
- New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints
- Scheduling with non-renewable resources: minimizing the sum of completion times
- 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
- Approximability of total weighted completion time with resource consuming jobs
- Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine
This page was built for publication: Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294889)
