Article Per Year (5 Year)
p-Index From 2019 - 2024
1.704
P-Index
This Author published in this journals
All Journal JURNAL SISTEM INFORMASI BISNIS TEKNOLOGI: Jurnal Ilmiah Sistem Informasi Applied Information System and Management Generation Journal ABIDUMASY : Jurnal Pengabdian kepada Masyarakat
Mashuri, Chamdan
Unknown Affiliation
Religion Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Electrical & Electronics Engineering Energy Engineering Environmental Science Industrial & Manufacturing Engineering Languange, Linguistic, Communication & Media Law, Crime, Criminology & Criminal Justice Mathematics Social Sciences Other

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

Found 2 Documents
Search
Journal : JURNAL SISTEM INFORMASI BISNIS

 1 
Sistem Optimasi Penjadwalan Mesin Produksi Menggunakan Metode GUPTA Berbasis Android Mashuri, Chamdan; Mujianto, Ahmad Heru; Sucipto, Hadi; Arsam, Rinaldo Yudianto
JSINBIS (Jurnal Sistem Informasi Bisnis) Vol 10, No 1 (2020): Volume 10 Nomor 1 Tahun 2020
Publisher : Universitas Diponegoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (537.801 KB) | DOI: 10.21456/vol10iss1pp20-27

Abstract

Research has been carried out by developing an optimization information system for scheduling production machines by applying the Android-based GUPTA method. This android-based application is able to optimize production time, because in the android application it implements the GUPTA algorithm which uses the calculation of the comparative processing time on every machine in the company by prioritizing the smallest processing time for scheduling which aims to optimize production scheduling time, by paying attention to the value of makespan to produce product size 12 griddle, size 14 griddle, 16 size griddle, 18 size griddle and 20 size griddle so that an optimal makespan value is obtained. The GUPTA method can be used in problems with more than two machines, because this method combines the time of each process on the first and subsequent machines to find the minimum value and can only be used in pure flow shop scheduling. The advantage of this method is that it determines scheduling only on one machine group. This research resulted in an Android-based application that can schedule products to be produced by machines automatically. From the results of testing with a total of 12 pieces of production in each product with a total of 5 different sizes, the minimum value of makespan is obtained, namely 2054569 minutes with the sequence of product processing with work order 12 griddle, griddle 18, griddle 20, griddle 16, and griddle 14 The accuracy of the application test results shows 98.87% for the first time and 98.84% for the second time when compared with manual calculations.
Penerapan Algoritma Campbell Dudek Smith (CDS) untuk Optimasi Waktu Produksi Pada Penjadwalan Produksi Mashuri, Chamdan; Mujianto, Ahmad Heru; Sucipto, Hadi; Arsam, Rinaldo Yudianto
JSINBIS (Jurnal Sistem Informasi Bisnis) Vol 10, No 2 (2020): Volume 10 Nomor 2 Tahun 2020
Publisher : Universitas Diponegoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21456/vol10iss2pp131-136

Abstract

Research on optimizing production time using the dudek smith campbell algorithm (CDS) in scheduling the production process aims to makepan optimization for machine operations to produce 12 size griddle products, 14 griddle sizes, 16 griddle sizes, 18 griddle sizes and 20 griddle sizes to get the makepan values. optimal. The method applied by the Campbell Dudek and Smith (CDS) algorithm, CDS is a method used in flowshop scheduling developed from Johnson's rule which is able to minimize the makespan of 2 machines arranged in series. The CDS method is very suitable for production characters who apply machine sequences to the production process. CDS produces several iterations that have the value of makespan, from those iterations, the minimum value of makespan is to determine the order of products to be produced. This research resulted in an application that can schedule products to be produced by machines automatically. From the test results with a total production of 12 pieces on each product with 6 repetitions, the minimum value of makespan is 210.12 minutes with a sequence of product works 20 pans, 18 pans, 16 pans, 14 pans, and 12 pans. Accuracy of results Application testing shows 99.99% for the first time and 99.96% for the second time when compared to manual calculations
Co-Authors Ahmad Heru Mujianto Ahmad Heru Mujianto Ahmad Heru Mujianto Arsam, Rinaldo Yudianto Fajar Rohman Hariri Fajar Rohman Hariri, Fajar Rohman Ginanjar Setyo Permadi Hadi Sucipto Hadi Sucipto Hadi Sucipto, Hadi Mahfudiyanto Mahrus Ali Mujianto, Ahmad Heru Radityo Wiratsongko Rocky Ardiansyah Yudistira Putra Sari, Waskita Tanhella Zein Vitadiar Unzilla Savika Putri