cover
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kota surabaya,
Jawa timur
INDONESIA
Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri
ISSN : 14112485     EISSN : 20877439     DOI : -
Core Subject : Engineering,
Jurnal Teknik Industri aims to: Promote a comprehensive approach to the application of industrial engineering in industries as well as incorporating viewpoints of different disciplines in industrial engineering. Strengthen academic exchange with other institutions. Encourage scientist, practicing engineers, and others to conduct research and other similar activities.
Arjuna Subject : -
Articles 412 Documents
ALGORITMA PENENTUAN TITIK PENCEKAMAN HOLE-BASED MODULAR FIXTURE Josef Hernawan Nudu; Isa Setiasyah Toha
Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri Vol. 10 No. 2 (2008): DECEMBER 2008
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (226.542 KB) | DOI: 10.9744/jti.10.2.112-123

Abstract

This article illustrates fixturing algorithm for determining clamping point of hole-based modular fixture. The proposed algorithm is based on the algorithm developed by Ariastuti et al. The previous algorithm could be applied for determining clamping point of dedicated or slot-based modular fixture but it can not be applied directly for hole-based modular fixture. Conversion of locators’ coordinate and clamping coordinate into coincident baseplate-coordinates and an approach for modeling the magnitude and action point of equivalent forces are proposed. This algorithm is designed for fixturing prismatic workpart having machining feature(s) being processed on a vertical milling machine. The machining features are hole, blind hole, pocket, slot, blind slot, step, and blind step. Three hypothetical worksamples were analyzed using Ariastuti’s algorithm and this new algorithm. The result shows that both algorithms have the same properties in terms of feasible fixturing and unfeasible fixturing on a single setup.The new algorithm gives coordinates that coincide with holes of related baseplate in feasible fixturing. Forces equilibrium during machining is the only aspect being considered for feasibity analysis. Fixture elements’ dimension, strength, and deformation have not been considered yet. Abstract in Bahasa Indonesia: Makalah ini memaparkan algoritma fixturing untuk penentuan titik pencekaman fixture modular jenis hole yang dikembangan dari algoritma Ariastuti et al. Algoritma Ariastuti et al. dapat digunakan untuk menentukan titik pencekaman dedicated fixture dan modular fixture jenis slot, namun tidak dapat diterapkan secara langsung pada modular fixture jenis hole. Algoritma usulan menambahkan satu tahapan berupa penyesuaian koordinat lokator dan klem yang bersesuaian dengan posisi lubang pada plat dasar modular fixture jenis hole. Algoritma yang diusulkan berbeda dalam hal penentuan besar dan titik tangkap gaya potong ekivalen, serta penentuan titik pencekaman yang dipilih. Penelitian dibatasi pada fixturing benda kerja prismatik yang memiliki feature hole, blind hole, pocket, slot, blind slot, step, dan blind step untuk pemesinan pada mesin milling vertikal. Fisibilitas fixturing ditentukan oleh kondisi kesetimbangan gaya selama proses pemesinan. Aplikasi algoritma usulan pada tiga buah benda uji hipotetis memberikan hasil yang setara dengan algoritma Ariastuti et al.; berupa kondisi fixturing fisibel atau tidak fisibel. Hasil kondisi fixturing yang fisibel adalah titik lokator dan klem yang bersesuaian dengan posisi susunan lubang pada plat dasar fixture modular untuk pemesinan benda kerja dalam satu kali setup. Algoritma yang dikembangkan belum mempertimbangkan kendala dimensi dan kekuatan elemen fixture serta deformasi. Kata kunci: fixture modular, fixturing, titik pencekaman
KOMPARASI SISTEM MANUFAKTUR PUSH DAN PULL MELALUI PENDEKATAN SIMULASI Eric Wibisono
Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri Vol. 6 No. 1 (2004): JUNE 2004
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (79.142 KB) | DOI: 10.9744/jti.6.1.71-78

Abstract

