Pages that link to "Item:Q1816373"
From MaRDI portal
The following pages link to A polynomial-time open-shop problem with an arbitrary number of machines (Q1816373):
Displaying 5 items.
- 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)
- Open-shop dense schedules: properties and worst-case performance ratio (Q2434260) (← links)
- Open block scheduling in optical communication networks (Q2503353) (← links)
- Some positive news on the proportionate open shop problem (Q2633607) (← links)
