Garuda - Garba Rujukan Digital

p-Index From 2017 - 2022

1.564

P-Index

This Author published in this journals

All Journal Jurnal Teknik Industri J@TI (TEKNIK INDUSTRI) REKA INTEGRA Forum Ilmu Sosial Prosiding SNATIF Jurnal Teknologi Pertanian Unnes Civic Education Journal Integritas: Jurnal Antikorupsi Rainbow : Journal of Literature, Linguistics and Cultural Studies JUARA: JURNAL WAHANA ABDIMAS SEJAHTERA

Suprayogi Suprayogi

Institut Teknologi Bandung

Author-ID : 393756

Agriculture, Biological Sciences & Forestry Humanities Civil Engineering, Building, Construction & Architecture Computer Science & IT Education Engineering Environmental Science Industrial & Manufacturing Engineering Languange, Linguistic, Communication & Media Law, Crime, Criminology & Criminal Justice Social Sciences

Published : 22 Documents Claim Missing Document

Claim Missing Document

Articles

1 2 3

MODEL PENENTUAN KUANTITAS PLASTIK BEKAS UNTUK HOME INDUSTRY DAUR ULANG DENGAN PENDEKATAN GOAL PROGRAMMING Verza, Mochamad; Suprayogi, Suprayogi; Susanty, Susy
REKA INTEGRA Vol 3, No 3 (2015): Edisi Kesebelas
Publisher : REKA INTEGRA

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (708.155 KB)

Makalah ini membahas mengenai model reverse logistics yang terintegrasi dengan pendekatan goal programming untuk menyelesaikan masalah dengan multi-objective, kemudian untuk mencari jumlah plastik bekas yang optimal dari aspek ekonomi dan aspek lingkungan, yang diwakili oleh fungsi tujuan minimisasi biaya reverse logistics, minimisasi dampak lingkungan dan maksimisasi pengumpulan plastik bekas. Model dirancang untuk home industry plastik bekas di Kiaracondong kota Bandung. Model diimplementasikan untuk 1 recycling center, 1 collection center, 1 disposal center, 5 end customer, 1 first customer, dengan periode 1 bulan. Disimpulkan bahwa dari 6 kombinasi fungsi tujuan memiliki output berupa 2 kelompok pencapaian, dimana varian pertama fungsi tujuan maksimisasi pengumpulan plastik tidak tercapai, dan varian kedua dimana fungsi tujuan biaya reverse logistics tidak tercapai, hal ini karena perbedaan prioritas. Kata kunci : Reverse Logistics, Plastik Bekas, Goal Programming. Â ABSTRACT This paper discusses the model of integrated reverse logistics with the goal programming approach to solve the problem with multi-objective, then to find the optimal amount of scrap plastic from the economic and environmental aspects, which are represented by the objective function minimization reverse logistics costs, minimization of environmental impact and maximization of collecting scrap plastic. The model is designed for home industry Kiaracondong used plastic in the city of Bandung. The model is implemented for 1 recycling center, 1 collection center, 1 disposal center, 5 end customer, 1 first customer, with a period of 1 month. It was concluded that the combination of the objective function of 6 has an output in the form of two groups of achievement, where the first variant of collecting plastic maximization objective function is not reached, and the second variant in which the function of reverse logistics cost goals are not achieved, it is because of differences in priorities. Keywords: Reverse Logistics, Scrap Plastic, Goal Programming.

Teknik Relaksasi Lagrange untuk Penjadwalan Pekerjaan Majemuk dengan Penggunaan Sumberdaya Simultan Suprayogi, Suprayogi; Valentine, Valentine
Jurnal Teknik Industri Vol 17, No 2 (2015): DECEMBER 2015
Publisher : Institute of Research and Community Outreach - Petra Christian University

This paper discusses the multiple jobs scheduling problem with simultaneous resources. The problem involves one or more jobs with each job consist of a set of operations. Each operation is performed by more than one resource simultaneously. Number of units of each resource used for performing an operation is one or more units. The problem deals with determining a schedule of operations minimizing total weighted tardiness. In this paper, solution techniques based on Lagrangian relaxation are proposed. In general, the Lagrangian relaxation technique consists of three parts run iteratively, i.e., (1) solving individual job problems, (2) obtaining a feasible solution, and (3) solving a Lagrangian dual problem. For solving the individual job problems, two approaches are applied, i.e., enumeration and dynamic programÂ¬ming. In this paper, the Lagrangian relaxation technique using the enumeration and dynamic programming approaches are called RL1 and RL2, respectively. The solution techniques proposed are examined using a set of hypothetical instances. Numerical experiments are carried out to compare the performance of RL1, RL2, and two others solution techniques (optimal and genetic algorithm techniques). Numerical experiments show that RL2 is more efficient than RL1. In terms of the solution quality, it is shown that RL2 gives same results compared to the optimal technique and genetic algorithm. However, both RL2 and genetic algorithm can handle larger problems efficiently.

