It is the cache of http://puslit2.petra.ac.id/ejournal/index.php/ind/article/view/17684. It is a snapshot of the page. The current page could have changed in the meantime.
Tip: To quickly find your search term on this page, press Ctrl+F or ⌘-F (Mac) and use the find bar.

MODEL PENJADWALAN PADA FLOWSHOP-4-STAGE DENGAN KRITERIA MINIMISASI LATENESS MAKSIMUM DAN JUMLAH TARDY JOBS | Saleh | Jurnal Teknik Industri

MODEL PENJADWALAN PADA FLOWSHOP-4-STAGE DENGAN KRITERIA MINIMISASI LATENESS MAKSIMUM DAN JUMLAH TARDY JOBS

Alex Saleh, Emsosfi Zaini




Abstract


This research discusses jobs scheduling model on flowshop-4-stage for fabrication and assembly processes. Each job consists of a unique component and a common component. Both the unique and common components are processed on the first three machines and assembled on the fourth machine. The unique components are processed individually, while common components are processed in batches for which respective constant setups are needed. The criteria used for the models are to minimize maximum lateness and number of tardy jobs. The development is executed to accommodate the possibility of tardy jobs. A proposed algorithm is initiated with jobs scheduling using the earliest due date (EDD) rule for the single machine, and batching process using the dynamic programming principle. Number of tardy jobs improved based on Hodgson Algorithm. The proposed algorithm is not an optimal algorithm as we can not guarantee optimal in scheduling process, nevertheless the batching method can bring out an optimal solution. This research also discusses numerical cases to show model behavior.


Abstract in Bahasa Indonesia:

Penelitian ini membahas model penjadwalan job pada flowshop-4-stage untuk proses fabrikasi dan perakitan. Setiap job terdiri dari 1 unique component dan 1 common component, yang keduanya diproses pada tiga mesin pertama secara serial dan dirakit pada mesin keempat. Unique component diproses satu per satu sedangkan common component diproses dalam batch dengan waktu setup yang konstan untuk setiap batch. Kriteria yang digunakan adalah minimisasi lateness maksimum dan jumlah tardy jobs. Pengembangan model dilakukan untuk mengakomodasi adanya job yang terlambat. Algoritma dimulai dengan proses penjadwalan job dengan menggunakan aturan earliest due date (EDD) untuk mesin tunggal, dan proses batching dengan menggunakan pemrograman dinamis. Jumlah tardy jobs diperbaiki dengan Algoritma Hodgson. Algoritma yang diusulkan bukan merupakan algoritma optimal karena proses penjadwalan yang tidak dijamin optimal, meskipun proses batching dapat menghasilkan solusi optimal. Penelitian ini dilengkapi dengan contoh numerik untuk menunjukkan perilaku model.

Kata kunci: flowshop-4-stage, unique component, common component, penjadwalan batch, lateness maksimum , jumlah tardy jobs.


Keywords


flowshop-4-stage, unique component, common component, batch scheduling, maximum lateness, number of tardy jobs.

Full Text: PDF

Instructions for Preparing Papers for JTI.docx
Panduan untuk Menulis di JTI.docx

The Journal is published by The Institute of Research & Community Outreach - Petra Christian University. It available online supported by Directorate General of Higher Education - Ministry of National Education - Republic of Indonesia.


Copyright © Research Center Web-Dev Team