Anda belum login :: 27 Nov 2024 07:18 WIB
Detail
BukuUSULAN PERBAIKAN PENENTUAN JUMLAH CCTV (CLOSED CIRCUIT TELEVISION) PADA LOKASI PARKIR MOBIL DI MGK KEMAYORAN MENGGUNAKAN METODE BINARY INTEGER PROGRAMMING (BIP) DENGAN KASUS SET COVERING PROBLEM (SCP)
Bibliografi
Author: PRATAMA, MICHAEL BOY ; Silalahi, Agustinus (Advisor)
Topik: CCTV; Set Covering Problem; Binary Integer Programming; Linear Programming
Bahasa: (ID )    
Penerbit: Program Studi Teknik Industri Fakultas Teknik Unika Atma Jaya     Tempat Terbit: Jakarta    Tahun Terbit: 2018    
Jenis: Theses - Undergraduate Thesis
Fulltext: 34-MICHAEL BOY PRATAMA-2014043107.pdf (4.83MB; 36 download)
Ketersediaan
  • Perpustakaan Pusat (Semanggi)
    • Nomor Panggil:
    • Non-tandon: tidak ada
    • Tandon: 1
 Lihat Detail Induk
Abstract
MGK Kemayoran or MGK Mega Kemayoran is a mall built with a new concept that offers an ideal place for business development engaged in trading of Engineering Tools, Electricity, Electronics, Computers and Parts. MGK Kemayoran was built in 2005 with a focus on engineering and automotive sales. But in 2012, MGK kemayoran began to focus on the automotive mall. To maintain the safety of MGK Kemayoran parking is by installing CCTV and there are employees parking on certain floors. MGK Kemayoran also does not want to spend a very large cost for the procurement of CCTV on the parking lot. But on the other hand, MGK Kemayoran wants to keep the similarity in the parking lot. In determining the number of CCTV will use Set Covering Problem model. Solution of solution using mathematical model obtained from Binary Integer Programming then continued with Linear Programming. Software that helps solve the case of Set Covering Problem is Excel Solver and Lingo. The results obtained based on Excel Solver and Lingo are the same ie, reduced by 2 CCTV per floor. Total unused CCTV is 8 CCTV. The reduced price is Rp. 2.920.000.
Opini AndaKlik untuk menuliskan opini Anda tentang koleksi ini!

Lihat Sejarah Pengadaan  Konversi Metadata   Kembali
design
 
Process time: 0.125 second(s)