Weighted flow time bounds for scheduling identical processors

DOI10.1016/0377-2217(93)E0142-KzbMATH Open0927.90056OpenAlexW1996857262MaRDI QIDQ1129956FDOQ1129956

Authors: Scott Webster 

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

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

zbMATH Keywords

lower boundsidentical parallel processor weighted flow time problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

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

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
• Title not available (Why is that?)
• 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)