Your institution may have access to this item. Find your institution then sign in to continue.

Title: An improved branching scheme for the branch and bound procedure of scheduling n jobs on m parallel machines to minimize total weighted flowtime.
Authors: Sarin, Subhash C.; Ahn, Seokyoo; Bishop, Albert B.
Abstract: A branch and bound procedure to solve the n job, in parallel machine problem for the weighted flowtime criterion has been developed by Elmaghraby and Park (1974) and further modified by Barnes and Brennan (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.
Subjects: PRODUCTION scheduling; BRANCH & bound algorithms
Publication: International Journal of Production Research, 1988, Vol 26, Issue 7, p1183
ISSN: 0020-7543
Publication type: Academic Journal
DOI: 10.1080/00207548808947934

We found a match

An improved branching scheme for the branch and bound procedure of scheduling n jobs on m parallel machines to minimize total weighted flowtime.