 |
Multi-objective parallel machine scheduling with incompatible jobs
We consider the problem of scheduling n jobs with different processing times on parallel identical machines with job incompatibility constraints and preemption possibility.
Three objectives have to be minimized in lexicographical (or hierarchical) order: makespan, number of job interruptions, and sum of throughput times over all jobs. A linear programming formulation, a greedy heuristic and a tabu search are proposed to solve this problem.
