101
click to vote
DAGSTUHL
2006
15 years 4 months ago
2006
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of ...