Skripsi
PENERAPAN ALGORITMA GENERATE AND TEST DAN METODE HUNGARIAN UNTUK MASALAH PENUGASAN PADA OPERATOR TLS 1 (TRAIN LOADING STATION) TAL (TAMBANG AIR LAYA) PT. BUKIT ASAM, Tbk TANJUNG ENIM
Assignment problems are very common in a company. In the problem of assignment of officers will be placed on the most appropriate task. Assignment problems at PT. Bukit Asam, Tbk is located in TLS 1 TAL which is solved with the Generate and Test algorithm, the Hungarian method and a linear program modeling which is solved with LINGO 13.0 software. Operator placement on shift is one of the factors that influence the process of transporting coal by train at PT. Bukit Asam, Tbk. If the placement of operators is not appropriate, it can disrupt the process of transporting coal so that the target of transportation from TLS 1 TAL to Tarahan port is not achieved. This problem is called the assignment problem. The total transportation per week before implementing the Generate and Test algorithm, the Hungarian method, and the help of the LINGO 13.0 software is 185 KA. The total transportation per week after applying the Generate and Test algorithm, the Hungarian method, and LINGO 13.0 assistance is 413 KA. The solutions for the Generate and Test algorithm, the Hungarian method, and the help of the LINGO 13.0 software are different. In the first week's solution, the Generate and Test algorithm and the Hungarian method selected paths were C-D-A, while the solution from LINGO 13.0 software was C-D-B.
Inventory Code | Barcode | Call Number | Location | Status |
---|---|---|---|---|
2307000681 | T89033 | T890332023 | Central Library (Referens) | Available |
No other version available