A basic problem of sequencing a set of independent tasks at a single facility with the objective of minimizing total tardiness is considered. A variation of beam search, called knowledge-based beam search, has been studied which uses domain knowledge to reduce the problem size with an evaluation function to generate nodes probable to include the optimal solution. Its performance behavior is compared with some existing algorithms.