A NEW BRANCH AND BOUND ALGORITHM FOR MINIMIZING THE WEIGHTED NUMBER OF TARDY JOBS.

Authors :: Guochun Tang
Source :: Annals of Operations Research; 1990, Vol. 24 Issue 1-4, p225-232, 8p
Publication Year :: 1990
Abstract: In this paper, the problem of sequencing jobs on a single machine to minimize the weighted number of tardy jobs is considered. Some new dominances between jobs are proposed and studied. A new branch and bound algorithm that can solve large problems, e.g. 85 jobs, is presented. [ABSTRACT FROM AUTHOR]

Subjects :: ALGORITHMS
ALGEBRA
MACHINE theory
MATHEMATICAL models
MATHEMATICAL logic
OPERATIONS research

Full Text Access

Tools