Manufacturing systems that are often classified as push and pull often invite question: "How far do the differences between those two systems exist?" Many researches have been carried out but succinct answer to the above question is always difficult to reach. The difficulty roots from the variety of definition of the push and pull systems itself and also from the variety of complexity of a manufacturing system. This paper attempts to study the differences in performance between push and pull systems in a relatively simple model that consists of 4 serial processors with buffers located between these processors. Variations being modelled is on the setting of the system's load (high and low) and the buffer size with performance being measured include machine utilization, number of outputs and mean flow time of jobs. The approach used is simulation using ProModel software as the tool. From the experiments it can be derived that buffer size turns out to be a very critical factor in system performance. Moreover, it is also proved that when the buffer size is large, push and pull systems do not differ significantly. Abstract in Bahasa Indonesia : Sistem manufaktur yang umumnya dikategorikan menjadi sistem push dan pull sering mengundang pertanyaan: "Seberapa jauh perbedaan dari kedua sistem tersebut ada?" Banyak penelitian telah dilakukan namun jawaban yang lugas atas pertanyaan tersebut sulit diperoleh. Kesulitan ini umumnya berakar dari beragamnya definisi sistem push dan pull itu sendiri serta variasi dari kompleksitas suatu sistem manufaktur. Makalah ini mencoba melihat perbedaan antara kinerja sistem push dan pull dalam suatu model sederhana yang terdiri dari 4 prosesor serial dengan buffer yang diletakkan di antara masing-masing prosesor tersebut. Variasi yang dilakukan adalah pada setting beban kerja sistem (padat dan ringan) dan ukuran buffer dengan kinerja yang diukur adalah utilisasi mesin, jumlah output dan rata-rata waktu tinggal job. Pendekatan yang dipakai adalah simulasi dengan alat bantu software ProModel. Dari eksperimen yang dilakukan didapatkan hasil bahwa ukuran buffer sangat berpengaruh terhadap kinerja sistem. Secara khusus juga dibuktikan bahwa pada ukuran buffer besar, ternyata antara sistem push dan pull tidak memiliki perbedaan yang signifikan. Kata kunci: sistem push-pull, simulasi, buffer.
PENENTUAN RUTE TRUK PENGUMPULAN DAN PENGANGKUTAN SAMPAH DI BANDUNG Lisye Fitria; Susy Susanty; Suprayogi Suprayogi
Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri Vol. 11 No. 1 (2009): JUNE 2009
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (92.146 KB) | DOI: 10.9744/jti.11.1.51-60

Abstract

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
Impact of an Ageing Society on Healthcare Expenditure of National Health Insurance in Taiwan Karina Agustin; Shou-Yan Chou
Jurnal Teknik Industri Vol. 21 No. 2 (2019): December 2019
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (473.659 KB) | DOI: 10.9744/jti.21.2.49-56

Abstract

The increase in healthcare expenditure always becomes an issue considered by the National Health Insurance (NHI) program in Taiwan. Accordingly, analyzing the root cause is a significant first step in dealing with this issue. This study hypothesized that the greying population in Taiwan is the main reason that devours a vast health care expenditure. Samples of the population in Taiwan's National Health Insurance databases together with age-expenditure profile analysis and decomposing approach of the components of healthcare expenditure will analyze the impact of population ageing and estimate the contributions of population ageing shifting to NHI's expenditure in Taiwan.  The result could be considered for policymakers and the government to overcome this issue in Taiwan.
PERANCANGAN DAN IMPLEMENTASI SISTEM PENGUKURAN KINERJA DENGAN METODE INTEGRATED PERFORMANCE MEASUREMENT SYSTEMS (Studi Kasus: Jurusan Teknik Mesin Universitas Mataram) Bambang Syairuddin; Patdono Suwignjo; I Made Suartika
Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri Vol. 9 No. 2 (2007): DECEMBER 2007
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (231.89 KB) | DOI: 10.9744/jti.9.2.131-143

