Weighted flow time bounds for scheduling identical processors

DOI10.1016/0377-2217(93)E0142-KzbMath0927.90056OpenAlexW1996857262MaRDI QIDQ1129956

Webster, Scott

Publication date: 16 August 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)e0142-k

zbMATH Keywords

lower boundsidentical parallel processor weighted flow time problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (12)

Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval ⋮ Minimizing total completion time on a single machine with a flexible maintenance activity ⋮ An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times ⋮ Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods ⋮ Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines ⋮ Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem ⋮ Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times ⋮ A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates ⋮ Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms ⋮ A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines ⋮ Heuristic methods for the identical parallel machine flowtime problem with set-up times ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems

Cites Work

• Unnamed Item
• Probabilistic analysis of the minimum weighted flowtime scheduling problem
• A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems
• Bounds and asymptotic results for the uniform parallel processor weighted flow time problem
• Scheduling identical parallel machines to minimize total weighted completion time
• An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime
• Balanced Loading
• New Bounds for the Identical Parallel Processor Weighted Flow Time Problem
• Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
• Scheduling independent tasks to reduce mean finishing time

This page was built for publication: Weighted flow time bounds for scheduling identical processors