Algoritma LPT-Branch and Bound Pada Penjadwalan Flexible Flowshop untuk Meminimasi Makespan
(1) * Dana Marsetiya Utama   (Jurusan Teknik Industri, Fakultas Teknik, Universitas Muhammadiyah Malang)
(*) Corresponding Author
This article discussed the problem of flow shop scheduling to minimize the makespan. The purpose of this article is to develop the LPT and Branch And Bound (LPT-Branch And Bound) algorithms to minimize the makespan. The proposed method is Longest Processing Time (LPT) and Branch And Bound. Stage settlement is divided into 3 parts. To proved the proposed algorithm, a numerical experiment was conducted by comparing the LPT-LN algorithm. The result of the numerical experiment shows that LPT-Branch And Bound's proposed algorithm is more efficient than the LPT-LN algorithm.
Full Text: PDF
Article ViewAbstract views : 145 times | PDF files viewed : 117 times
- There are currently no refbacks.
Copyright (c) 2018 PROZIMA (Productivity, Optimization and Manufacturing System Engineering)
This work is licensed under a Creative Commons Attribution 4.0 International License.