Machine Scheduling Problem to Minimize Two and Three Objectives Function

In this book, the problem of scheduling n jobs on a single machine is considered to minimize Multiple Objective Function (MOF). There are two aims for this study, the first aim is to find the optimal solution for the number of tardy jobs, maximum tardiness and makespan with unequal release dates, no preemption is allowed. The second aim is to find the best possible solution for in hierarchical (or lexicographical), optimization method, with the jobs are available at zero time and no preemption is allowed.