cover
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kota surabaya,
Jawa timur
INDONESIA
Jurnal 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 9 Documents
Search results for , issue "Vol. 6 No. 1 (2004): JUNE 2004" : 9 Documents clear
KOMPARASI SISTEM MANUFAKTUR PUSH DAN PULL MELALUI PENDEKATAN SIMULASI Eric Wibisono
Jurnal 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.pp. 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.
PERUMUSAN STRATEGI KEMITRAAN MENGGUNAKAN METODE AHP DAN SWOT (Studi Kasus pada Kemitraan PT. INKA dengan Industri Kecil Menengah di Wilayah Karesidenan Madiun) Eko Nurmianto; Arman Hakim Nasution; Syafril Syafar
Jurnal 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 (57.535 KB) | DOI: 10.9744/jti.6.1.pp. 47-60

Abstract

Research on Partnership strategy between PT. INKA and SMI (Small Medium Industry) conducted using Analytical Hierarchy Process (AHP) and SWOT Analysis. Problem statement: (1) Type of criteria required to build Partnership Strategy (2) How to formulate Partnership Strategy between them. Results: (1) Performance of partnership model as follows : effectivity, profesionalism, supervisory, controlship, financial, development potency, and birocration procedure. (2) Weighted criteria effectivity 0.354, profesionalism 0.24, birocration procedure 0.159, supervisory 0.104, controlship 0.068, development potency 0.045, and financial 0.031. Model 2 (proposed) is a partnership model on partnership development between PT. INKA and SMI with the management of Financial Management Council (Badan Pengelola Dana BUMN). Abstract in Bahasa Indonesia : Perumusan strategi kemitraan PT. INKA dan Industri Kecil Menengah diteliti menggunakan AHP dan SWOT. Permasalahan adalah kriteria-kriteria yang dibutuhkan dalam menyusun dan merumuskan strategi kemitraan antara PT. INKA dan industri kecil binaan. Hasil penelitian (1) Penilaian kinerja dari model kemitraan terdapat beberapa kriteria yang digunakan yaitu: efektivitas, profesionalitas, pembinaan, pengawasan, modal, potensi pengembangan, dan prosedur birokrasi. (2) Bobot kriteria: efektivitas 0.354, profesionalitas 0.24, prosedur birokrasi 0.159, pembinaan 0.104, pengawasan 0.068, potensi pengembangan 0.045, dan modal 0.031. Model 2 (usulan) adalah model kemitraan yang memfokuskan pengembangan kemitraan antara PT. INKA dan IKM dengan pengelolaan yang lebih profesional dengan adanya Badan Pengelola Dana BUMN yang bersifat mandiri. Kata kunci: Perumusan strategi, AHP, SWOT, Model kemitraan BUMN-IKM.
SOLVING THE DEGREE CONSTRAINED MINIMUM SPANNING TREE PROBLEM USING TABU AND MODIFIED PENALTY SEARCH METHODS Wamiliana Wamiliana
Jurnal 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 (49.844 KB) | DOI: 10.9744/jti.6.1.pp. 1-9

Abstract

In this paper we consider the Degree Constrained Minimum Spanning Tree Problem. This problem is concerned with finding, in a given edge weighted graph G (all weights are non-negative), the minimum weight spanning tree T satisfying specified degree restrictions on the vertices. This problem arises naturally in communication networks where the degree of a vertex represents the number of line interfaces available at a center. Because of its NP-completeness, a number of heuristics have been proposed. In this paper we propose two new search methods: one based on the method of Tabu search and the other based on a penalty function approach. For comparative analysis, we test our methods on some benchmark problems. The computational results support our methods.
ALGORITMA SIMULATED ANNEALING UNTUK PEMBENTUKAN SEL MESIN DENGAN DUA TIPE FUNGSI OBJEKTIF DAN DUA CARA PEMBATASAN SEL Henry Pantas Panggabean
Jurnal 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 (74.418 KB) | DOI: 10.9744/jti.6.1.pp. 10-24

