WSPT's competitive performance for minimizing the total weighted flow time: from single to parallel machines
From MaRDI portal
(Redirected from Publication:459788)
Recommendations
- Minimizing the total weighted flow time in a single machine with controllable processing times
- Weighted completion time minimization for capacitated parallel machines
- A PTAS for minimizing the total weighted completion time on identical parallel machines.
- A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems
- A PTAS for minimizing the weighted sum of job completion times on parallel machines
- A competitive algorithm for minimizing weighted flow time on unrelated machines with speed augmentation
- MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES
- Minimizing total weighted completion time approximately for the parallel machine problem with a single server
- Minimizing makespan subject to minimum total flow-time on identical parallel machines
Cited in
(2)
This page was built for publication: WSPT's competitive performance for minimizing the total weighted flow time: from single to parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q459788)
