Pages that link to "Item:Q256641"
From MaRDI portal
The following pages link to Approximability of scheduling problems with resource consuming jobs (Q256641):
Displaying 19 items.
- Reductions between scheduling problems with non-renewable resources and knapsack problems (Q482287) (← links)
- Approximate solution of a resource-constrained scheduling problem (Q1009198) (← links)
- Assessing the resource usage in scheduling with incompatibilities (Q1412167) (← 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)
- Job release scheduling problem: complexity and an approximation algorithm (Q1946231) (← links)
- A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource (Q2059081) (← links)
- EPTAS for load balancing problem on parallel machines with a non-renewable resource (Q2085740) (← links)
- Minimizing makespan on a single machine with release dates and inventory constraints (Q2184096) (← 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 schemes for machine scheduling with resource (in-)dependent processing times (Q4575688) (← links)
- An FPTAS of minimizing total weighted completion time on single machine with position constraint (Q5136235) (← links)
- (Q5874275) (← links)
- A unified approach to approximating resource allocation and scheduling (Q5895231) (← 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)
- Scheduling with non-renewable resources: minimizing the sum of completion times (Q6547136) (← links)