Windows scheduling of arbitrary-length jobs on multiple machines

The generalized windows scheduling problem for n jobs on multiple machines is defined as follows: Given is a sequence, I =〈( w 1 , ℓ 1 ),( w 2 , ℓ 2 ),…,( w n , ℓ n )〉 of n pairs of positive integers that are associated with the jobs 1,2,…, n , respectively. The processing length of job i is ℓ i slo...

Ausführliche Beschreibung