Pages that link to "Item:Q1319570"
From MaRDI portal
The following pages link to A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}]\) open shop problem (Q1319570):
Displayed 6 items.
- Extensions of coloring models for scheduling purposes (Q1268282) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- A polynomial algorithm for an open shop problem with unit processing times and tree constraints (Q1804876) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- On a routing Open Shop Problem on two nodes with unit processing times (Q5090158) (← links)
- Open-shop scheduling for unit jobs under precedence constraints (Q5919300) (← links)
