Pages that link to "Item:Q2084601"
From MaRDI portal
The following pages link to A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\) (Q2084601):
Displaying 12 items.
- Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination (Q387811) (← links)
- On the machine scheduling problem with job delivery coordination (Q884029) (← links)
- Complexity of problem \(TF2|v=1,c=2|C_{\max}\) (Q888964) (← links)
- An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\) (Q1924622) (← links)
- A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem (Q2424829) (← links)
- Two faster algorithms for coordination of production and batch delivery: a note (Q2629739) (← links)
- A scheme of approximation solution of problem 1 |r j|L max (Q3115616) (← links)
- (Q4220474) (← links)
- (Q4900961) (← links)
- A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem (Q5136287) (← links)
- Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time (Q5964074) (← links)
- Flow shop scheduling problems with transportation constraints revisited (Q6185848) (← links)
