Pages that link to "Item:Q256641"
From MaRDI portal
The following pages link to Approximability of scheduling problems with resource consuming jobs (Q256641):
Displayed 10 items.
- 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)
- 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)
- 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)