Article Per Year (5 Year)
p-Index From 2019 - 2024
3.93
P-Index
This Author published in this journals
All Journal Jurnal Teknik Industri Jurnal Gamma Jurnal Teknik Industri SPEKTRUM INDUSTRI Jurnal Optimasi Sistem Industri Jurnal Ilmiah Teknik Industri Jurnal Sistem dan Manajemen Industri PERFORMA : Media Ilmiah Teknik Industri Jurnal Teknik Industri Jurnal SOLMA JAST : Jurnal Aplikasi Sains dan Teknologi Jurnal INTECH Teknik Industri Universitas Serang Raya JPPM (Jurnal Pengabdian dan Pemberdayaan Masyarakat) Buletin Profesi Insinyur JURNAL TEKNIK INDUSTRI Journal of Applied Mechanical Engineering and Renewable Energy (JAMERE)
Annisa Kesy Garside
Fakultas Teknik, Jurusan Teknik Industri, Universitas Muhammadiyah Malang
Agriculture, Biological Sciences & Forestry Automotive Engineering Chemical Engineering, Chemistry & Bioengineering Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Earth & Planetary Sciences Economics, Econometrics & Finance Education Electrical & Electronics Engineering Energy Engineering Environmental Science Industrial & Manufacturing Engineering Materials Science & Nanotechnology Mechanical Engineering Public Health Social Sciences Transportation Other

Published : 67 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 67 Documents
Search

 3   4   5   6   7 
A Cluster-First Route-Second Heuristic Approach to Solve The Multi-Trip Periodic Vehicle Routing Problem Annisa Kesy Garside; Nabila Rohmatul Laili
Jurnal Teknik Industri Vol. 20 No. 2 (2019): August
Publisher : Department Industrial Engineering, University of Muhammadiyah Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (349.657 KB) | DOI: 10.22219/JTIUMM.Vol20.No2.172-181

Abstract

This paper discusses periodic vehicle routing problems that allow vehicles to travel on multiple trips in a single day. It is known as the Multi-Trip Periodic Vehicles (MTPVRP) Problem Route. Cluster-first route-second (CFRS) heuristics to solve MTPVRP was proposed in this study. In phase 1, customers were divided into clusters using the formulation of integer programming. Phase 2 determined the route of the cluster and verified that the total journey time to visit the trips does not exceed the working hours of the vehicle. Implementing the heuristic CFRS to solve the real problem faced by the  Liquefied petroleum gas (LPG) distributor shows that the procedure could provide a better routing solution.
Integration of Rough SWARA and COPRAS in the Performance Evaluation of Third-Party Logistics Providers Elya Rosiana; Annisa Kesy Garside; Ikhlasul Amallynda
Jurnal Teknik Industri Vol. 22 No. 1 (2021): February
Publisher : Department Industrial Engineering, University of Muhammadiyah Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (483.133 KB) | DOI: 10.22219/JTIUMM.Vol22.No1.31-42

Abstract

Currently, the use of logistics service providers in companies has become a decision chosen by several companies. Companies use Third Party Logistics (3PL) to focus more on other essential activities in the company. Evaluating the performance of a 3PL provider is an essential process in determining performance of a 3PL provider. A wrong evaluation process could lead to company’s loss. The main objective of this study was to propose a 3PL performance appraisal procedure. This study integrated the Rough method Step-wise Weight Assessment Ratio Analysis (SWARA) and the Complex Proportional Assessment Method (COPRAS) to assess the performance of 3PL providers. The SWARA Rough method was used to assess the ranking of the criteria. The results of the Rough SWARA ranking were utilized by the COPRAS method to assess supplier performance. A case study was conducted in an animal feed production company in Indonesia. The results showed that there were criteria for product safety; on-time delivery, responsiveness, and flexibility with the greatest weight among the 16 criteria used.
A Genetic Algorithm for Solving Periodic Heterogeneous Vehicle Routing Problem Amelia Khoidir; Annisa Kesy Garside
Jurnal Teknik Industri Vol. 23 No. 1 (2022): February
Publisher : Department Industrial Engineering, University of Muhammadiyah Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22219/JTIUMM.Vol23.No1.31-42

Abstract

