An Efficient Hybrid Algorithm for Solving Multi Objective Linear Programming Model for Single Machine Problems

Due to the fact that the determination of an efficient scheduling solution in the sequence of single machine operation for multiple objective programming is important, especially in production planning, we are considering a single machine sequencing problem with minimizing the number of the tasks with lateness and weighted tardiness. In this article, the application of new optimization methods in sequencing problem and scheduling are in order. We propose the mathematical model for the problem under consideration first and then by introducing simulated annealing and genetic algorithm, as solution approaches, we test their efficiency for solving the proposed problem. At the end, to increase the efficiency of the proposed model a hybrid/meta-heuristic algorithm based upon the genetic algorithm is proposed. This method identifies a collection of efficient sequencing tools for objectives minimization.