Abstract

This article presents the implementation of simulated annealing (SA) algorithm to solve machine cell formation problem in group technology, with two types of objective function, i.e. minimization of intercellular part move and minimization of bottleneck machine duplication. There are also two ways for users to arrange the cell structure, i.e. define the upper bound of cell size or set the number of cells in final solution. This SA algorithm is then applied to solve some test cases with various size found in literature and proves itself to be able to achieve solutions with better quality then ones recorded in literature in some test cases. Meanwhile, number of iterations or the amount of computation time needed by this algorithm to proceed its best solution is quite small. Abstract in Bahasa Indonesia : Artikel ini menguraikan penerapan algoritma simulated annealing (SA) untuk menyelesaikan masalah pembentukan sel mesin dalam group technology dengan dua tipe fungsi objektif, yaitu minimasi jumlah perpindahan part antar sel dan minimasi jumlah duplikasi mesin bottleneck. Juga disediakan dua alternatif pembatasan sel bagi pengguna, yaitu penetapan batas atas ukuran sel atau penetapan jumlah sel mesin yang dikehendaki. Algoritma ini diujikan terhadap beberapa kasus uji dengan berbagai ukuran dalam literatur dan terbukti dapat menghasilkan kualitas solusi lebih baik dalam beberapa kasus dibandingkan yang tercatat dalam literatur. Sedangkan jumlah iterasi (waktu komputasi) yang dibutuhkan algoritma SA untuk mencapai solusi terbaiknya tergolong cukup kecil. Kata kunci: teknologi grup, pembentukan sel mesin, perpindahan antar sel, algoritma simulated annealing
STUDI PERBANDINGAN PERFORMANCE ALGORITMA HEURISTIK POUR TERHADAP MIXED INTEGER PROGRAMMING DALAM MENYELESAIKAN PENJADWALAN FLOWSHOP Tessa Vanina Soetanto; Herry Christian Palit; Ika Munika
Jurnal 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 (46.216 KB) | DOI: 10.9744/jti.6.1.pp. 79-85

Abstract

This paper presents a study about new heuristic algorithm performance compared to Mixed Integer Programming (MIP) method in solving flowshop scheduling problem to reach minimum makespan. Performance appraisal is based on Efficiency Index (EI), Relative Error (RE) and Elapsed Runtime. Abstract in Bahasa Indonesia : Makalah ini menyajikan penelitian tentang performance algoritma heuristik Pour terhadap metode Mixed Integer Programming (MIP) dalam menyelesaikan masalah penjadwalan flowshop dengan tujuan meminimalkan makespan. Penilaian performance dilakukan berdasarkan nilai Efficiency Index (EI), Relative Error (RE) dan Elapsed Runtime. Kata kunci: flowshop, makespan, algoritma heuristik Pour, Mixed Integer Programming.
A FUZZY-BASED DECISION MAKING APPROACH FOR PRODUCT CONCEPT SELECTION Ade Febransyah; J. Bely Utarja
Jurnal 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 (57.155 KB) | DOI: 10.9744/jti.6.1.pp. 25-36

Abstract

Selecting the best product concept is one of critical tasks in product development process. Making decisions at this stage becomes very difficult due to imprecise and uncertain product requirements. This paper presents the framework of product concept selection that integrates the fuzzy set theory and the analytic hierarchy process (AHP). In the proposed approach, the fuzzy membership function is employed in performing "pairwise comparison" between competing alternatives and a "reference" on each of the criteria. The use of a reference is due to the difficulty in consistently comparing concepts to one another. The comparisons are also used to obtain the relative importance of criteria with respect to the overall objective. Once pairwise comparisons are completed, vector aggregates are computed through the use of an original AHP method and fuzzy arithmetic operations. A numerical example is presented to illustrate the approach.
PENINGKATAN DAYA SAING INDUSTRI MELALUI ANALISA BIAYA KUALITAS (Studi Kasus pada Perusahaan Bahan Baku Makanan) Felecia Felecia; Tessa Vanina Soetanto
Jurnal 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 (38.816 KB) | DOI: 10.9744/jti.6.1.pp. 86-92