This paper addresses the periodic heterogeneous vehicle routing problem (PHVRP), an extension of the classical vehicle routing problems (VRP). This problem is known to be confined to various real-world instances where each customer's demand should be served within a specific time horizon and a maximum demand quantity that can be delivered at each visit. The heterogeneous capacitated vehicles are available to perform the services for each customer. This paper aims to minimize the total traveling time of routes for all vehicles over the time horizon so that the customers' demands can be delivered. Thus, a novel coding scheme is also proposed to directly convert a random sequence of integers into a feasible solution, which is then embedded into algorithms. Furthermore, this paper also compares the performance of the Genetic Algorithm (GA) with the particle swarm optimization algorithm (PSO). The numerical results of the experiments show that the proposed GA is superior to PSO. However, the computation time of PSO is faster than GA.
PENJADWALAN PRODUKSI MENGGUNAKAN ALGORITMA JADWAL NON DELAY UNTUK MEMINIMALKAN MAKESPAN STUDI KASUS DI CV. BIMA MEBEL Setyo Harto; Annisa Kesy Garside; Dana Marsetya Utama
Spektrum Industri Vol 14, No 1: APRIL 2016
Publisher : Universitas Ahmad Dahlan Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (479.529 KB) | DOI: 10.12928/si.v14i1.3706

Abstract

CV. Mebel Bima merupakan sebuah perusahaan yang bergerak dalam bidang pengerjaan kayukhususnya pembuatan berbagai model daun pintu dan kusen. Tipe aliran produksi di perusaaan adalahjob shop dikarenakan pengerjaan setiap job memiliki aliran yang berbeda di setiap mesinnya.Penjadwalan produksi di perusahaan adalah diurutkan berdasarkan total waktu penyelesaian jobterlama sampai yang terkecil. Permasalahan di perusahaan selama ini adalah besarnya makespan yangdihasilkan oleh penjadwalan dengan metode perusahaan sehingga perusahaan mengalami keterlambatanpenyelesaian job dari waktu yang sudah ditetapkan sebelumnya. Berdasarkan masalah tersebutpenelitian ini bertujuan untuk menentukan urutan pengerjaan job dengan makespan yang lebih kecilmenggunakan algoritma jadwal non delay dengan prioritas SPT. Tahap-tahap dalam penelitian iniadalah dimulai dari observasi langsung di perusahaan, studi literatur, perumusan masalah, pengambilandata, pengolahan data, dan terakhir adalah pembandingan hasil penjadwalan. Metode penjadwalanproduksi yang digunakan di perusahaan menghasilkan makespan sebesar 194,4 jam atau 25 hari kerja (1hari terdapat 8 jam kerja), sedangkan usulan penjadwalan dengan menggunakan algoritma jadwal nondelay menghasilkan makespan sebesar 168,79 jam atau 22 hari kerja, dengan demikian Penjadwalandengan menggunakan algoritma jadwal non delay dapat menghemat total waktu pengerjaan sebesar24,85 jam atau 3 hari kerja lebih 0,85 jam. Kata kunci : Non delay, job shop, penjadwalan produksi, penjadwalan mesin.
PENINGKATAN KUALITAS PRODUK KERAMIK DENGAN PENDEKATAN SIX SIGMA PADA INDUSTRI KERAMIK DINOYO – MALANG Annisa Kesy Garside
Jurnal Ilmiah Teknik Industri Vol. 6, No. 1, Agustus 2007
Publisher : Department of Industrial Engineering Universitas Muhammadiyah Surakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23917/jiti.v6i1.1636

Abstract

Penelitian ini bertujuan menerapkan konsep Six Sigma untuk mengurangi terjadinya cacat dan menekan adanya variabilitas yang terjadi pada proses pembuatan keramik. Proses perbaikan dilakukan secara sistematis dan kontinyu dengan menggunakan siklus DMAIC (Define, Measure, Analyze, Improve and Control). Dengan menggunakan diagram Pareto diperoleh dua jenis cacat kritis yang menjadi permasalahan utama yaitu retak dan bintik melepuh. Selanjutnya alternatif-alternatif perbaikan pada proses diperoleh dengan FMEA. Berdasarkan nilai Risk Priority Number (RPN) yang tertinggi diambil 3 alternatif perbaikan dan selanjutnya dipilih satu alternatif terbaik dengan menggunakan metode AHP. Implementasi perbaikan dilakukan dengan menggunakan timer dan menugaskan operator khusus pada saat pembakaran untuk mengurangi cacat retak dan membersihkan kotoran bodi dengan menggunakan kompresor untuk mengurangi bintik melepuh. Setelah dilakukan evaluasi hasil implementasi alternatif perbaikan pada proses pembuatan keramik diperoleh kenaikan level sigma dari 2,8 menjadi 3 yang diikuti penurunan DPMO dari 104.167 menjadi 65.625. Sedangkan prosentase biaya akibat kualitas keramik yang jelek (COPQ) terhadap total penjualan mengalami penurunan dari 16,48% menjadi 9,93%.
SIMULASI KETERSEDIAAN BERAS DI JAWA TIMUR Annisa Kesy Garside; Hasyim Yusuf Asjari
Jurnal Ilmiah Teknik Industri Vol. 14, No. 1, Juni 2015
Publisher : Department of Industrial Engineering Universitas Muhammadiyah Surakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23917/jiti.v14i1.623

