Abstract
An optimal scheduling based on branch and bound method and a suboptimal scheduling based on two candidate jobs are proposed for minimizing the number of tardy jobs with ready times in one machine scheduling. The problem in this paper is a generalization of Kise's model in which the order of ready times is identical to the order of due-dates. A new labeling scheme of node numbers and a lower bound employing Moore's algorithm are proposed for branch and bound. Time complexity of the suboptimal algorithm is o(n^2). The quality of solutions by the suboptimal algorithm is investigated through the computational experience.
