**Makespan Scheduling - ac.informatik.uni-freiburg.de**
http://ac.informatik.uni-freiburg.de/lak_teaching/ws11_12/combopt/notes/makespan_scheduling.pdf

Makespan Scheduling In this chapter, we consider the classical Makespan Scheduling problem. We are given m machines for scheduling, indexed by the set M = {1,...,m }. There are furthermore given n jobs, indexed by the set J = {1,...,n }, where job j takes pi,j units of time if scheduled on machine i. Let Ji be the set of jobs scheduled on ...

**DA:** 11 **PA:** 8 **MOZ Rank:** 96