PEMECAHAN MASALAH RUTE KENDARAAN DENGAN TRIP MAJEMUK, JENDELA WAKTU DAN PENGANTARAN-PENJEMPUTAN SIMULTAN MENGGUNAKAN ALGORITMA GENETIKA Suprayogi, Suprayogi
J@ti Undip : Jurnal Teknik Industri Volume 12, No. 2, Mei 2017
Publisher : Departemen Teknik Industri, Fakultas Teknik, Universitas Diponegoro

Masalah rute kendaraan (MRK) merupakan salah satu masalah keputusan yang memegang peranan penting dalam kegiatan transportasi dan distribusi dalam manajemen logistik. MRK terkait dengan penentuan rute-rute kendaraan yang meminimumkan total jarak yang ditempuh dengan memperhatikan pembatas-pembatas berikut: (1) tiap rute berawal dan berakhir di depot, (2) tiap kendaraan hanya melayani satu rute, (3) tiap pelanggan dilayani oleh satu rute, (4) seluruh pelanggan harus dilayani, dan (5) total muatan untuk tiap rute tidak melebihi kapasitas kendaraan. Dalam literatur, definisi ini merupakan definisi untuk MRK dasar atau klasik. Makalah ini membahas perluasan dari MRK dasar yang mencakup karakteristik-karakteristik berikut: (1) trip majemuk (TM), (2) jendela waktu (JW) dan (3) pengantaran-penjemputan simultan (AJS). Metode pemecahan berbasis algoritma genetika (AG) diusulkan untuk memecahkan MRK yang dibahas dalam makalah ini. AG yang diusulkan diuji-coba dengan menggunakan beberapa contoh hipotetik.AbstractVehicle routing problem (VRP) is one of decision problems having an important role in transportation and distribution activity in the logistic management. The VRP deals with determining vehicle routes that minimizes total distance by satisfying the following constraints: (1) each route starts and ends at the depot, (2) each vehicle serves only one route, (3) each costumer is served by one route, (4) all customers must be served, and (5) total load for each route does not exceed the vehicle capacity. In literature, this definition is the definition for the basic or classical VRP. This paper discusses an extension of the basic VRP including the following characteristics: (1)multiple trips (MT), (2) time windows (TW), and (3) simultaneous pickup-delivery (SPD). A solution method based on genetic algorithm (GA) is proposed to solve the VRP discussed in this papaer. The proposed GA is examined using some hypothetical instances.

INTEGRASI KEBIJAKAN PERSEDIAAN-TRANSPORTASI (PENGIRIMAN LANGSUNG DAN BERBAGI) DI SISTEM RANTAI PASOK 4-ESELON Santoso, Amelia; Bahagia, Senator Nur; Suprayogi, Suprayogi; Sasongko, Dwiwahju
Jurnal Teknik Industri Vol 11, No 1 (2009): JUNE 2009
Publisher : Institute of Research and Community Outreach - Petra Christian University

