A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
This paper addresses the problem of scheduling a given set of independent jobs on a single machine to minimize the sum of weighted earliness and weighted tardiness without considering machine idle time. Efficient lower and upper bounds are developed. The lower bound is obtained based on a Lagrangian relaxation that decomposes the problem into two subproblems, and an efficient lower bounding procedure for each of the subproblems. The upper bound is obtained using a two-phase heuristic procedure that combines a priority dispatching rule with a local improvement procedure. A branch-and-bound algorithm incorporating these bounds and some dominance rules is proposed. Computational experiments on problems with up to 50 jobs show that both the lower and upper bounds are very tight and the branch-and-bound algorithm performs very well. (C) 1999 Elsevier Science Ltd. All rights reserved.
branch-and-bound scheduling lagrangian relaxation