APLIKASI RELAKSASI LAGRANGE BERDASARKAN METODE BRANCH AND BOUND DALAM PENJADWALAN ( APPLICATION OF LAGRANGIAN RELAXATION BASED BRANCH AND BOUND METHODE IN SCHEDULING )

PAKPAHAN, AFNIRIA, Irwan Endrayanto

2016 | Disertasi | FMIPA

The research examine about scheduling that one of the NP-Hard Problem, using Lagrangean relaxation based branch and bound methode. The first, branch and bound use in single machine scheduling, then dominance properties will be proposed to reduce the number of nodes. Lagrangean relaxation can be used in combinatorial optimization problem determine lower bound. The last examine will be applied Lagrangean relaxation in single machine scheduling.

Kata Kunci : N