Article Per Year (5 Year)
p-Index From 2019 - 2024
0.778
P-Index
This Author published in this journals
All Journal Jurnal Teknik Industri J@TI (TEKNIK INDUSTRI) SPEKTRUM INDUSTRI Industrial and Systems Engineering Assessment Journal (INASEA) Jurnal Ilmiah Teknik Industri Jurnal Ilmiah Manajemen dan Bisnis (JIMB) MIX : Jurnal Ilmiah Manajemen Jurnal Teknik Industri Jurnal Telematika Jurnal Doktor Manajemen (JDM) Business Economic, Communication, and Social Sciences Journal (BECOSS)
Johan Oscar Ong
President University
Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Electrical & Electronics Engineering Industrial & Manufacturing Engineering Social Sciences Other

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

Found 23 Documents
Search

 1   2   3 
Penjadwalan Non-Delay Melalui Mesin Majemuk Untuk Meminimumkan Makespan Ong, Johan Oscar
SPEKTRUM INDUSTRI Vol 11, No 2: Oktober 2013
Publisher : SPEKTRUM INDUSTRI

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (20.547 KB)

Abstract

Di dalam sebuah perusahaan, penjadwalan produksi mempunyai peranan yang cukup penting. Salah satunya adalah mengetahui kapan waktu harus memulai suatu pekerjaan dan kapan waktu mengakhirinya. Penjadwalan yang berjalan dengan baik akan memberikan dampak positif, yaitu meminimumkan biaya operasi dan waktu pengiriman, yang pada akhirnya dapat meningkatkan kepuasan pelanggan. PT. XYZ adalah salah satu perusahaan manufaktur yang bergerak di bidang Flexible Packaging dan menggunakan sistem job shop pada operasi penjadwalannya. Permasalahan yang kadang terjadi disini adalah permintaan dari konsumen yang banyak menyebabkan penumpukan pekerjaan atau barang sehingga membentuk antrian panjang yang tidak dapat diselesaikan secara optimal. Tahapan-tahapan yang dilakukan pada penelitian ini adalah observasi perusahaan, identifikasi masalah, perumusan masalah, tujuan penelitian, pembatasan masalah, asumsi, studi literatur, pengumpulan dan pengolahan data, analisis, kemudian tahap terakhir adalah kesimpulan dan saran. Metode yang dipakai dalam penelitian ini adalah algoritma Non-Delay dengan menggunakan mesin majemuk sesuai dengan keadaan kebanyakan perusahaan saat ini. Dari penelitian ini dapat disimpulkan bahwa metode penjadwalan dengan menggunakan algoritma non-delay untuk mesin majemuk lebih optimal daripada metode yang telah digunakan oleh perusahaan saat ini. Dengan metode ini, untuk memproduksi 48 job dengan 33 mesin membutuhkan makespan 373 jam kerja dengan flow time 6,711 jam dan tardiness 118 jam. Kata kunci: Penjadwalan produksi, non-delay scheduling, mesin majemuk, makespan, flow time, tardiness.
IMPLEMENTING ECONOMIC ORDER INTERVAL FOR MULTIPLE ITEMS TO REDUCE TOTAL INVENTORY COST Maukar, Anastasia L.; Ong, Johan Oscar; Christananta, Yoshua
Industrial and Systems Engineering Assessment Journal (INASEA) Vol 14, No 1 (2013): INASEA Vol. 14 No. 1
Publisher : Industrial and Systems Engineering Assessment Journal (INASEA)

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Nowadays inventory management has become a major concern for company because it can bring value added. Inventory management focuses on maintaining and managing the inventory level in order to fulfill the customer’s demand with the lowest cost. In retailing and wholesaling, multiple items from the same supplier are jointly ordered. It means that the order interval of each item must be the same. However, there are several manufacturing companies that have not achieved the optimum solution in inventory management for multiple items. It leads them to increase the total inventory cost which are most caused by improper order interval. Thus, appropriate inventory management may reduce the total inventory cost. This research tried to identify this problem. The first step that should be done was identifying the problems, scopes, and objectives of the research aimed to minimize the inventory control management. After that we collected data and analyzed the supported data in inventory management using the total inventory cost analysis as a parameter in comparing the actual system and the proposal system. This research also implemented forecasting methodology to predict the future demand. In the final section, we implemented the economic order interval in order process for determining the optimum order interval. The result showed that the proposal system can reduce the total inventory cost over 21% from the current condition.
DEVELOPING PROPOSED LAYOUT FOR INCREASING LINE EFFICIENCY ON BODYSHOP Ong, Johan Oscar; Cornelia, Cornelia
Industrial and Systems Engineering Assessment Journal (INASEA) Vol 14, No 2 (2013): INASEA Vol. 14 No. 2
Publisher : Industrial and Systems Engineering Assessment Journal (INASEA)

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Recently, an imbalance workstation in assembly line is one of the critical problems faced by many companies. Many researches have proposed various designs of assembly line balancing to solve this problem. This research compared straight line balancing and u-shaped line balancing which both had the same target to minimize the workstations. The result showed that u-shaped line balancing provided a better solution than the straight line balancing did in number of workstation. Straight line balancing utilized rank positional weight (RPW) whereas u-shaped line balancing utilized Critical Task Method (CTM). Significantly, u-shaped line balancing was more efficient than straight line balancing.
IMPLEMENTASI ALGORITMA K-MEANS CLUSTERING UNTUK MENENTUKAN STRATEGI MARKETING PRESIDENT UNIVERSITY Ong, Johan Oscar
Jurnal Ilmiah Teknik Industri Vol. 12, No. 1, Juni 2013
Publisher : Universitas Muhammadiyah Surakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Information technology advances very rapidly at this time to generate thousands or even millions of data from various aspect of life. However, what can be done with that much data?. In this research, we start from calculation of data set of students who have graduated from President University using k-means clustering algorithm, namely by classifying the data of students into several clusters based on the characteristics of this data in order to discover the information hidden from the data set of student who have graduated from President University. The attribute data that is used in this study is hometown, major and GPA. The purpose of this study is to help the President Universitys marketing department in predicting promotion strategies undertaken in the cities in Indonesia. Information gained in this study can be used as a references in determining the proper strategy for marketing team in their promotion activities in the cities in Indonesia so that the campaign will be more effective and efficient.
IMPLEMENTASI DISTRIBUSI REQUIREMENT PLANNING DAN SAVING MATRIX UNTUK MEMINIMASI TOTAL BIAYA DISTRIBUSI DI INDUSTRI BAHAN KIMIA Ong, Johan Oscar; Saraka, Arianto
Jurnal Ilmiah Teknik Industri Vol. 12, No. 2, Desember 2013
Publisher : Universitas Muhammadiyah Surakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Planning and scheduling of the distribution of goods in PT. Senatama Laboranusa are not well coordinated, so the demand for each product is out of control, which results in deficiency or excess of inventories in both of the factories and each warehouse. This problem will affect the distribution cost incurred by the company. In this study, the distribution data process is done by using Distribution Requirement Planning method and route distribution processing by using Saving Matrix, in which both of these methods can group the delivery schedule and flow of distribution route regularly. PO Release, which contains time, order amount of each area, and lot size EOQ (Economic Order Quantity) method used; will be generated from the calculation of DRP. From the calculation of Saving Matrix, route order sequence is applied by using Nearest Neighbor method. After the implementation of Distribution Requirement Planning, the cost reduction resulted is 29.75% and the difference in distance after the application of Saving Matrix is 983.3 Km. With a good distribution activity planning and scheduling, the success rate in meeting the customer demand would be more optimal, while sales performance increases in fulfilling orders in a timely manner and  appropriate amount, hence the distribution costs can be kept as minimum as possible.
PENJADWALAN NON-DELAY MELALUI MESIN MAJEMUK UNTUK MEMINIMUMKAN MAKESPAN Ong, Johan Oscar
SPEKTRUM INDUSTRI Vol 11, No 2: Oktober 2013
Publisher : Universitas Ahmad Dahlan Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (5238.031 KB) | DOI: 10.12928/si.v11i2.1661

