It is shown how Lawler's procedure for the one-machine case can be combined with Johnson's rule to produce a branch-and-bound algorithm for the two-machine version.
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.