We study a two-agent multi-facility order scheduling with ready times. We derive several dominance properties and a lower bound on the optimal solution. We present algorithms based on particle swarm optimization (PSO) and opposite-based particle swarm optimization (O-PSO) to obtain near-optimal solutions.