Pages that link to "Item:Q5024913"
From MaRDI portal
The following pages link to A Parallel Machine Scheduling Problem Maximizing Total Weighted Early Work (Q5024913):
Displaying 3 items.
- Combinatorial approximation algorithms for the maximum bounded connected bipartition problem (Q2111532) (← links)
- Approximation algorithms for the maximum bounded connected bipartition problem (Q2151359) (← links)
- A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work (Q6054012) (← links)
