Algoritma LPT-Branch and Bound Pada Penjadwalan Flexible Flowshop untuk Meminimasi Makespan
| Main Author: | Utama, Dana Marsetiya |
|---|---|
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
Universitas Muhammadiyah Sidoarjo
, 2019
|
| Subjects: | |
| Online Access: |
http://ojs.umsida.ac.id/index.php/prozima/article/view/1527 http://ojs.umsida.ac.id/index.php/prozima/article/view/1527/1589 |
Daftar Isi:
- 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.