Minimizing the number of tardy jobs in identical machine scheduling

Abstract In this paper, minimizing the number of tardy jobs in identical parallel machine scheduling is discussed. First, an integer programming formulation is given. Later, three simple heursitc procedures are presented with an example. Finally, the performance of the proposed heuristic procedures is compared with other available procedures.