Coordination among manufacturers, distributors and retailers is a key of success in supply chain management. Moreover, coordination is also needed in distributing product (managing inventory and transportation) from an echelon to its successive echelons. The transportation policy and inventory policy affect each others so the inventory and transportation policy should be integrated. This paper develops model of integrated inventory-transportation policies in 4-echelons supply chain systems that consist of a manufacturer, a distribution center, distributors and retailers. This model considers continuous production process as well as time-dependent demand. We consider direct and sharing shipping at distributor when we only consider direct shipping at manufacturer and distribution center. The production policy at the manufacturer, replenishment policies at the distribution center, distributors and retailers, and transportation policies at the manufacturer, distribution center and distributors will be determined in order to minimize system cost. The system cost consists of total costs at the manufacturer, distribution centers, distributors and retailers. Due to the model is classified as NP-hard model, the model is solved using genetic algorithm. From the result of genetic algorithm, the total system cost if the distributors who use sharing shipping as well as direct shipping, is lower stasitiscally than the distributors who only use direct shipping for delivering produk to their retailers. Abstract in Bahasa Indonesia: Koordinasi antar pabrik, distributor dan pengecer merupakan kunci keberhasilan dalam sistem rantai pasok. Koordinasi diperlukan saat pendistribusian produk (pengaturan persediaan dan transportasi) dari satu eselon ke eselon di bawahnya. Kebijakan transportasi mempengaruhi kebijakan persediaan dan sebaliknya oleh karena itu kedua kebijakan tersebut seharusnya ditetapkan secara terintegrasi. Paper ini mengembangkan model integrasi kebijakan persediaan-transportasi di sistem rantai pasok 4-eselon yang terdiri dari sebuah pabrik dengan proses produksi kontinu, sebuah gudang penyangga, multi distributor dan multi pengecer. Model ini mempertimbangkan permintaan yang bergantung pada waktu, pengiriman langsung di pabrik dan gudang penyangga serta pengiriman langsung dan berbagi di distributor. Paper ini menetapkan kebijakan produksi di pabrik, kebijakan pemesanan di gudang penyangga, distributor dan pengecer serta kebijakan transportasi di pabrik, gudang penyangga dan distributor untuk meminimumkan ongkos sistem. Ongkos sistem terdiri atas ongkos total di pabrik, gudang penyangga, distributor dan pengecer. Model yang dikembangkan termasuk dalam kategori NP-hard sehingga dikembangkan metode solusi yang berbasis pada algoritma genetika. Kesimpulan yang diperoleh dari hasil algoritma genetika menyatakan bahwa ongkos total sistem lebih kecil secara statistik jika pengiriman langsung dan berbagi dipergunakan di distributor dibandingkan hanya menggunakan pengiriman langsung. Kata kunci: integrasi, kebijakan persediaan, kebijakan transportasi, multi eselon

MODEL PENJADWALAN BATCH PADA SATU MESIN YANG MENGALAMI DETERIORASI UNTUK MINIMASI TOTAL BIAYA SIMPAN DAN BIAYA KUALITAS S. Indrapriyatna, Ahmad; Suprayogi, Suprayogi; P. Iskandar, Bermawi; Halim, A. Hakim
Jurnal Teknik Industri Vol 10, No 1 (2008): JUNE 2008
Publisher : Institute of Research and Community Outreach - Petra Christian University

This research discusses batch scheduling model accommodating the condition of machine deterioration. The proposed model has changed the formulation of quality cost from that discussed in Indrapriyatna et al. (2007a), especially in the internal and external failure costs. It is assumed that the distribution of time between out-of-control conditions follows the exponential distribution. An algorithm has been proposed. This research concludes that, for continue batch size, the greater the sample size proportion of the batch size, the greater the total cost and number of batches. In addition, the greater the probability of producing nonconforming products, the greater the total cost. For any values of the probability, the number of batches will be the same, but the batch sizes are different. On the other hand, for model with discrete batch sizes, we used Indrapriyatna et al. (2007b) approach to solve the problem. Abstract in Bahasa Indonesia: Penelitian ini membahas model penjadwalan batch yang mengakomodasikan kondisi mesin terdeteriorasi, yang akan menyebabkan produk menjadi nonconforming. Pengembangan ini mengubah formulasi biaya kualitas yang telah dirumuskan pada model Indrapriyatna et al. (2007a), khususnya untuk Biaya Kegagalan Internal dan Biaya Kegagalan Eksternal. Dalam model usulan, waktu antar kondisi out-of-control diasumsikan berdistribusi eksponensial. Sebuah algoritma penyelesaian dirancang untuk model usulan tersebut. Studi ini menunjukkan bahwa, untuk model dengan ukuran batch kontinu, semakin besar proporsi ukuran sampel menyebabkan biaya total dan jumlah batch yang semakin besar. Selain itu, semakin besar peluang produk nonconforming dihasilkan maka akan menyebabkan semakin besar total biaya. Observasi lain menunjukkan bahwa jumlah batch selalu sama untuk sebarang nilai peluang; walaupun ukuran masing-masing batch berbeda. Pada model dengan ukuran batch diskrit digunakan 3 buah metode untuk mengubah ukuran batch menjadi integer yang diusulkan oleh Indrapriyatna et al. (2007b) dan menghasilkan kesimpulan yang sama. Kata kunci: mesin terdeteriorasi, produk nonconforming, ukuran batch kontinu, ukuran batch diskrit.

