![Sample our Economics, Finance,Business & Industry journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5931/TOC-Subject-Sample-2021-Economics-Finance-Business-Industry.jpg"})
Abstract
A branch-and-bound algorithm for a two-machine scheduling problem by Grabowski is generalized to the case of an arbitrary number of machines. The lower bounds are obtained by the relaxation of the capacity constraints on the machines. An approach to strengthen these lower bounds is developed. Computational experience with 6-, 10-, 15-, 20-, 30-, 40-, 50-job problems is presented.