Utama DM. 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 [Internet]. 2018 Jun. 30 [cited 2025 Sep. 8];2(1):20-6. Available from: https://prozima.umsida.ac.id/index.php/prozima/article/view/1550