A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems

DOI10.1016/0377-2217(93)90244-HzbMath0794.90027MaRDI QIDQ1310018

S. T. Webster

Publication date: 31 August 1994

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)90244-h

zbMATH Keywords

NP-complete; weighted flow time; identical machines; priority rule

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates, Weighted flow time bounds for scheduling identical processors, Frameworks for adaptable scheduling algorithms, 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

Cites Work

• Minimizing Flow Time on Parallel Identical Processors with Variable Unit Processing Time
• On Minimizing Flow Time on Processors with Variable Unit Processing Time
• New Bounds for the Identical Parallel Processor Weighted Flow Time Problem
• Scheduling independent tasks to reduce mean finishing time
• Scheduling with parallel processors and linear delay costs