Minimizing the expected number of tardy jobs when processing times are normally distributed.

Wooseung Jang Cerry M. Klein

Published in: Oper. Res. Lett. (2002)

Keyphrases

number of tardy jobs
processing times
single machine
scheduling problem
single machine scheduling problem
flowshop
setup times
release dates
precedence relations
worst case performance ratio
distributed systems
polynomially solvable
identical machines
linear programming
resource consumption
simulated annealing