Pages that link to "Item:Q1785443"
From MaRDI portal
The following pages link to Approximability of total weighted completion time with resource consuming jobs (Q1785443):
Displaying 12 items.
- Approximability of scheduling problems with resource consuming jobs (Q256641) (← links)
- Approximation schemes for parallel machine scheduling with non-renewable resources (Q1698888) (← links)
- A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource (Q2059081) (← 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 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)
- A Global Constraint for Total Weighted Completion Time (Q3612411) (← links)
- An FPTAS of minimizing total weighted completion time on single machine with position constraint (Q5136235) (← links)
- A Faster FPTAS for a Supply Chain Scheduling Problem to Minimize Holding Costs with Outsourcing (Q5506759) (← links)
- EPTAS for load balancing problem on parallel machines with a non-renewable resource (Q6108926) (← links)
- Scheduling with non-renewable resources: minimizing the sum of completion times (Q6547136) (← links)
