Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds
RAIRO-Oper. Res., 47 1 (2013) 33-46
Published online: 11 February 2013
DOI: 10.1051/ro/2013025