Garuda - Garba Rujukan Digital

p-Index From 2019 - 2024

0.61

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

Suprayogi Suprayogi

Institut Teknologi Bandung

Author-ID : 393756

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

Published : 21 Documents Claim Missing Document

Claim Missing Document

Articles

Title

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.

Tabu Search for the Vehicle Routing Problem with Multiple Trips, Time Windows, and Simultaneous Delivery-Pickup Suprayogi, Suprayogi; Priyandari, Yusuf
Jurnal Teknik Industri Vol 19, No 2 (2017): Desember 2017
Publisher : Institute of Research and Community Outreach - Petra Christian University

This paper discusses a vehicle routing problem with multiple trips, time windows, and simultaneous delivery-pickup (VRPMTTWSDP). This problem is a variant of the basic vehicle routing problem (VRP) including the following characteristics: multiple trips, time windows, and simultaneous delivery-pickup. Â In this paper, a solution approach based on tabu search (TS) is proposed. In the proposed TS, the sequential insertion (SI) algorithm is used to construct an initial solution. A neighbor structure is generated by applying an operator order consisting of eleven operators of relocation, exchange, and crossover operators. A tabu solution code (TSC) method is applied as a tabu restriction mechanism. Computational experiments are carried out to examine the performance of the proposed TS using hypothetical instances. The performance of the proposed TS is compared to the local search (LS) and the genetic algorithm (GA). The comparison shows that the proposed TS is better in terms of the objective function value.

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.

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

PENENTUAN RUTE TRUK PENGUMPULAN DAN PENGANGKUTAN SAMPAH DI BANDUNG Fitria, Lisye; Susanty, Susy; Suprayogi, Suprayogi
Jurnal Teknik Industri Vol 11, No 1 (2009): JUNE 2009
Publisher : Institute of Research and Community Outreach - Petra Christian University

The garbage collection constitutes the main contributor in terms of the garbage cost management. Garbage collection scheduling model is a variable that determine cost center. Regarding to the existing condition, scheduling model could be designed concerning to the constraints, such as: amount of vehicles, transportation time, and transport system. This research develops a Vehicle Routing Problem (VRP) model for determining the optimal route in garbage gathering collection. The VRP model utilizes intermediate facility. This model is called the Vehicle Routing Problem with Multiple Trips and Intermediate Facility (VRPMTIF). The VRPMTIF is solved by using a Sequential Insertion Algorithm. The algorithm applied to the determine garbage collections routes in Bandung with result as follows: 28 vehicles for West Bandung, 41 vehicles for Central Bandung, and 68 vehicles for East Bandung where there are different accomplishment time for each scenario. Abstract in Bahasa Indonesia: Proses pengumpulan sampah merupakan kontributor terbesar dalam biaya pengelolaan sampah. Rute pengumpulan sampah adalah faktor penentu biaya pengelolaan sampah. Rute pengumpulan sampah dapat dibuat dengan memperhatikan keterbatasan yang ada seperti: jumlah kendaraan, waktu angkut dan sistem pengangkutan yang dilakukan. Penelitian ini bertujuan untuk menentukan rute pengumpulan dan pengangkutan sampah. Kondisi pengumpulan sampah dapat dianalogikan dengan model Vehicle Routing Problem dengan menambahkan intermediate facility pada akhir rute, yakni tempat pembuangan sampah akhir. Model ini disebut Vehicle Routing Problem with Multiple Trips and Intermediate Facility (VRPMTIF). Penentuan rute pengumpulan sampah VRPMTIF diselesaikan dengan menggunakan algoritma sequential insertion. Algoritma tersebut diterapkan pada penentuan rute pengumpulan sampah di Kota Bandung dengan hasil sebagai berikut: 28 tur untuk Bandung Barat, 41 tur untuk Bandung Tengah, dan 68 tur untuk Bandung Timur dengan waktu penyelesaian yang berbeda untuk setiap skenario. Kata kunci: Vehicle Routing Problem, multiple trips, intermediate facility, algoritma sequential insertion

