An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime
From MaRDI portal
Publication:3783064
DOI10.1080/00207548808947934zbMath0641.90043MaRDI QIDQ3783064
Sarin, Subhash C., 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
branch and bound; improved lower bound; n job, m parallel machine problem; weighted flowtime criterion
65K05: Numerical mathematical programming methods
90B35: Deterministic scheduling theory in operations research
Related Items
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, 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, On the minimization of total weighted flow time with identical and uniform parallel machines, 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