Abstract

To assure the quality of education in the Department of Mechanical Engineering, we need to design an integrated performance measurement system. For that purpose, we used the IPMS (Integrated Performance Measurement Systems) method. Using the IPMS method, Key Performance Indicators (KPIs) of the Department of Mechanical Engineering were determined by pursuant to stakeholder requirement through four steps. Those are identifying the stakeholder requirement, external monitor, stipulating objectives, and identification of KPIs. Performance measurement system with the IPMS method in the Department of Mechanical Engineering of Mataram University can be identified into 38 KPIs grouped in 9 criterias of performance of the Department of Mechanical Engineering, that are curriculum, student, financial, human resources, administration academic, teaching and learning, alumnus, evaluation and operation, and external party. Abstract in Bahasa Indonesia : Untuk menjamin kualitas pendidikan di Jurusan Teknik Mesin, diperlukan sebuah rancangan sistem pengukuran kinerja (SPK) yang terintegrasi dengan metode IPMS (Integrated Performance Measurement Systems). Dengan metode IPMS, Key Performance Indicators (KPI) Jurusan Teknik Mesin ditentukan berdasarkan stakeholder requirement melalui empat tahapan yaitu; identifikasi stakeholder requirement, external monitor, penetapan objectives, dan identifikasi KPIs. Hasil perancangan SPK di Jurusan Teknik Mesin Universitas Mataram, dapat mengidentifikasi 38 KPIs yang dikelompokkan dalam 9 kriteria kinerja Jurusan Teknik Mesin, yaitu; kurikulum, mahasiswa, finansial, SDM, administrasi akademik, proses pembelajaran, alumni, evaluasi dan pengendalian, dan external party. Kata Kunci : Sistem Pengukuran Kinerja, IPMS, Teknik Mesin Unram.
PERANCANGAN PENJUALAN DAN PERENCANAAN PRODUKSI YANG TERINTEGRASI DENGAN MENERAPKAN TEKNOLOGI ENTERPRISE RESOURCES PLANNING (Studi Kasus Pada Perusahaan Furniture Consumer Good dan Elektronik) Zeplin Jiwa Husada Tarigan
Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri Vol. 7 No. 2 (2005): DECEMBER 2005
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (172.45 KB) | DOI: 10.9744/jti.7.2.138-144

Abstract

Most of enterprises got failed at the first step in implemented ERP. Based on cases study in furniture, consumer goods, and electronic company that already implemented the ERP; the failure happened when they tried to integrate the selling and production planning system and need relatively a long time for implementation. Based on experiences in the field, the successfully of the implementation, really depends on continuous improvement to match between ERP's system and real enterprises demand. Abstract in Bahasa Indonesia : Banyak perusahaan mengalami kegagalan pada saat awal mengimplementasikan enterprise resources planning (ERP). Berdasarkan studi kasus pada perusahaan furniture, consumer good dan elektronik yang telah mengimplementasikan ERP, kesulitan yang ditemui adalah dalam mengintegrasikan sistem penjualan dan perencanaan produksi, serta waktu implementasi yang relatif lama. Dari pengalaman di lapangan, keberhasilan implementasi ditentukan oleh perbaikan berkelanjutan untuk menyesuaikan antara sistem ERP dan kebutuhan rill perusahaan. Kata kunci: ERP, integrasi penjualan dan perencanaan produksi, furniture, consumer good, elektronik.
Performansi Algoritma CODEQ dalam Penyelesaian Vehicle Routing Problem Annisa Kesy Garside; Satya Sudaningtyas
Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri Vol. 16 No. 1 (2014): JUNE 2014
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (359.711 KB) | DOI: 10.9744/jti.16.1.53-58

Abstract

