Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper boundsCyril Briand and Samia OurariRAIRO-Oper. Res., 47 1 (2013) 33-46DOI: https://doi.org/10.1051/ro/2013025
