Claim Missing Document
Check
Articles

Found 5 Documents
Search

Perancangan Model Stacker Crane Flexible Manufacturing System untuk Pembelajaran di Institusi Pendidikan Ari Setiawan
Jurnal Rekayasa Sistem Industri Vol. 10 No. 1 (2021): Jurnal Rekayasa Sistem Industri
Publisher : Universitas Katolik Parahyangan

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (561.944 KB) | DOI: 10.26593/jrsi.v10i1.4258.45-54

Abstract

Flexible Manufacturing System (FMS) is one of the modern production systems that support the implementation of Industry 4.0. An educational institution plans to build an FMS model for learning the modern production systems. The FMS is a manufacturing system consisting of a set of automatic workstations connected to a material handling system where all activities are controlled by a computer system. The material handling system consists of a material storage system and a transportation system, one example of a transportation system is the stacker crane. In this research, the stacker crane model has been built which consists of three main components, which are the bottom frame, the mast, and the carriage. This component is equipped with stepper motors, leadscrews that are controlled by the micro controller and an application on Android. The stacker crane model is tested to retrieve and deliver the stereofoam material model to the destination which is controlled by the user using an application on Android. The characteristics of the stacker crane model can move the workpiece with a maximum error of 2 mm in the positive x-axis direction, 2 mm in the negative x-axis movement, up to 2 mm positive y-axis, downward at negative y-axis direction 2 mm.  
Perancangan Maintenance Management Informastion System untuk Unit Pemadam Kebakaran (Studi Kasus : PERUSAHAAN X) Arief Samuel Gunawan; Ari Setiawan; Febryci Legirian
Jurnal Nasional Teknologi dan Sistem Informasi Vol 3, No 2 (2017): Agustus 2017
Publisher : Jurusan Sistem Informasi, Fakultas Teknologi Informasi, Universitas Andalas

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/TEKNOSI.v3i2.2017.219-224

Abstract

Unit Pemadam Kebakaran Perusahaan X merupakan unit kerja yang bertugas melakukan pencegahan dan penanggulangan kebakaran di Perusahaan X. Unit ini dilengkapi dengan peralatan dan perlengkapan kerja, salah satunya yaitu mobil pemadam kebakaran. Salah satu permasalahan yang dihadapi oleh unit ini adalah mobil pemadam kebakaran sering mengalami kerusakan pada saat digunakan. Hal ini disebabkan karena umur komponen yang akan habis dan belum dilakukan penggantian. Umumnya bagian pemeliharaan belum memiliki dokumentasi umur komponen dari setiap mobil pemadam kebakaran. Sehingga petugas pemadam kebakaran tidak dapat mengantisipasi kerusakan yang akan terjadi saat mobil pemadam kebakaran digunakan. Untuk menanggulangi permasalahan tersebut, dikembangkan Maintenance Management Information System (MMIS) yang dapat memberikan informasi perkiraan umur komponen mobil. Metode Reliability Centered Maintenance (RCM) digunakan pada MMIS untuk menentukan Mean Time To Failure (MTTF). Metode Total Productive Maintenance (TPM) juga digunakan pada MMIS untuk merencanakan jadwal pemeliharaan sehingga dapat meminimalisir kerusakan saat mobil digunakan. Untuk mendukung MMIS, diterapkan menu untuk konfigurasi yaitu, data pegawai, inventaris mobil pemadam kebakaran serta inventori suku cadang dan pengadaan barang yang akan berhubungan dengan biaya pemeliharaan.
The Fleet and Berth Selection Model to Improve Energy and Environment Sustainability Ari Setiawan; Eka Kurnia Asih Pakpahan; Hadi Susanto
International Journal of Innovation in Enterprise System Vol 7 No 02 (2023): International Journal of Innovation in Enterprise System
Publisher : School of Industrial and System Engineering, Telkom University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25124/ijies.v7i02.219

Abstract