Abstract

Di dalam sebuah perusahaan, penjadwalan produksi mempunyai peranan yang cukup penting. Salah satunya adalah mengetahui kapan waktu harus memulai suatu pekerjaan dan kapan waktu mengakhirinya. Penjadwalan yang berjalan dengan baik akan memberikan dampak positif, yaitu meminimumkan biaya operasi dan waktu pengiriman, yang pada akhirnya dapat meningkatkan kepuasan pelanggan. PT. XYZ adalah salah satu perusahaan manufaktur yang bergerak di bidang Flexible Packaging dan menggunakan sistem job shop pada operasi penjadwalannya. Permasalahan yang kadang terjadi disini adalah permintaan dari konsumen yang banyak menyebabkan penumpukan pekerjaan atau barang sehingga membentuk antrian panjang yang tidak dapat diselesaikan secara optimal. Tahapantahapan yang dilakukan pada penelitian ini adalah observasi perusahaan, identifikasi masalah, perumusan masalah, tujuan penelitian, pembatasan masalah, asumsi, studi literatur, pengumpulan dan pengolahan data, analisis, kemudian tahap terakhir adalah kesimpulan dan saran. Metode yang dipakai dalam penelitian ini adalah algoritma Non-Delay dengan menggunakan mesin majemuk sesuai dengan keadaan kebanyakan perusahaan saat ini. Dari penelitian ini dapat disimpulkan bahwa metode penjadwalan dengan menggunakan algoritma non-delay untuk mesin majemuk lebih optimal daripada metode yang telah digunakan oleh perusahaan saat ini. Dengan metode ini, untuk memproduksi 48 job dengan 33 mesin membutuhkan makespan 373 jam kerja dengan flow time 6,711 jam dan tardiness 118 jam. Kata Kunci: Penjadwalan produksi, non-delay scheduling, mesin majemuk, makespan, flow time, tardiness.
DEVELOPING PROPOSED LAYOUT FOR INCREASING LINE EFFICIENCY ON BODYSHOP Ong, Johan Oscar; Cornellia, Cornellia
SPEKTRUM INDUSTRI Vol 12, No 2: Oktober 2014
Publisher : Universitas Ahmad Dahlan Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (7616.065 KB) | DOI: 10.12928/si.v12i2.1665

