Article Per Year (5 Year)
p-Index From 2019 - 2024
4.495
P-Index
This Author published in this journals
All Journal JURNAL PASTI (PENELITIAN DAN APLIKASI SISTEM DAN TEKNIK INDUSTRI) Journal Industrial Servicess Jurnal Teknologi Proses dan Inovasi Industri Jurnal Teknologi Proses dan Inovasi Industri Jurnal Sistem dan Manajemen Industri Jurnal Teknik Industri JURNAL MANAJEMEN INDUSTRI DAN LOGISTIK INTECOMS: Journal of Information Technology and Computer Science Jurnal Serambi Engineering STRING (Satuan Tulisan Riset dan Inovasi Teknologi) Journal of Integrated System SIGMA TEKNIKA Jurnal Media Teknik dan Sistem Industri Jurnal Teknik Industri Terintegrasi (JUTIN) jurnal syntax admiration JURMATIS : Jurnal Manajemen Teknologi dan Teknik Industri Jurnal Ilmiah Wahana Pendidikan Go-Integratif : Jurnal Teknik Sistem dan Industri
Winarno Winarno
Program Studi Teknik Industri, Fakultas Teknik, Universitas Singaperbangsa Karawang
Religion Aerospace Engineering Automotive Engineering Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering 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 Materials Science & Nanotechnology Mathematics Mechanical Engineering Social Sciences Transportation Other

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

Found 2 Documents
Search
Journal : Journal Industrial Servicess

 1 
Analisa Optimalisasi Keuntungan dengan Integer Linear Programming dan Metode Branch and Bound pada Toko Bunga QuinnaStory Ayunda Zuserain; Winarno Winarno; Billy Nugraha; Ade Momon
Journal Industrial Servicess Vol 6, No 2 (2021): Maret 2021
Publisher : Fakultas Teknik Jurusan Teknik Industri Universitas Sultan Ageng Tirtayasa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36055/62003

Abstract

QuinnaStory Flower Shop produces flower buckets with 2 types of sizes, namely small flower buckets and large flower buckets. With current problems in the form of limited resources, lack of automatic cutting machines, manpower and optimization of production planning. This study aims to determine how to solve the search for maximum profit from production. The optimal solution based on the problem at QuinnaStory Flower Shop can be solved by integer linear programming approach. The method used in this research is the simplex method to look for maximum benefits. The results obtained required the production of 36 small flower buckets and 31.5 large flower buckets to obtain a maximum profit of Rp. 2,790,000, - However, the results of product production / day are still in decimal form. Therefore, it is continued with the branch and bound method to find non-decimal results. The result of the settlement is required to produce 36 small flower buckets and 31 large flower buckets / day to get a maximum profit of IDR 2,764,000.
Penentuan rute terpendek dalam pengiriman pallet kayu menggunakan programa dinamis Shania Viera Agnezia; Winarno Winarno
Journal Industrial Servicess Vol 7, No 2 (2022): April 2022
Publisher : Fakultas Teknik Jurusan Teknik Industri Universitas Sultan Ageng Tirtayasa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36055/jiss.v7i2.13911

Abstract

Rute perjalanan adalah faktor utama yang dapat menentukan alur pendistribusian barang. Penelitian ini membahas penentuan rute terpendek pendistribusian pallet kayu dari CV. Bintang Jaya (Bogor) menuju ke PT. Yanmar Diesel Indonesia (Depok) untuk mendapatkan rute terpendek dan biaya ongkos yang murah. Tujuan penelitian ini membuat model perjalanan yang lebih pendek dengan membandingkan beberapa rute perjalanan yang ada, sehingga akan didapatkan rute perjalanan terpendek dari pilihan rute yang sering dilalui. Penyelesaian masalah pada penelitian ini menggunakan algoritma program dinamis dengan pendekatan forward recursive equation, dimana hanya menggunakan 1 kali perhitungan perjalanan tanpa arah sebaliknya dan perbandingan menggunakan software WinQSB. Hasil penelitian ini menghasilkan rute terpendek sebesar 33,4 Km dengan rute yaitu CV. Bintang Jaya–Sukamaju–Sukamanah–Cipeucang–Gandoang–Mekarsari–Cileungsi Kidul–Cileungsi–Nagrak–Cikeas Udik–Leuwinanggung–Jl. Raya Tapos 40-46–Sukatani–Sukamaju Baru–PT. Yanmar Diesel Indonesia. Dari jarak yang diperoleh terdapat pengurangan ongkos perjalanan menjadi Rp 40.000 – Rp 60.000 untuk sekali perjalanan. Model algoritma program dinamis dapat menyelesaikan permasalahan pemilihan rute dan penghematan ongkos pengiriman.
Co-Authors A. A. N. Perwira Redi (Universitas Pertamina) Aditya Fajar Nugraha Adji Chandra Kurniawan Agustian Suseno Anak Agung Ngurah Agung Redioka Anak Agung Ngurah Perwira Redi Andika Dwi Nugraha Aulia Fashanah Hadining Ayunda Zuserain Bagus Sajiwo Billy Nugraha Billy Nugraha Fahriza Nurul Azizah Farid Ramdhan Nugraha Fauzan Wijdan Hilmi Edison Felix Yohannes Panjaitan Fitriana Fitriana Jauhari Arifin Liana Liana Lyoni Elisabet Marpaung Maulana Alfin Faiz Muhaimin Albar Mukhammad Azhari Isfirory Nourma Lista Revanda Nugraha, Asep Erik Nur Aldien Ramadhania Rafael Falmarum Revikhasa Hilal Kunuzi Ridwan Riyadi Rizki Achmad Darajatun Roland Ross Faina Flame Shania Viera Agnezia Sintia Basliana Theodora Edita Sari Theodora Edita Sari Wahyudin Wahyudin Wilson Parulian Simatupang Zahra Nursyahbani Zidane Khulud Kautsar