Single machine stochastic scheduling with deterioration to minimize the number of tardy jobs using mathematical programming

This paper studies the single machine scheduling problem with the objective of minimizing the expected numbers of tardy jobs considering deterioration. Jobs have normally distributed processing times and a deterministic due date. We’ve developed new approaches for this problem that generates near optimal solutions. The original stochastic problem is transformed into a non-linear integer programming model and its relaxations. Computational study validates their effectiveness versus optimal solutions.

Keywords:

stochastic scheduling , single machine , tardy jobs , deterioration