Abstract

Recently, an imbalance workstation in the assembly line is one of the critical problem that many companies face. Many researches have done to solve this problem with the various designs of assembly line balancing. This research presents the comparison between straight line balancing and u-shaped line balancing. Both straight line balancing and u-shaped line balancing have the same goal; minimizing the workstations. The result of this research shows that u-shaped line balancing gives a better solution than the straight line balancing in term of number of workstation. Straight line balancing is using Rank Positional Weight (RPW) whereas u-shaped line balancing is using Critical Task Method (CTM). Significantly, u-shaped line balancing is more efficient than straight line balancing. Keywords : assembly line balancing, straight line balancing, u-shaped line balancing, Rank Positional Weight, Critical Task Method
IMPLEMENTASI ALGORITMA K-MEANS CLUSTERING UNTUK MENENTUKAN STRATEGI MARKETING PRESIDENT UNIVERSITY Ong, Johan Oscar
Jurnal Ilmiah Teknik Industri Vol. 12, No. 1, Juni 2013
Publisher : Muhammadiyah University Press

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23917/jiti.v12i1.651

Abstract

Information technology advances very rapidly at this time to generate thousands or even millions of data from various aspect of life. However, what can be done with that much data?. In this research, we start from calculation of data set of students who have graduated from President University using k-means clustering algorithm, namely by classifying the data of students into several clusters based on the characteristics of this data in order to discover the information hidden from the data set of student who have graduated from President University. The attribute data that is used in this study is hometown, major and GPA. The purpose of this study is to help the President University's marketing department in predicting promotion strategies undertaken in the cities in Indonesia. Information gained in this study can be used as a references in determining the proper strategy for marketing team in their promotion activities in the cities in Indonesia so that the campaign will be more effective and efficient.
IMPLEMENTASI DISTRIBUSI REQUIREMENT PLANNING DAN SAVING MATRIX UNTUK MEMINIMASI TOTAL BIAYA DISTRIBUSI DI INDUSTRI BAHAN KIMIA Ong, Johan Oscar; Saraka, Arianto
Jurnal Ilmiah Teknik Industri Vol. 12, No. 2, Desember 2013
Publisher : Muhammadiyah University Press

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23917/jiti.v12i2.642

Abstract

Planning and scheduling of the distribution of goods in PT. Senatama Laboranusa are not well coordinated, so the demand for each product is out of control, which results in deficiency or excess of inventories in both of the factories and each warehouse. This problem will affect the distribution cost incurred by the company. In this study, the distribution data process is done by using Distribution Requirement Planning method and route distribution processing by using Saving Matrix, in which both of these methods can group the delivery schedule and flow of distribution route regularly. PO Release, which contains time, order amount of each area, and lot size EOQ (Economic Order Quantity) method used; will be generated from the calculation of DRP. From the calculation of Saving Matrix, route order sequence is applied by using Nearest Neighbor method. After the implementation of Distribution Requirement Planning, the cost reduction resulted is 29.75% and the difference in distance after the application of Saving Matrix is 983.3 Km. With a good distribution activity planning and scheduling, the success rate in meeting the customer demand would be more optimal, while sales performance increases in fulfilling orders in a timely manner and  appropriate amount, hence the distribution costs can be kept as minimum as possible.
Vehicle Routing Problem with Backhaul, Multiple Trips and Time Window Ong, Johan Oscar; ., Suprayogi
Jurnal Teknik Industri Vol 13, No 1 (2011): JUNE 2011
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (276.788 KB) | DOI: 10.9744/jti.13.1.1-10

Abstract

Transportation planning is one of the important components to increase efficiency and effectiveness in the supply chain system. Good planning will give a saving in total cost of the supply chain. This paper develops the new VRP variants’, VRP with backhauls, multiple trips, and time window (VRPBMTTW) along with its problem solving techniques by using Ant Colony Optimization (ACO) and Sequential Insertion as initial solution algorithm. ACO is modified by adding the decoding process in order to determine the number of vehicles, total duration time, and range of duration time regardless of checking capacity constraint and time window. This algorithm is tested by using set of random data and verified as well as analyzed its parameter changing’s. The computational results for hypothetical data with 50% backhaul and mix time windows are reported.
Co-Authors Achmad H Sutawijaya Anastasia L. Maukar Arianto Saraka Arianto Saraka, Arianto Arief Samuel Gunawan Cornelia Cornelia Cornellia Cornellia Cornellia, Cornellia Dicky Salim Don Thomas Joseph Enny Ariyanto Eny Ariyanto Ferdian Cahyadi Jati Pambudi Jusak Sali Kosasih Masydzulhak Djamil Masyhudzulhak Mahazan Masyudzulhak Djamil MZ Ricky Effendi Saluy, A Badawi Sugiyono Sugiyono Sugiyono Sugiyono Suprayogi . Suprayogi . Yoshua Christananta