Pages that link to "Item:Q2078845"
From MaRDI portal
The following pages link to New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints (Q2078845):
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)
- Single machine scheduling problems with financial resource constraints: some complexity results and properties (Q554491) (← links)
- NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time (Q859949) (← links)
- Approximation schemes for parallel machine scheduling with non-renewable resources (Q1698888) (← 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)
- Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints (Q2294889) (← links)
- Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost (Q3120568) (← links)
- Scheduling under a Non-renewable Resource Constraint (Q3983497) (← links)
- Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines (Q4578168) (← links)
- Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution (Q5146966) (← links)
- A multivariate complexity analysis of the material consumption scheduling problem (Q6136081) (← links)
