A new modeling for multicriteria single machine scheduling:A Genetic Algorithm approach

This research considers a new modeling of single-machine scheduling problem with the objective of minimizing the summation of the weighted earliness and tardiness, subject to the number of tardy jobs when the due dates are variable. We use a heuristic algorithm (GA) and a branch and bound algorithm to solve the problem. The results obtained from the computational study have shown that the heuristic algorithm is effective in terms of solution quality in many instances while the branch and bound algorithm is efficient for medium-size problems

Keywords:

single machine scheduling , Branch and Bound algorithm (BBA) , Genetic algorithm (GA)