Pages that link to "Item:Q1029337"
From MaRDI portal
The following pages link to Exponential inapproximability and FPTAS for scheduling with availability constraints (Q1029337):
Displaying 5 items.
- Minimizing total weighted completion time with an unexpected machine unavailable interval (Q398911) (← links)
- Parallel machines scheduling with machine maintenance for minsum criteria (Q421521) (← links)
- Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem (Q470933) (← links)
- Approximation schemes for parallel machine scheduling with availability constraints (Q642981) (← links)
- Single machine scheduling with semi-resumable machine availability constraints (Q655762) (← links)
