Pages that link to "Item:Q1367883"
From MaRDI portal
The following pages link to Approximate algorithms for the \(P\parallel C_{\max}\) problem (Q1367883):
Displaying 13 items.
- Approximation algorithms for \(k\)-hurdle problems (Q627530) (← links)
- Ordinal scheduling problem and its asymptotically optimal algorithms on parallel machine system (Q866072) (← links)
- Parallel algorithms for solution of problems in scheduling theory (Q1319767) (← links)
- List scheduling algorithms to minimize the makespan on identical parallel machines (Q1348708) (← links)
- Ordinal algorithms for parallel machine scheduling (Q1919194) (← links)
- Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs (Q2304114) (← links)
- A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem (Q2424829) (← links)
- (Q4220474) (← links)
- (Q4251055) (← links)
- (Q4368199) (← links)
- (Q4900961) (← links)
- A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem (Q5136287) (← links)
- Automata, Languages and Programming (Q5716842) (← links)