A study of the single-machine two-agent scheduling problem with release times

► We address a single-machine scheduling problem with two-agent and different ready times. ► We show that the proposed problem is strongly NP-hard. ► We develop some dominance rules and lower bounds to be used in a branch-and-bound algorithm. ► We propose an ant colony, and four genetic algorithms for near-optimal solution.