Abstract

This article is about quality costs analysis to improve industrial competitiveness, through a study case at food ingredients industry. The purpose of this quality costs analysis is to know quality cost resources which are not efficient. The first condition shows that 90% of total quality costs is used as prevention cost and 8% as internal failure cost. The final condition after analysis and improvement shows no more internal failure and the average quality costs is reduced by 9.66%. Abstract in Bahasa Indonesia : Artikel ini membahas tentang analisa biaya kualitas untuk peningkatan daya saing industri, studi kasus di sebuah industri bahan baku makanan. Tujuan dari analisa biaya kualitas adalah untuk mengetahui sumber-sumber biaya kualitas yang tidak effisien. Kondisi awal perusahaan menunjukkan bahwa 90% dari total biaya kualitas digunakan sebagai biaya pencegahan, dan 8% sebagai biaya kegagalan internal. Kondisi akhir setelah dilakukan analisa dan perbaikan adalah tidak lagi ditemukan biaya kegagalan internal dan rata-rata biaya kualitas perusahaan secara umum menurun sebesar 9.66%. Kata kunci: analisa biaya kualitas, industri bahan baku makanan.
PEMETAAN PREFERENSI KONSUMEN SUPERMARKET DENGAN METODE KANO BERDASARKAN DIMENSI SERVQUAL Kriswanto Widiawan; Irianty Irianty
Jurnal 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 (39.369 KB) | DOI: 10.9744/jti.6.1.pp. 37-46

Abstract

The management of supermarket usually has some assumptions about the customers' expectation. Sometimes these assumtions do not reflect the nature of customers' expectations. Because of this miss perception, the supermarket looses its profit and becomes inefficient. This research was carried out in order to find out the customers' expectation on facilities and services of the supermarkets according to the servqual dimensions. The outcomes will be mapped into Kano categorizations. The researcher asked the customer dan manager of four supermarkets to fill the prepared questionnaires. Based on the result of customers' questionnaires, tangible, reliability and assurance dimensions were categorized as one dimensional. While responsiveness and emphaty dimensions were categorized as indifferent. Based on the result of managers' questionnaires, all servqual dimensions were categorized as one dimensional. After comparing the results of customers' and managers' questionnaires, there are three of four supermarkets which are match each other. Abstract in Bahasa Indonesia : Manajemen supermarket pada umumnya memiliki asumsi-asumsi mengenai harapan konsumen yang belum tentu sama dengan harapan konsumen sesungguhnya. Akibat ketidaktahuan informasi penting tersebut, tidak sedikit supermarket yang mengalami kerugian atau kinerjanya tidak efisien. Tujuan penelitian ini adalah mengetahui harapan konsumen tentang fasilitas dan layanan supermarket menurut dimensi servqual yang dipetakan ke dalam kategori Kano. Penelitian dilakukan terhadap konsumen dan manajer dengan cara memberikan kuesioner. Menurut responden konsumen supermarket, dimensi servqual yang tergolong kategori one dimensional adalah tangible, reliability dan assurance. Sedangkan dimensi responsiveness dan emphaty termasuk kategori indifferent. Sementara itu, responden manajer supermarket berpendapat semua dimensi servqual termasuk kategori one dimensional. Dari empat supermarket yang diteliti, diketahui ada tiga supermarket yang cocok persepsinya antara manajer dengan konsumennya. Kata kunci: Dimensi servqual, metode Kano, kepuasan konsumen.
PEMAKAIAN ALGORITMA GENETIK UNTUK PENJADWALAN JOB SHOP DINAMIS NON DETERMINISTIK Nico Saputro; Yento Yento
Jurnal 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.pp. 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.

Page 1 of 1 | Total Record : 9


Filter by Year

2004 2004


Filter By Issues
All Issue 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