Three objectives single machine scheduling with random processing

This paper considers the scheduling of n independent jobs with random processing times in a single machine shop in which each is assigned a common due date; the objective is to determine the optimal sequencing to minimize the expectation of the linear combination of the total earliness, total tardiness and total completion times, and, under appropriate assumption, the shaping of optimal sequencing is derived.