Pages that link to "Item:Q398908"

The following pages link to Approximation schemes for single machine scheduling with non-renewable resource constraints (Q398908):

Displaying 22 items.

• Approximability of scheduling problems with resource consuming jobs (Q256641) (← links)
• Reductions between scheduling problems with non-renewable resources and knapsack problems (Q482287) (← links)
• Approximation algorithms for inventory constrained scheduling on a single machine (Q906561) (← 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)
• 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)
• Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint (Q2371343) (← 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)
• (Q3775317) (← links)
• Scheduling under a Non-renewable Resource Constraint (Q3983497) (← links)
• Job Shop Scheduling under a Non-Renewable Resource Constraint (Q4305774) (← 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)
• 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)
• Application of the interpolation approach for approximating single-machine scheduling problem with an unknown objective function (Q6169125) (← links)
• Scheduling with non-renewable resources: minimizing the sum of completion times (Q6547136) (← links)