Weighted flow time bounds for scheduling identical processors
From MaRDI portal
Recommendations
- New Bounds for the Identical Parallel Processor Weighted Flow Time Problem
- Bounds and asymptotic results for the uniform parallel processor weighted flow time problem
- On the minimization of total weighted flow time with identical and uniform parallel machines
- Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
Cites work
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems
- An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime
- Balanced Loading
- Bounds and asymptotic results for the uniform parallel processor weighted flow time problem
- New Bounds for the Identical Parallel Processor Weighted Flow Time Problem
- Probabilistic analysis of the minimum weighted flowtime scheduling problem
- Scheduling identical parallel machines to minimize total weighted completion time
- Scheduling independent tasks to reduce mean finishing time
- Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
Cited in
(16)- Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
- An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times
- Bounds and asymptotic results for the uniform parallel processor weighted flow time problem
- New Bounds for the Identical Parallel Processor Weighted Flow Time Problem
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
- Heuristic methods for the identical parallel machine flowtime problem with set-up times
- Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem
- A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
- Minimizing total completion time on a single machine with a flexible maintenance activity
- A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models
- scientific article; zbMATH DE number 7051295 (Why is no real title available?)
- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
- Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods
This page was built for publication: Weighted flow time bounds for scheduling identical processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1129956)
