Now showing items 1-2 of 2
A new dominance rule for the total weighted tardiness problem
(Taylor & Francis, 1999)
We present a new dominance rule for the single machine total weighted tardiness problem with job dependent penalties. The proposed dominance rule provides a sufficient condition for local optimality. We show that if any ...
Job shop scheduling with beam search
(Elsevier Science B.V., Amsterdam, Netherlands, 1999)
Beam Search is a heuristic method for solving optimization problems. It is an adaptation of the branch and bound method in which only some nodes are evaluated in the search tree. At any level, only the promising nodes are ...