The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm

This paper addresses the single machine scheduling problem with a common due date aiming to minimize earliness and tardiness penalties. Due to its complexity, most of the previous studies in the literature deal with this problem using heuristics and metaheuristics approaches. With the intention of contributing to the study of this problem, a branch-and-bound algorithm is proposed. Lower bounds and pruning rules that exploit properties of the problem are introduced. The proposed approach is examined through a computational comparative study with 280 problems involving different due date scenarios. In addition, the values of optimal solutions for small problems from a known benchmark are provided.

Fundacao de Amparo a Pesquisa do Estado de Sao Paulo - FAPESP[06/03496-3]

""Conselho Nacional de Desenvolvimento Cientifico e Tecnologico"" - CNPq[486124/2007-0]

""Conselho Nacional de Desenvolvimento Cientifico e Tecnologico"" - CNPq[307399/2006-0]