Genetic algorithms for a two-agent single-machine problem with release time

► We study a single-machine problem with two competing agents. ► The objective is to minimize the total tardiness from one agent given a bound of maximum tardiness from the other agent. ► Three genetic algorithms are proposed to obtain the near-optimal solutions.