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

DOI10.1080/00207548808947934MaRDI QIDQ3783064zbMATH OpenOpenAlexFDO

Authors Subhash C. Sarin, Seokyoo Ahn, 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)

Recommendations

• Scheduling identical parallel machines to minimize total weighted completion time
• On the minimization of total weighted flow time with identical and uniform parallel machines
• Scheduling parallel machines to minimize weighted flowtime with family set-up times
• A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
• A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines

Cites work

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

Cited in

(17)

• Weighted flow time bounds for scheduling identical processors
• A new dynamic programming algorithm for the parallel machines total weighted completion time problem
• Scheduling identical parallel machines to minimize total weighted completion time
• Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem
• Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
• On the minimization of total weighted flow time with identical and uniform parallel machines
• GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
• An exact extended formulation for the unrelated parallel machine total weighted completion time problem
• Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods
• Two schemes of the branch-and-bound method for a flow shop total weighted tardiness minimization problem
• A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
• scientific article; zbMATH DE number 996547 (Why is no real title available?)
• Parallel flowshop scheduling using Tabu search
• An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem
• 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
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms

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

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