Pages that link to "Item:Q640300"
From MaRDI portal
The following pages link to Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates (Q640300):
Displaying 10 items.
- Minimizing total weighted completion time with an unexpected machine unavailable interval (Q398911) (← links)
- Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem (Q470933) (← links)
- Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time (Q497629) (← links)
- Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals (Q498410) (← links)
- Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval (Q1042105) (← links)
- Weighted completion time minimization on a single-machine with a fixed non-availability interval: differential approximability (Q1941538) (← links)
- Scheduling jobs and maintenance activities on parallel machines (Q2359536) (← links)
- Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint (Q2371343) (← links)
- Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines (Q4578168) (← links)
- Minimizing the maximum lateness for scheduling with release times and job rejection (Q6646743) (← links)
