New Bounds for the Identical Parallel Processor Weighted Flow Time Problem

DOI10.1287/MNSC.38.1.124MaRDI QIDQ4005798zbMATH OpenOpenAlexFDO

Authors Scott Webster

Publication date 27 September 1992

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.38.1.124

zbMATH Keywords

identical processor problemnonidentical processorspolynomial time lower boundsweighted flow time

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Weighted flow time bounds for scheduling identical processors
• 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
• A general lower bound for the makespan problem
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem

Cited in

(15)

• Weighted flow time bounds for scheduling identical processors
• A general lower bound for the makespan 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
• The complexity of scheduling job families about a common due date
• On the minimization of total weighted flow time with identical and uniform parallel machines
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
• Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods
• A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
• On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
• Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem
• A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
• Minimizing mean weighted execution time loss on identical and uniform processors
• 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

This page was built for publication: New Bounds for the Identical Parallel Processor Weighted Flow Time Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4005798)