A New Bound for Machine Scheduling

Abstract

A method of scheduling machines is presented which incorporates the facility of providing proven optimum solutions for minimum throughput time. The method employs branch and bound procedures and includes a new, job based, bounding procedure which is well suited to the situation where all jobs are not processed by all machines. Comparisons are made with well known bounding procedures and computational experience is reported with examples taken from real applications.