Pages that link to "Item:Q690471"
From MaRDI portal
The following pages link to Combination of parallel machine scheduling and vertex cover (Q690471):
Displaying 8 items.
- Vertex cover meets scheduling (Q270025) (← links)
- A study on several combination problems of classic shop scheduling and shortest path (Q344790) (← links)
- Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families (Q2158015) (← links)
- On the approximability of the two-phase knapsack problem (Q2279756) (← links)
- Improved approximation algorithms for the combination problem of parallel machine scheduling and path (Q2331579) (← links)
- A combination of flow shop scheduling and the shortest path problem (Q2354293) (← links)
- Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms (Q3196375) (← links)
- Improved Approximation Algorithm for the Combination of Parallel Machine Scheduling and Vertex Cover (Q4639895) (← links)