Pages that link to "Item:Q3983497"
From MaRDI portal
The following pages link to Scheduling under a Non-renewable Resource Constraint (Q3983497):
Displayed 14 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)
- Single machine scheduling problems with financial resource constraints: some complexity results and properties (Q554491) (← links)
- Polynomial algorithms for single machine scheduling problems with financial constraints (Q1371954) (← links)
- Resource constrained scheduling simulation model for alternative stochastic network projects. (Q1399956) (← 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)
- 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)
- Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem (Q2664314) (← links)
- On single machine scheduling with resource constraint (Q5963634) (← links)
- A multivariate complexity analysis of the material consumption scheduling problem (Q6136081) (← links)