Pages that link to "Item:Q1804876"
From MaRDI portal
The following pages link to A polynomial algorithm for an open shop problem with unit processing times and tree constraints (Q1804876):
Displaying 6 items.
- A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}]\) open shop problem (Q1319570) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- A polynomial-time open-shop problem with an arbitrary number of machines (Q1816373) (← links)
- The representation of partially-concurrent open shop problems (Q2398435) (← links)
- Open shop problems with unit time operations (Q4031970) (← links)
- (Q4822050) (← links)
