Comparison study about production scheduling system from some paper case studies

Abstract

Scheduling is one of the most important classes of combinatorial problems. One of the first problem to be studied in the scheduling theory is the problem of minimizing the makespan in flowshop. In flowshop, the products which is produced have the same sequences. The heuristic algorithms are the key to solving the problem with the optimal solution. To find or to approach nearer to the optimal solution, the meta-heuristic algorithms can be used and the heuristic algorithms as the first solution. One of heuristic algorithm that can be used is Campbell, Dudek and Smith (CDS). Also, the meta-heuristic algorithms that can be used are Tabu Search and Genetic Algorithm. The aim of this paper is to know the gap among the other methods in flowshop scheduling system to reach the optimum makespan.