Pages that link to "Item:Q888964"
From MaRDI portal
The following pages link to Complexity of problem \(TF2|v=1,c=2|C_{\max}\) (Q888964):
Displaying 5 items.
- Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited (Q515553) (← links)
- Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines (Q1651647) (← links)
- A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\) (Q2084601) (← links)
- Flow shop scheduling problems with transportation constraints revisited (Q6185848) (← links)
- An improved approximation algorithm for a scheduling problem with transporter coordination (Q6204661) (← links)
