Machine Scheduling Problem for Solving Tri-Objective Function Using Local Search Algorithm

Abstract

This study introduces the multi-objective single-machine approach. Reducing the three criteria of maximum earliest time , tardiness (), and total completion time () will solve the machine scheduling problem (MSP). It is an NP-hard problem.

           In this paper's theoretical section, we give the mathematical formulation of. Next, we'll look at how the dominance rule may help you make the most informed decisions. In the practical part, the Branch and Bound method is one of the most important exact approaches. A collection of optimal determination issues for  are generated, and the provided MSP goal is solved. In a fair amount of time, the BAB approach finds the best resolution issues to the problem. In addition, we provide two heuristic methods to address the Issue and provide appropriate estimates. The two suggested determination issues work well, according to the results of the practical investigation