[1]
D. M. Utama, “LPT-Branch and Bound Algorithm in Flexible Flowshop Scheduling to Minimize Makespan: Algoritma LPT-Branch and Bound Pada Penjadwalan Flexible Flowshop untuk Meminimasi Makespan”, prozima, vol. 2, no. 1, pp. 20–26, Jun. 2018.