
A three-agent scheduling problem for minimizing the makespan on a single machine
Keywords: الگوریتم Branch-and-bound; Job scheduling; Tardiness; Multi-agent; Makespan; Maintenance activity; Branch-and-bound algorithm;