Development of Small Scale Tape Industry through Composting Its Solid Waste Suprayogi, Suprayogi; Hidayat, Nur; Santoso, E.F. Sri Maryani; L., Endah Rahayu; Siswanto, Aris
Jurnal Teknologi Pertanian Vol 9, No 1 (2008)
Publisher : Fakultas Teknologi Pertanian Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

The cassava husk is solid waste of production process of cassava, the cassava husk have big enough potency of amount side. This study aimed to exploit the solid waste of cassava husk become compost, so that can improve economic value of the waste and to know the starter concentration of Aspergillus niger sp and the appropriate time of incubation so that get quality compost of cassava husk, and for the eligibility of small industrial scale cassava husk compostThe process of composting Windrow open system uses starter of Aspergillus niger sp 10, 20 and 30 % with time of incubation during 6, 9, 12, 15, 18, 21, 24, 27, 30 days. Elections of the best treatment pursuant to compost parameter standard show that treatment of K7 that is addition of starter rate 0% with time of incubation 24 days are the best treatment. The best treatment result have rate of C 22.87%, Total N 11.23%, C/N 18.60%, P2O5 0.82%, K2O 0.92%, KA 18.50%, pH 7.05, yield 41.04%, temperature 27 0C and amount of spores 144.543 (x104)/g. From the result analyses eligibility of effort making of competent cassava husk compost to be run calculation of criterion eligibility of effort, mount advantage of investment is competent. Economically asses from waste can mount because can become an valuable product cell.Key words: cassava husk, compost, Aspergillus niger sp

ALGORITMA GENETIKA UNTUK PEMECAHAN MASALAH RUTE KENDARAAN DENGAN UKURAN DAN CAMPURAN ARMADA, TRIP MAJEMUK, PENGIRIMAN TERBAGI, PRODUK MAJEMUK, DAN KENDARAAN DENGAN KOMPARTEMEN MAJEMUK Suprayogi, Suprayogi; Paillin, Daniel Bunga
Jurnal Teknik Industri Vol 19, No 2 (2017): Desember 2017
Publisher : Institute of Research and Community Outreach - Petra Christian University

This paper discusses a variant of the basic vehicle routing problem (VRP) by including the following characteristics: fleet size and mix, multiple trips, split delivery, and multiple compartments. One of real cases of this problem is related to determining tanker?s routes in delivering fuel products from a supply port to a number of destination ports. Each tanker has several compartments where each compartment is dedicated to a certain fuel product. In this paper, a solution approach based on genetic algorithm (GA) is proposed and tested using nine hypothetical instances. Experiment results show that the proposed GA gives consistent results measured by coefficient variations

Genetic Algorithm for Solving Location Problem in a Supply Chain Network with Inbound and Outbound Product Flows Suprayogi, Suprayogi; Bahagia, Senator Nur; Thaddeus, Yudi
Jurnal Teknik Industri Vol 18, No 2 (2016): DECEMBER 2016
Publisher : Institute of Research and Community Outreach - Petra Christian University

This paper considers a location problem in a supply chain network. The problem addressed in this paper is motivated by an initiative to develop an efficient supply chain network for supporting the agricultural activities. The supply chain network consists of regions, warehouses, distribution centers, plants, and markets. The products include a set of inbound products and a set of outbound products. In this paper, definitions of the inbound and outbound products are seen from the regionâ€™s point of view.Â The inbound product is the product demanded by regions and produced by plants which flows on a sequence of the following entities: plants, distribution centers, warehouses, and regions. The outbound product is the product demanded by markets and produced by regions and it flows on a sequence of the following entities: regions, warehouses, and markets. The problem deals with determining locations of the warehouses and the distribution centers to be opened and shipment quantities associated with all links on the network that minimizes the total cost. The problem can be considered as a strategic supply chain network problem. A solution approach based on genetic algorithm (GA) is proposed. The proposed GA is examined using hypothetical instances and its results are compared to the solution obtained by solving the mixed integer linear programming (MILP) model. The comparison shows that there is a small gap (0.23%, on average) between the proposed GA and MILP model in terms of the total cost. The proposed GA consistently provides solutions with least total cost. In terms of total cost, based on the experiment, it is demonstrated that coefficients of variation are closed to 0.

