Minimising interference for scheduling two parallel machines with a single server

What is it about?

This paper presents heuristics for the problem of scheduling a set of jobs on two identical parallel machines with a single server to minimize forced idle time (interference problem). The heuristics have been tested on very large instances with up to 100 000 jobs.

Featured Image

Why is it important?

The problem is closely related to the makespan minimization problem. The results are excellent even for very big instances with 100 000 jobs.