A New Multi Objective Model for Single Machine Scheduling Problems

Abstract

This paper presents an exact method for the single machine scheduling problem with the objective of minimizing the total weight completion time and the sum of maximum earliness and maximum tardiness ( Σ ) To obtain the optimal solution, a Branch and Bound (BAB) algorithm is developed using one effective upper bound (UB) and a lower bound (LB) to reduce the search space and improve computational efficiency. The computational results show that the suggested approach is able to generate optimal solutions for problem instances with up to 24 jobs in a tolerable computational time. The Matlab program was used to implement all algorithm.