Minimizing the weighted number of tardy jobs on a two-machine flow shop.

Robert L. Bulfin Jr.Rym M'Hallah

Published in: Comput. Oper. Res. (2003)

Keyphrases

weighted number of tardy jobs
single machine
scheduling problem
processing times
np hard
tabu search
flowshop
machine learning
cooperative
data mining
three dimensional
multiscale
learning environment
dynamic programming
probability distribution
completion times