Model Integrasi Keputusan Lokasi, Perutean Kendaraan, dan Pengendalian Persediaan Pada Sistem Rantai Pasok Tiga Eselon Saragih, Nova; Nur Bahagia, Senator; Suprayogi, Suprayogi; Syabri, Ibnu
Jurnal Teknik Industri Vol 19, No 1 (2017): JUNE 2017
Publisher : Institute of Research and Community Outreach - Petra Christian University

Keputusan lokasi, perutean kendaraan, dan kebijakan persediaan merupakan keputusan yang saling terkait satu dengan yang lain. Keputusan pengendalian persediaan, seperti ukuran lot pemesanan dan frekuensi pemesanan akan mempengaruhi baik itu ongkos persediaan dan ongkos transportasi. Sebagai contoh, pengiriman dalam kuantitas yang sedikit dan frekuensi yang sering menyebabkan pengurangan ongkos persediaan tetapi membutuhkan tambahan ongkos transportasi. Selanjutnya, keputusan perutean dan keputusan pengendalian persediaan akan mempengaruhi keputusan pemilihan lokasi sebab pemilihan lokasi ditentukan berdasarkan kriteria ongkos sistem minimum. Kegagalan dalam melibatkan ongkos persediaan dan ongkos transportasi ke dalam pertimbangan ketika memilih lokasi dapat menyebabkan sub-optimalitas sebab keputusan pemilihan lokasi memiliki dampak yang besar pada ongkos persediaan dan ongkos transportasi. Oleh karena itu, bagaimana memilih lokasi, menentukan rute kendaraan, dan mengendalikan persediaan yang optimal menjadi isu yang penting dalam merancang sebuah sistem logistik. Penelitian ini mengembangkan model integrasi yang secara simultan mengoptimisasikan keputusan lokasi, rute kendaraan, dan pengendalian persediaan pada sistem rantai pasok tiga eselon yang belum pernah dikembangkan sebelumnya. Entitas yang terlibat dalam rantai pasok kajian terdiri dari satu Pemasok, multi Depot, dan multi Ritel. Karakteristik permintaan yang dipertimbangkan dalam penelitian ini bersifat probabilistik dan jumlah produk terdiri dari satu produk. Model integrasi yang dikembangkan selanjutnya dipecahkan dengan metode optimal dan metode heuristik. Setelah dilakukan perbandingan dengan model dekomposisi diperoleh kesimpulan bahwa model integrasi menghasilkan ongkos total sistem yang lebih kecil.

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.

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

Model Optimisasi untuk Penjadwalan Ulang Perjalanan Kereta Api Suprayogi, Suprayogi; Ramdhani, Hery
Jurnal Teknik Industri Vol 17, No 2 (2015): DECEMBER 2015
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.9744/jti.17.2.97-104

This paper discusses the train rescheduling problem due to disturbances. The train rescheduling problem discussed in this paper is taken from a real train network of DAOP II Bandung in Jawa, Indonesia. The train network consists of block sections including unidirectional double-tracks and bidirectional single-tracks. There are some connections among trains because they use same rolling stocks. A mixed integer linear programming model is formulated to represent the problem. Main decision variables of the model are new departure and arrival times due to the disturbance. The objective function to be minimized is the total weighted delay. The model is examined using a hypothetical instance for four disturbance cases. Numerical experiments show that the model can represent the problem under study

Co-Authors A. Hakim Halim Ahmad S. Indrapriyatna Amelia Santoso Aris Munandar Aris Siswanto Avisenna, Hikmat Bermawi P. Iskandar Dian Puspita Dwi Arman Prasetya 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 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 Search

Found 9 Documents Search Journal : Jurnal Teknik Industri

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 9 Documents
Search
Journal : Jurnal Teknik Industri