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

From MaRDI portal
Publication:3783064





A branch and bound procedure to solve the n job, m parallel machine problem for the weighted flowtime criterion has been developed by \textit{S. E. Elmaghraby} and \textit{S. H. Park} [AIEE Transactions 6, No.1 (1974)] and further modified by \textit{J. W. Barnes} and \textit{J. J. Brennan} [ibid. 9, No.1 (1977)]. This paper proposes a branching scheme different from theirs and shows its superiority. Also, some new and simple results are presented which are easy to implement to obtain an efficient branch-and- bound algorithm. In addition, a new and improved lower bound is developed which is easy to compute.




Cited in
(17)








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)