Algoritma LPT-Branch and Bound Pada Penjadwalan Flexible Flowshop untuk Meminimasi Makespan
2019 ◽
Vol 2
(1)
◽
pp. 20
Keyword(s):
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.
2012 ◽
Vol 605-607
◽
pp. 528-531
2017 ◽
Vol 07
(06)
◽
pp. 27-33
◽
Keyword(s):
Keyword(s):
2017 ◽
Vol 36e
(2)
◽
pp. 101
◽
Keyword(s):
Keyword(s):
2013 ◽
Vol 6
(4)
◽
pp. 7-15
2005 ◽
pp. 630-637
◽
2020 ◽
Vol ahead-of-print
(ahead-of-print)
◽
2019 ◽
Vol 52
(6)
◽
pp. 1009-1036
◽