Pages that link to "Item:Q4697081"
From MaRDI portal
The following pages link to An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity (Q4697081):
Displaying 3 items.
- 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)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
