Pages that link to "Item:Q3423261"
From MaRDI portal
The following pages link to Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints (Q3423261):
Displayed 5 items.
- Two-machine flow shop and open shop scheduling problems with a single maintenance window (Q724106) (← links)
- A PTAS for non-resumable open shop scheduling with an availability constraint (Q2125217) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Open shop scheduling problem with a non-resumable flexible maintenance period (Q2150575) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)