scientific article; zbMATH DE number 2079378
From MaRDI portal
Publication:4471337
Recommendations
- Minimizing weighted flow time
- Algorithms for minimizing weighted flow time
- Minimizing Average Flow-Time
- Minimizing the total weighted flow time in a single machine with controllable processing times
- Minimizing Schedule Length Subject to Minimum Flow Time
- Mean flow time minimization with given bounds of processing times
- Minimizing total weighted flow time of a set of jobs with interval processing times
- Simultaneous Resource Scheduling to Minimize Weighted Flow Times
- Minimizing total weighted completion time in a proportionate flow shop
- A polynomial time constant approximation for minimizing total weighted flow-time
Cited in
(18)- Non-clairvoyant scheduling for weighted flow time
- How unsplittable-flow-covering helps scheduling with job-dependent cost functions
- Non-clairvoyant weighted flow time scheduling on different multi-processor models
- Greedy multiprocessor server scheduling
- Approximating total flow time on parallel machines
- From preemptive to non-preemptive scheduling using rejections
- Non-clairvoyant Speed Scaling for Weighted Flow Time
- Minimizing Average Flow-Time
- scientific article; zbMATH DE number 1833400 (Why is no real title available?)
- Minimizing weighted flow time
- Non-preemptive flow-time minimization via rejections
- Fixed-parameter approximation schemes for weighted flowtime
- A competitive algorithm for minimizing weighted flow time on unrelated machines with speed augmentation
- Algorithms for minimizing weighted flow time
- Weighted flowtime on capacitated machines
- A best possible online algorithm for minimizing the total completion time and the total soft penalty cost
- Online weighted flow time and deadline scheduling
- Scheduling and fixed-parameter tractability
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471337)
