Makespan Minimization for a Two-Machine Scheduling Problem with a Single Server

What is it about?

This conference paper presents three mixed integer linear programming formulations for the problem of scheduling a set of jobs on two identical parallel machines with a single server to minimize the makespan. Results of computational experiments are presented.

Featured Image