Comparison Study about Production Scheduling System from Some Paper Case Studies

Eliyanti, Vania and Gozali, Lina and Widodo, Lamto and Daywin, Frans J. Comparison Study about Production Scheduling System from Some Paper Case Studies. Comparison Study about Production Scheduling System from Some Paper Case Studies.

Text buktipenelitian_10306002_6A192853.pdf Download (216kB)

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.

Item Type:	Article
Subjects:	Penelitian > Fakultas Teknik
Divisions:	Fakultas Teknik > Teknik Industri
Depositing User:	Puskom untar untar
Date Deposited:	21 Dec 2020 12:51
Last Modified:	21 Dec 2020 12:51
URI:	https://repotest.untar.ac.id/id/eprint/13747

Actions (login required)

View Item