Genetic Algorithm, Tabu Search, Simulated Annealing, and Ant Colony Optimization showed a good performance in solving vehicle routing problem. However, the generated solution of those algorithms was changeable regarding on the input parameter of each algorithm. CODEQ is a new, parameter free meta-heuristic algorithm that had been successfully used to solve constrained optimization problems, integer programming, and feed-forward neural network. The purpose of this research are improving CODEQ algorithm to solve vehicle routing problem and testing the performance of the improved algorithm. CODEQ algorithm is started with population initiation as initial solution, generated of mutant vector for each parent in every iteration, replacement of parent by mutant when fitness function value of mutant is better than parent’s, generated of new vector for each iteration based on opposition value or chaos principle, replacement of worst solution by new vector when fitness function value of new vector is better, iteration ceasing when stooping criterion is achieved, and sub-tour determination based on vehicle capacity constraint. The result showed that the average deviation of the best-known and the best-test value is 6.35%. Therefore, CODEQ algorithm is good in solving vehicle routing problem.
PENJADUALAN FLOWSHOP DENGAN ALGORITMA GENETIKA Tessa Vanina Soetanto; Danny Prabowo Soetanto
Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri Vol. 1 No. 1 (1999): JUNE 1999
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (62.826 KB) | DOI: 10.9744/jti.1.1.1-11

Abstract

This paper explains and gives an application of genetic algorithm for flowshop scheduling at "X" company to reach minimum multiple objectives of makespan, total flowtime and machine idletime. Comparison to HC heuristic algorithm (Ho and Chang, 1991) is done to show the differences of genetic algorithm. Abstract in Bahasa Indonesia : Makalah ini menyajikan penjelasan dan contoh aplikasi dari algoritma genetika untuk penyelesaian masalah penjadualan flowshop di PT "X" dengan tujuan meminimumkan makespan, total flowtime, dan machine idletime secara bersama-sama. Selain itu untuk mengetahui keunggulan dari algoritma genetika juga dilakukan perbandingan terhadap algoritma heuristic HC (Ho and Chang, 1991). Kata kunci: flowshop, multiple objectives, algoritma genetika
PEMAKAIAN ALGORITMA GENETIK UNTUK PENJADWALAN JOB SHOP DINAMIS NON DETERMINISTIK Nico Saputro; Yento Yento
Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri Vol. 6 No. 1 (2004): JUNE 2004
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (119.983 KB) | DOI: 10.9744/jti.6.1.61-70

Abstract

Dynamic Job shops non deterministic scheduling problem is concerned with ordering some operations that processed by certain machines with variable and unknown arrival time of jobs. When new jobs arrive, it requires modifications in the existing schedule. We use Genetic Algorithm approach to the dynamic job shop non deterministic scheduling and rescheduling problem. Abstract in Bahasa Indonesia : Penjadwalan job shop dinamis non deterministik merupakan persoalan pengurutan sejumlah operasi yang diproses pada mesin-mesin tertentu dengan urutan pengerjaan berbeda untuk setiap job yang berbeda, dimana kedatangan job tersebut bervariasi dan tidak diketahui sebelumnya. Penjadwalan ulang diperlukan bila telah disusun suatu jadwal dan kemudian tiba suatu pekerjaan baru. Algoritma genetik dapat dipergunakan untuk menyusun jadwal maupun untuk menyisipkan jadwal saat ada penambahan pekerjaan tanpa mengubah jadwal yang telah dikerjakan sebelumnya. Kata kunci: algoritma genetik, penjadwalan dan penjadwalan ulang job shop dinamis non deterministik.
Throughput Analysis on a Multi-state Manufacturing System by Considering Availability Nabila Yuraisyah Salsabila; Nurhadi Siswanto; Erwin Widodo; Oryza Akbar Rochmadhan
Jurnal Teknik Industri Vol. 21 No. 2 (2019): December 2019
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (298.302 KB) | DOI: 10.9744/jti.21.2.69-78

Abstract

