On the minimization of total weighted flow time with identical and uniform parallel machines
From MaRDI portal
Publication:1806644
DOI10.1016/S0377-2217(97)00427-XzbMath0933.90025OpenAlexW2057415342MaRDI QIDQ1806644
Publication date: 8 November 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00427-x
Related Items
Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines ⋮ Practical solutions for a dock assignment problem with trailer transportation ⋮ An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem ⋮ An exact extended formulation for the unrelated parallel machine total weighted completion time problem ⋮ An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem ⋮ GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion 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 ⋮ A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching ⋮ 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 ⋮ Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization ⋮ A new approximation algorithm for unrelated parallel machine scheduling with release dates ⋮ Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
Cites Work
- Unnamed Item
- A new dynamic programming algorithm for the parallel machines total weighted completion time problem
- Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
- An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime
- 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
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
