Pages that link to "Item:Q1698888"
From MaRDI portal
The following pages link to Approximation schemes for parallel machine scheduling with non-renewable resources (Q1698888):
Displaying 14 items.
- Approximability of scheduling problems with resource consuming jobs (Q256641) (← links)
- Approximation schemes for single machine scheduling with non-renewable resource constraints (Q398908) (← links)
- Reductions between scheduling problems with non-renewable resources and knapsack problems (Q482287) (← links)
- A PTAS for a resource scheduling problem with arbitrary number of parallel machines (Q1728364) (← links)
- New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints (Q2078845) (← 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)
- Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem (Q2664314) (← links)
- Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget (Q3004675) (← links)
- Approximation schemes for machine scheduling with resource (in-)dependent processing times (Q4575688) (← 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)
- Unrelated parallel machine energy-efficient scheduling considering sequence-dependent setup times and time-of-use electricity tariffs (Q6491320) (← links)
- Scheduling with non-renewable resources: minimizing the sum of completion times (Q6547136) (← links)