Manufacturing technology becomes more complex as customer demand increases. Most manufacturing companies consist of multi-state manufacturing networks. Therefore, the reliability and availability parameters become an important issue to satisfy customer demand. Unavailability can result in reducing throughput because of decreasing operational production time. To resolve this problem, the buffer inventory can minimize the occurrence of material starving and production blocking during the equipment downtime. This paper will focus on experimenting with buffer inventory levels and the capacity of a multi-state manufacturing network to increase the production throughput on a company that has 70,000 tons per year of capacity. However, due to the unavailability problem, the existing system capacity decreases to 62,175 tons per year. The simulation model is used to improve throughput by modeling the failure interruption and the buffer inventory logics during the production process.

Filter by Year

1999 2026


Filter By Issues
All Issue Vol. 28 No. 1 (2026): June 2026 Vol. 27 No. 2 (2025): December 2025 Vol. 27 No. 1 (2025): June 2025 Vol. 26 No. 2 (2024): December 2024 Vol. 26 No. 1 (2024): June 2024 Vol. 25 No. 2 (2023): December 2023 Vol. 25 No. 1 (2023): June 2023 Vol. 24 No. 2 (2022): Dec 2022 Vol. 24 No. 1 (2022): June 2022 Vol. 23 No. 2 (2021): Dec 2021 Vol. 23 No. 1 (2021): June 2021 Vol. 22 No. 2 (2020): December 2020 Vol. 22 No. 1 (2020): June 2020 Vol. 21 No. 2 (2019): December 2019 Vol. 21 No. 1 (2019): June 2019 Vol. 20 No. 2 (2018): December 2018 Vol. 20 No. 1 (2018): June 2018 Vol. 19 No. 2 (2017): Desember 2017 Vol. 19 No. 1 (2017): JUNE 2017 Vol. 18 No. 2 (2016): DECEMBER 2016 Vol. 18 No. 1 (2016): JUNE 2016 Vol. 17 No. 2 (2015): DECEMBER 2015 Vol. 17 No. 1 (2015): JUNE 2015 Vol. 16 No. 2 (2014): DECEMBER 2014 Vol. 16 No. 1 (2014): JUNE 2014 Vol. 15 No. 2 (2013): DECEMBER 2013 Vol. 15 No. 1 (2013): JUNE 2013 Vol. 14 No. 2 (2012): DECEMBER 2012 Vol. 14 No. 1 (2012): JUNE 2012 Vol. 13 No. 2 (2011): DECEMBER 2011 Vol. 13 No. 1 (2011): JUNE 2011 Vol. 12 No. 2 (2010): DECEMBER 2010 Vol. 12 No. 1 (2010): JUNE 2010 Vol. 11 No. 2 (2009): DECEMBER 2009 Vol. 11 No. 1 (2009): JUNE 2009 Vol. 10 No. 2 (2008): DECEMBER 2008 Vol. 10 No. 1 (2008): JUNE 2008 Vol. 9 No. 2 (2007): DECEMBER 2007 Vol. 9 No. 1 (2007): JUNE 2007 Vol. 8 No. 2 (2006): DECEMBER 2006 Vol. 8 No. 1 (2006): JUNE 2006 Vol. 7 No. 2 (2005): DECEMBER 2005 Vol. 7 No. 1 (2005): JUNE 2005 Vol. 6 No. 2 (2004): DECEMBER 2004 Vol. 6 No. 1 (2004): JUNE 2004 Vol. 5 No. 2 (2003): DECEMBER 2003 Vol. 5 No. 1 (2003): JUNE 2003 Vol. 4 No. 2 (2002): DECEMBER 2002 Vol. 4 No. 1 (2002): JUNE 2002 Vol. 3 No. 2 (2001): DESEMBER 2001 Vol. 3 No. 1 (2001): JUNE 2001 Vol. 2 No. 2 (2000): DESEMBER 2000 Vol. 2 No. 1 (2000): JUNE 2000 Vol. 1 No. 1 (1999): JUNE 1999 More Issue