Pages that link to "Item:Q1198009"
From MaRDI portal
The following pages link to An algorithm for flow time minimization and its asymptotic makespan properties (Q1198009):
Displaying 6 items.
- An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan (Q511693) (← links)
- Algorithm for quadratic semi-assignment problem with partition size coefficients (Q2448190) (← links)
- The \(\zeta(2)\) limit in the random assignment problem (Q2746215) (← links)
- Minimizing makespan and throughput times at Aalsmeer flower auction (Q3545655) (← links)
- On Minimizing Flow Time on Processors with Variable Unit Processing Time (Q3755220) (← links)
- Algorithms for minimizing weighted flow time (Q5175956) (← links)