A Single Machine Scheduling to Minimize Weighted Number of Tardy Jobs with Release Time Constant

Abstract

Scheduling is a decision making process that has a goal the optimization of one or moreobjectives. Scheduling concerns the allocation of limited resources to task over a time.Unfortunately, many scheduling problems belongs to the class NP-hard or in simple words, theyare not solved exactly byany efficient algorithm on any computer. In this dissertation certainscheduling problems for the case of single machine scheduling is studied. Since 1 is NP- hard, it is not possible to compute exact solution, even for the instances of moderate size. We shall apply the dynamic programming algorithm, branch and bound algorithm. Where preemption is not allowed and, the objective function is to minimize the weighted number of tardy jobs considering release time constant.