Abstract

East Java province is one of the rice granary and is an important national food buffer. In 2014, East Java targeted to contribute 60% of 10 million tons national surplus in P2NB program. Objective of this research is to predict rice availability in 2013 to 2020 and analyze East Java readiness on achieving the target. Research steps starts from cause-effect diagram, stock and flow diagram, math formulation inside the diagram, verification and validation of the model, and simulation of developed model. Result of dynamical system indicates availability of rice in 2014 is 3,944,377.7 tons. With such availability, East Java target to contribute 60% of 10 million national rice surplus in 2014 cannot be achieved.
Pengembangan Algoritma Hybrid Flowshop Three-Stage Dengan Mempertimbangkan Waktu Setup Dana Marsetiya Utama; Annisa Kesy Garside; Wahyu Wicaksono
Jurnal Ilmiah Teknik Industri Vol. 18, No. 1, Juni 2019
Publisher : Department of Industrial Engineering Universitas Muhammadiyah Surakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23917/jiti.v18i1.7683

Abstract

Hybrid flow shop scheduling is one topic that is often reviewed by researchers at this time. Hybrid flow shop scheduling is the development of problems from pure flow shop. Flow shop problems have one machine at each stage. In this problem, each stage of operation has a machine that is arranged in parallel. This article aims to discuss the issue of hybrid flow shop scheduling at three stage to minimize makespan. Some previous studies discussed scheduling problems by considering setup time. However, such research is generally for the problem of pure flow shop. Therefore, a new algorithm is proposed to solve the problem. The proposed algorithm is developed from the Pour heuristic algorithm. Several experiments were conducted to determine the performance of the proposed algorithm. This study uses ten numerical experiments. This experiment uses the number of jobs varying from 5 jobs to 50 jobs. The results of numerical experiments show that the proposed algorithm has better performance compared to some other algorithms. The proposed method produces an effective solution if it is used to solve problems with a large number of jobs..
Penyelesaian Vehicle Routing Problem with Simultaneous Pick Up and Delivery dengan Algoritma Tabu Search Annisa Kesy Garside; Dian Nur Cahyanti
Jurnal Ilmiah Teknik Industri Vol. 17, No. 2, Desember 2018
Publisher : Department of Industrial Engineering Universitas Muhammadiyah Surakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23917/jiti.v17i2.6703

Abstract

Vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a problem of vehicle routes where the delivery and pickup of products to each consumer is conducted simultaneously. Pangkalan Agisindo Alam Mandiri is engaged in the distribution of 3 kg LPG. At present,pangkalan already has a schedule of visits to retail stores, but the visit route is still subjectively set which causes long mileage and high transportation costs. The problem of determining the route at this pangkalanis calledVRPSPD because pangkalandelivered filled  LPG tubes to retail stores and at the same time picked up empty LPG tubes to be brought back. To determine the route, one must consider the vehicle capacity and the ratio of the number of LPG tubes delivered and picked up. This research used a tabu search algorithm to get the proposed route. The steps in the tabu search algorithm includes  determination of the initial solution, the neighborhood search, intensification phase, diversification phase,  standard phase, and  interactive phase. By using the tabu search algorithm, the proposed route provided a savings of transportation costs of 13.72% rather than the initial route of the company.
Penguatan Aspek Produksi dan Pemasaran pada Usaha Keripik Singkong Mix Sayur Annisa Kesy Garside; Teguh Baroto; Ode Rapija Gunarimba Waibo
JPPM (Jurnal Pengabdian dan Pemberdayaan Masyarakat) VOL. 4 NOMOR 1 MARET 2020 JPPM (Jurnal Pengabdian dan Pemberdayaan Masyarakat)
Publisher : Lembaga Publikasi Ilmiah dan Penerbitan (LPIP)

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (642.116 KB) | DOI: 10.30595/jppm.v0i0.4614

Abstract