ESTIMASI JARAK DAN KECEPATAN PADA ALAT UJI STATIS ROKET LATIH EXPERIMENT DENGAN PEDEKATAN GAYA DORONG OPTIMAL Hurmuzi, Erik Roma; Prasetya, Dwi Arman; Suprayogi, Suprayogi
Prosiding SNATIF 2017: Prosiding Seminar Nasional Teknologi dan informatika (BUKU 1)
Publisher : Prosiding SNATIF

Show Abstract | Download Original | Original Source | Check in Google Scholar

AbstrakDalam proses pengujian kerja roket, salah satu cara dapat dilakukan dengan uji statis roket. Istilah âuji statisâ mengandung pengertian pengujian dalam keadaan statis/diam. Hasil yang didapat dari proses pengujian tersebut salah satunya adalah gaya dorong roket (thrust). Sehingga perlu dirancang sebuah alat ukur tekanan gaya dorong (thrust) dengan menggunakan sensor loadcell yang kemudian ditampilkan ke laptop berupa data grafik dan tabel yang dapat dilihat secara realtime,sehingga bisa dihitung estimasi atau perkiraan jarak dan kecepatan roket menggunakan metode pedekatan gaya dorong optimal, kemudian data tersebut disimpan didalam database menggunakan microsoft access dan juga tersimpang pada micro SD agar memudahkan dalam fleksibilitas pemindahan data ke perangkat lainÂ Kata kunci: sensor loadcell, thrust, uji statis

EVALUASI KETEPATAN SASARAN ROKET MENGGUNAKAN METODE POLAR Waskito, Arga Gladi; Nachrowie, Nachrowie; Suprayogi, Suprayogi
Prosiding SNATIF 2017: Prosiding Seminar Nasional Teknologi dan informatika (BUKU 1)
Publisher : Prosiding SNATIF

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstrak Pada saat ini pengembangan roket sudah mulai pesat dan banyak negaraânegara yang mengembangkan teknologi roket namun kebanyakan masih belum memperhatikan faktor perkenaan pada roket. Dalam tugas akhir ini akan dibahas mengenai pengujian ketepatan sasaran roket menggunakan metode polar. Pengujian ini berfungsi untuk mendeteksi dan menguji ketepatan roket menggunakan GPS/GPRS/GSM Module V3.0 dan diproses oleh Mikrokontroler Arduino Uno R3, lalu dikirim menggunakan modul GSM/GPRS SIMCOM SIM908 kemudian dikirim ke HP via sms (Short Message Service). Tanpa GPS tidak akan tahu dimana titik perkenaan roket yang telah diluncurkan, kemudian data yang diperoleh akan dianalisa menggunakan metode polar dengan parameter jarak dan eror, sehingga dari data yang diperoleh dapat diketahui data yang akurat dan digunakan untuk menganalisa perkenaan sebuah roket. Â Kata kunci: GPS, Polar, Roket, SMS

Co-Authors A. Hakim Halim Ahmad S. Indrapriyatna Amelia Santoso Aris Munandar Aris Siswanto Avisenna, Hikmat Bermawi P. Iskandar Dian Puspita Dwi Indriastuti, Dwi Dwiwahju Sasongko E.F. Sri Maryani Santoso Eko Wahyu Jamaluddin, Eko Wahyu Endah Rahayu L. Ferdinand, Julius Firdausyi, Izzati Ardhan Hamonang Sigalingging, Hamonang Hery Ramdhani, Hery Hurmuzi, Erik Roma Ibnu Syabri Isdaryanto, Noorochmat Ismail, Khosid Mahendra Lestari, Eta Yuni Lisye Fitria Mochamad Verza, Mochamad Muhammad Syamsul Hadi, Muhammad Syamsul Nachrowie, Nachrowie Nimas Mayang sabrina, Nimas Mayang Nur Bahagia, Senator Nur Hidayat Nurdiansyah, Isnan One, Ferdyandika Putra Aprilia Paillin, Daniel Bunga Prasetya, Dwi Arman Saragih, Nova Senator Nur Bahagia Sulistyawati Kumalasari, Sulistyawati Susy Susanty Thaddeus, Yudi Toha, Muhamad Valentine Valentine, Valentine Waskito, Arga Gladi Winda, Syahdu Yusuf Priyandari

Title

Found 22 Documents
Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title Search

Found 22 Documents Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 22 Documents
Search