Optimal due-date determination and sequencing with random processing times

AbstractThis paper considers the problem of due-date determination and sequencing of n stochastically independent jobs on a single machine with random processing times. The objective is to find the optimal due-date values for the constant due-date assignment method and the optimal job sequence that minimize the expected value of a total cost function. It is shown that under suitable assumptions the optimal due-date values can be analytically determined and the jobs should be arranged in the SEPT sequence to minimize the cost