Pages that link to "Item:Q554491"

The following pages link to Single machine scheduling problems with financial resource constraints: some complexity results and properties (Q554491):

Displaying 13 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 decomposition-based two-stage optimization algorithm for single machine scheduling problems with deteriorating jobs (Q1665390) (← 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)
• 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)
• On single machine scheduling with resource constraint (Q5963634) (← links)
• Dynamic resource allocation and collaborative scheduling in R\&D and manufacturing processes of high-end equipment with budget constraint (Q6043112) (← links)