This research aims to improve energy sustainability in transportation management. The case was derived from port-to-port coal transportation problem commonly faced by third-party logistic (3PL) company. During planning, they must determine which shipsets to be used and assign them to the loading/unloading berths. Each berth varies in terms of its loading/unloading speed and each shipset varies in terms of its capacity, sail speed, and fuel consumption rate. The selection of shipset impacts the auxiliary and main engine fuel consumption while the selection of berth impacts only the auxiliary engine fuel consumption. The target is to minimize the total fuel consumed by both engines for the whole shipset. We modelled the case through Multiple Vehicle Allocation Problem (MVAP) framework and proposed a heuristic algorithm to find the solutions. The heuristic algorithm is proven to be able to reach an optimal solution for small cases and near-optimal for medium to large cases.
Kinerja Algoritma Branch-and-Bound, Campbell-Dudek-Smith dan Nawazenscore-Ham dalam Meminimasi Makespan pada Penjadwalan Flow Shop Eka K.A Pakpahan; Florence Suwandi; Ari Setiawan
Journal of Comprehensive Science Vol. 5 No. 7 (2026): Journal of Comprehensive Science
Publisher : Green Publisher Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.59188/jcs.v5i7.4234

Abstract

Sektor manufaktur membutuhkan sistem produksi yang efisien agar proses pemenuhan permintaan pelanggan dapat berlangsung tepat waktu dengan penggunaan sumber daya yang optimal. Salah satu aspek penting dalam sistem produksi adalah penjadwalan, terutama pada lingkungan flow shop yang memiliki urutan proses sama untuk setiap pekerjaan. Penelitian ini bertujuan untuk mengevaluasi kinerja algoritma Branch-and-Bound (BB), Campbell-Dudek-Smith (CDS), dan Nawaz-Enscore-Ham (NEH) dalam meminimasi makespan pada penjadwalan flow shop. Metode penelitian dilakukan melalui perancangan dua belas skenario kasus berdasarkan variasi jumlah pekerjaan dan jumlah mesin/proses, yaitu skala kecil, sedang, dan besar. Setiap skenario diuji menggunakan algoritma BB, CDS, NEH-LPT, dan NEH-SPT, kemudian hasilnya dibandingkan berdasarkan nilai makespan dan efisiensi pencarian solusi. Hasil pembahasan menunjukkan bahwa algoritma BB memberikan hasil yang baik pada kasus kecil, tetapi kurang efisien pada kasus besar karena waktu pencarian solusi lebih lama. Pada kasus sedang, CDS dan NEH-LPT menunjukkan kinerja yang kompetitif, sedangkan pada kasus besar NEH-SPT lebih konsisten menghasilkan makespan terbaik dibandingkan metode lainnya. Kesimpulannya, pemilihan algoritma penjadwalan perlu disesuaikan dengan skala sistem produksi. Penelitian ini merekomendasikan NEH-SPT untuk sistem produksi berskala besar karena lebih efisien dan mampu menghasilkan jadwal dengan makespan minimum.
Penataan Muatan Truk Untuk Memenuhi Regulasi Muatan Sumbu Terberat dan Mencapai Efisiensi Pengiriman menggunakan Metode Genetik Algorithm Ari Setiawan; Eka Kurnia Asih Pakpahan; Yosinta Haryanda
Jurnal Rekayasa Sistem Industri Vol. 15 No. 2 (2026): Jurnal Rekayasa Sistem Industri
Publisher : Universitas Katolik Parahyangan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26593/jrsi.10267

Abstract

Purpose: This study aims to optimize truck cargo arrangements by considering maximum axle load regulations and delivery sequence requirements to improve loading and unloading efficiency. Methodology: This study employs an optimization approach with a multi-objective function that minimizes deviations from the prescribed axle load limits and the required cargo delivery sequence based on the Last In, First Out (LIFO) principle. The optimization model is solved using a genetic algorithm implemented in MATLAB. Algorithm performance is evaluated by testing different population sizes, crossover probabilities, and mutation probabilities to identify the parameter combination that yields the fastest solution search time. Results: The proposed program generates cargo arrangements that satisfy axle load regulations and delivery sequence requirements, achieving a load distribution fitness value of 1 and a delivery sequence fitness of 100%. Parameter testing identifies a population size of 40, a crossover probability of 0.7, and a mutation probability of 0.1 as the combination that produces the fastest solution search time among the tested configurations. Conclusion: The proposed approach enables truck cargo arrangements to account for axle load compliance and delivery sequence requirements simultaneously, supporting safer transportation and more efficient distribution operations. Originality: This study integrates regulatory axle load constraints and delivery sequence considerations into a single genetic algorithm-based cargo arrangement optimization model, providing a decision-making approach that addresses transportation safety and distribution efficiency concurrently.