Abstract. 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. Mathematical subject classification: 90C11, 62P30, 90B35.
Ronconi and Kawamura proposed a branch and bound algorithm in 2010 for the general case of the CDD and gave optimal results for small benchmark instances REF .
The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm*
Computational & Applied Mathematics
Computer Science