An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime

DOI10.1080/00207548808947934zbMath0641.90043OpenAlexW2124938557MaRDI QIDQ3783064

Seokyoo Ahn, Sarin, Subhash C., Albert B. Bishop

Publication date: 1988

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207548808947934

zbMATH Keywords

branch and boundimproved lower boundn job, m parallel machine problemweighted flowtime criterion

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Related Items (15)

Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group 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 ⋮ Weighted flow time bounds for scheduling identical processors ⋮ 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 state-of-the-art review of parallel-machine scheduling research ⋮ A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates ⋮ A new dynamic programming algorithm for the parallel machines total weighted completion time problem ⋮ 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 ⋮ On the minimization of total weighted flow time with identical and uniform parallel machines ⋮ Parallel flowshop scheduling using Tabu search ⋮ Scheduling identical parallel machines to minimize total weighted completion time

Cites Work

• Scheduling independent tasks to reduce mean finishing time
• Scheduling with parallel processors and linear delay costs
• Scheduling to Minimize Interaction Cost
• Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
• A network isolation algorithm

This page was built for publication: An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime