A branch-and-bound procedure for a single-machine earliness scheduling problem with two agents

► We study a single-machine two-agent scheduling problem to minimize the total weighted earliness. ► We derive several dominance properties and a lower bound to speed up for searching an optimal solution. ► We develop a branch-and-bound and a simulated annealing algorithm incorporating for the problem.