Pages that link to "Item:Q482287"
From MaRDI portal
The following pages link to Reductions between scheduling problems with non-renewable resources and knapsack problems (Q482287):
Displaying 9 items.
- Approximability of scheduling problems with resource consuming jobs (Q256641) (← links)
- Approximation schemes for parallel machine scheduling with non-renewable resources (Q1698888) (← links)
- A PTAS for a resource scheduling problem with arbitrary number of parallel machines (Q1728364) (← links)
- Approximability of total weighted completion time with resource consuming jobs (Q1785443) (← links)
- EPTAS for load balancing problem on parallel machines with a non-renewable resource (Q2085740) (← links)
- Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints (Q2294889) (← links)
- An FPTAS of minimizing total weighted completion time on single machine with position constraint (Q5136235) (← links)
- EPTAS for load balancing problem on parallel machines with a non-renewable resource (Q6108926) (← links)
- A multivariate complexity analysis of the material consumption scheduling problem (Q6136081) (← links)