Pages that link to "Item:Q3092238"
From MaRDI portal
The following pages link to Scheduling Partially Ordered Jobs Faster Than 2 n (Q3092238):
Displaying 6 items.
- On an extension of the Sort \& Search method with application to scheduling theory (Q392015) (← links)
- On exact algorithms for the permutation CSP (Q392031) (← links)
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) (Q486988) (← links)
- Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
- Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms (Q2242051) (← links)
- Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights (Q2307497) (← links)