Bunda Mandiri merupakan usaha kecil yang membuat keripik singkong mix sayur dengan merek “Singtoss”. Permasalahan dari aspek produksi adalah waktu pemipihan adonan keripik masih lama karena menggunakan mesin penggiling manual.  Selain itu, pemilik usaha berkeinginan untuk memasarkan produk  ke toko oleh-oleh yang tersebar banyak di wilayah Malang, namun terkendala dengan adanya  persyaratan toko yaitu  mewajibkan produk  memiliki PIRT dan sertifikat halal MUI. Oleh karena itu tujuan program kegiatan pengabdian masyarakat ini adalah melakukan inovasi proses untuk mempercepat waktu pemipihan adonan dan meningkatkan pemasaran produk dengan menciptakan keunggulan melalui produk halal. Kegiatan dilakukan melalui difusi teknologi proses produksi dan pengemasan produk serta advokasi dalam bentuk pendampingan pengajuan sertifikasi halal dan pengoperasian mesin. Hasil yang diperoleh dari kegiatan PKM adalah penggunaan mesin penggiling adonan keripik dalam proses produksi, desain kemasan yang baru dengan mencantumkan logo halal MUI, peningkatan pengetahuan pemilik usaha mengenai proses sertifikasi halal dan desain kemasan, serta peningkatan ketrampilan dalam mengoperasikan mesin penggiling. Keberhasilan kegiatan  ini dapat diukur dari peningkatan kuantitas produksi dari 6 kg/hari menjadi 14 kg/hari atau naik 150%. Selain itu omzet penjualan produk naik 1,5-2 kali lipat dibandingkan kondisi awal.
Perencanaan Distribusi LPG dengan Periodic Vehicle Routing Problem guna Minimasi Biaya Transportasi (Studi Kasus : PT.Gading Mas Indah Malang) Annisa Kesy Garside; Nyimas Mirnayanti Jayasari Sutadisastra
Performa: Media Ilmiah Teknik Industri Vol 9, No 1 (2010): PERFORMA Vol. 9, No. 1 Maret 2010
Publisher : Industrial Engineering Study Program, Faculty of Engineering, Universitas Sebelas Maret

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (363.337 KB) | DOI: 10.20961/performa.9.1.13882

Abstract

PT. Gading Mas Indah Malang represent one of LPG distributor which has a handling of inefficient distribution problem in delivery process to agent where less gives attention to demand, no definite scheduling and route make the high of distribution cost. Periodic Vehicle Routing Problem (PVRP) is a route planning from a depot to consumer among m-day period. In this research, PVRP used to optimize visit frequency and route of each agent to minimize distribution cost. The first step is clustering agents by k-means approach then determining delivery quantity, formulate mathematical model of PVRP, and solution searching using LINGO software to select the route which gives the minimum cost. From the result, optimum visit frequency is 1 visit and transportation cost saving is Rp 733,500,-/week equal to 40.82%.
Co-Authors Adhi Nugraha Ahmad Zamawi Ghozali Alfian Alif Amelia Khoidir Amelia Khoidir ANDRI SULAKSMI ANDRI SULAKSMI, ANDRI Anindia Karunia Pangesti Baiq Nurul Izzah Farida Ramadhani Baiq Nurul Izzah Farida Ramadhani Baya’sud, Faris Cahyanti, Dian Nur Dana Marsetiya Utama Dana Marsetya Utama Dian Nur Cahyanti Dian Palupi Restuputri Dovian Iswanda Ella Dewi Krisnanti Elya Rosiana Fenny Rubbayanti Dewi FITHRIANY HADZIQAH FITHRIANY HADZIQAH, FITHRIANY Fitra Risaldi Gigih Amayu Pragastio Hamim Rachman Hanny Kanavika Rizky Munawar Harto, Setyo Hasyim Yusuf Asjari Hasyim Yusuf Asjari, Hasyim Yusuf Heri Mujayin Kholik Ikhlasul Amallynda Laili, Nabila Rohmatul Leo Rizki Ardiansyah Marrica Ahmad Martina Juan Martina Juan, Martina Muhammad Alif Ihsan Muhammad Helmi Kurniawan Nabila Rohmatul Laili Nadia Mardhiyah Nasution, Riven Nyimas Mirnayanti Jayasari Sutadisastra Ode Rapija Gunarimba Waibo Pangesti, Anindia Karunia R. Hadi Wahyuono R. Hadi Wahyuono Rachman, Hamim Rahmad Wisnu Wardana Rahmad Wisnu Wardana Rara Putri Ayuning Tyas Riven Nasution Sabrina Legtria Wardani Satya Sudaningtyas Satya Sudaningtyas Setyo Harto Shanty Kusuma Dewi Shanty Kusuma Dewi Shanty Kusuma Dewi, Shanty Kusuma Teguh Baroto Thomy Eko Saputro Tiananda Widyarini Tiananda Widyarini Utama, Dana Marsetya Wa Ode Nadhilah Safitri Wahyu Wicaksono