Two-agent single-machine scheduling to minimize the weighted sum of the agents’ objective functions

•We study a two-agent single-machine multi-objective scheduling problem.•The backward branch-and-bound algorithm can solve problems of up to 40 jobs.•The genetic algorithm with initial sequences has the best performance. Scheduling with two competing agents on a single machine has become a popular r...

Ausführliche Beschreibung