Artikel Jurnal Web Programming Pdf
Coal at PT. ZXC is transported from the mine pier through the Barito River using a barge to transmit to the mother vessel. Obstacles experienced by the barge is when the dry season level of Barito river dropped dramatically, especially in areas near the river upstream. When that happens, a river that can usually be skipped by a barge to a capacity of 5,000 tons, can only be passed by the barge if it reduces its load to 2,000 tons only. Even when at low water level conditions, barges can not pass through at all. Based on the simulation result, the best scenario for PT. ZXC in achieving the sales target of 2.5 million tonnes is to keep operating all existing barges in the event of silting, although barges can not sail with full load. Since the total cost for option 1 (no transport during shallow water) is Rp 81,046,464,410, while the total cost for option 2 (there is a haul at the time of silting) is Rp 55,091,040,758.
- Perancangan Simulasi Operasi Angkutan Batubara Berbasis Web Programming (Studi Kasus: Pendangkalan di Sungai Barito)
- Current Information Web applications using the programming language PHP Triad and Macromedia Dreamweaver.
- Web-based billing application that is used to calculate the cost of internet cafe using the PHP programming language
- ONLINE ADVERTISING WEBSITE INSTALLATION PLACE WITH LANGUAGES PHP AND MYSQL PROGRAMMING
- SISTEM PORTABLE UNTUK APLIKASI WEB DENGAN MEMANFAATKAN BATCH FILE PROGRAMMING
- WEB INFORMASI EKSEKUTIF PADA PEMERINTAH KABUPATEN SIDOARJO UNTUK MEMONITOR LAPORAN PERTANGGUNGJAWABAN DALAM BENTUK VISUALISASI GRAFIK YANG DIKEMBANGKAN DENGAN METODE EXTREME PROGRAMMING DAN STANDAR DOKUMEN READYSET
- SISTEM INFORMASI GEOGRAFIS PARIWISATA KOTA PADANG MENGGUNAKAN APPLICATION PROGRAMMING INTERFACE (API) GOOGLE MAPS BERBASIS WEB
- MEMBANGUN WEB SERVICE PADA SISTEM INFORMASI PERIZINAN ANGKUTAN UMUM DENGAN METODE EXTREME PROGRAMMING (STUDI KASUS DINAS PERHUBUNGAN KABUPATEN BANDUNG BARAT)
- Developing a Secure Programming Module to cope with Modern Vulnerabilities
- Optimal Solution Of Minmax 0/1 Knapsack Problem Using Dynamic Programming