scholarly journals MERANCANG MODEL PENJADWALAN KONSTRUKSI MULTI BENDING DENGAN MEMPERTIMBANGKAN POLA ALIRAN PROSES JOB SHOP UNTUK MEMINIMUMKAN MAKESPAN

INFOMATEK ◽  
2020 ◽  
Vol 22 (2) ◽  
pp. 115-122
Author(s):  
Rinto Yusriski ◽  
Ragil Pardiyono ◽  
Sinta Rahmawati ◽  
Lia Nur Atika
Keyword(s):  
Processing Time ◽  
Job Shop ◽  
Due Date ◽  
Lot Splitting ◽  
First Come First Serve

PT XYZ merupakan salah satu perusahaan manufaktur yang bergerak di bidang mebel seperti meja, rak dan kursi. Karakteristik pekerjaan yang diproses perusahaan adalah terdapat sejumlah pekerjaan yang harus dikerjakan pada mesin-mesin dengan routing yang berbeda-beda (memiliki aliran proses job shop) dan setiap pekerjaan terdiri atas satu atau lebih unit permintaan. Hasil studi awal menunjukkan bahwa terdapat masalah pada Departemen produksi bagian konstruksi multi bending yaitu tidak tercapainya target produksi harian (tercapai sebesar 77%). Berdasarkan hasil pengecekan kapasitas menunjukkan bahwa kapasitas tersedia sebesar 22.080 menit, sementara waktu yang diperlukan adalah 5.472 menit. Dengan demikian, target produksi seharusnya dapat selesai pada waktu yang telah ditetapkan oleh perusahaan. Studi awal menyimpulkan bahwa metoda penjadwalan perusahaan perlu diperbaiki. Perusahaan mengadopsi teknik penjadwalan dengan aturan prioritas First-Come-First-Serve (FCFS), yaitu prioritas pengerjaan job diurutkan berdasarkan saat kedatangan job ke lantai produksi. Analisa awal menunjukkan bahwa keterlambatan ini disebabkan oleh pengiriman pekerjaan dari suatu mesin ke mesin yang lain yang dilakukan setelah seluruh komponen pekerjaan tersebut diselesaikan. Hal ini mengakibatkan makespan yang panjang sehingga beberapa pekerjaan selesai melampaui saat tenggat (due date). Pada sistem nyata diketahui bahwa stasiun kerja memiliki jumlah mesin lebih dari satu sehingga memungkinkan job untuk dijadwalkan pada mesin-mesin tersebut secera paralel. Selain itu, komponen-komponen dari job yang telah selesai bisa saja dikirimkan pada mesin selanjutnya (operation overlapping) sesuai routing tanpa harus menunggu seluruh komponen selesai. Hal ini membutuhkan penentuan besar ukuran lot yang harus ditransfer antar mesin. Penelitian ini mengusulkan metode penjadwalan dengan menggunakan prioritas Shortest Processing Time (SPT) yang digkombinasikan dengan teknik lot splitting. Asumsi yang digunakan adalah seluruh job sudah tersedia dari saat t=0. Hasil dari penjadwalan usulan ini mempunyai hasil yang lebih baik dalam mengurangi makespan sebesar 20,7% dan meningkatkan utilitas mesin sebesar 8%.

scholarly journals ANALISA PERBANDINGAN PENJADWALAN PRODUKSI DENGAN METODE CDS (CAMPBELL DUDEK SMITH), EDD (EARLIEST DUE DATE) DAN FCFS (FIRST COME FIRST SERVE) PADA PT. SARI WARNA ASLI UNIT V

2021 ◽  
Vol 1 (2) ◽  
pp. 46-51
Author(s):  
Dwi Ayu Lestari, Vikha Indira Asri
Keyword(s):  
Production Process ◽  
Production System ◽  
Production Scheduling ◽  
Job Shop ◽  
Allocation Of Resources ◽  
Due Date ◽  
Scheduling System ◽  
Make To Order ◽  
First Come First Serve ◽  
Scheduling Method

Scheduling is defined as the process of sequencing the manufacture of a product as a whole on several machines. All industries need proper scheduling to manage the allocation of resources so that the production system can run quickly and precisely as of it can produce optimal product. PT. Sari Warna Asli Unit V is one of the companies that implements a make to order production system with the FCFS system. Thus, scheduling the production process at this company is also known as job shop production scheduling. The methods used in this research are the CDS method, the EDD method and the FCFS method. The purpose of this research is to minimize the production time and determine the best method that can be applied to the company. The results of this research showed that the makespan obtained in the company's scheduling system with FCFS rules was 458 minutes, and the results of scheduling using the CDS method obtained a makespan value of 329 minutes, then the best production scheduling method that had the smallest makespan value was the CDS method.

A GASP simulation study of job-shop scheduling

SIMULATION ◽  
1972 ◽  
Vol 18 (1) ◽  
pp. 1-10 ◽  
Author(s):  
Said Ashour ◽  
S.D. Vaswani
Keyword(s):  
Simulation Study ◽  
Processing Time ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Flow Time ◽  
Computer Language ◽  
Due Dates ◽  
Due Date ◽  
Large Size ◽  
Operation Rule

The purpose of this paper is to report on a study which involves a simulation of a hypothetical job shop with several machines. The investigation employs GASP-II as a computer language. This simulation study is concerned with: (1) testing a new method of assign ing job due-dates and (2) comparing and evaluating the effect of different processing-time distributions on the performance of a number of scheduling rules. The most significant results of this study are: (1) The shortest-imminent-operation rule is superior to others in reducing job lateness and shop flow time (2) The procedure in which the due-date allowance is proportional to the number of operations and work content of the jobs has proved to be beneficial in the case of the non-due-date rules (3) The operation of a job shop using the shortest-imminent-operation and slack-per-remaining-number-of-operations rules is degraded when the processing-time distribution having Erlang parameter K equal to 4 or 8. However, per formance is better when K = 8 than when K = 4 (4) The GASP-II package works efficiently for large-size shop problems.

scholarly journals Penjadwalan Produksi Job shop Mesin Majemuk Menggunakan Algoritma Non Delay untuk Meminimalkan Makespan

2021 ◽  
Vol 10 (2) ◽  
pp. 183-190
Author(s):  
Adhie Tri Wahyudi ◽  
Bagus Ismail Adhi Wicaksana ◽  
Maresta Andriani
Keyword(s):  
Resource Allocation ◽  
Processing Time ◽  
Job Shop ◽  
Service Industry ◽  
Machine Scheduling ◽  
Due Date ◽  
Production Time ◽  
Target Time ◽  
Time Scheduling ◽  
Medium Enterprises

Scheduling is an important factor in both manufacturing and service industry environments. Scheduling is a resource allocation arrangement for completing tasks that involve work, resources and time. With the scheduling, all work can be completed according to priority and can minimize processing time, so that makespan is minimal. In addition, it can reduce idle machines and reduce the inventory of semi-finished goods. Maryati Small Micro and Medium Enterprises (IKM) is a business that is engaged in the manufacture of clothing that produces various types of products such as baby clothes, teenage clothes to adults. So far, IKM Maryati is in the process of machine scheduling by determining the order of Job execution based on the longest to shortest total Job processing time. Scheduling with this method creates problems for the company, as evidenced by the accumulation of semi-finished goods at several work-stations. Another problem is when orders arrive at a certain period with a large variety and number of products, causing Job completion that exceeds the target time (due-date). The size of the makespan causes the production time to increase, so the company is late to start production of orders in the following month. In this study, the Non-delay algorithm is used to solve the problems that arise in IKM Maryati. The result obtained is the scheduling using the existing method by IKM Maryati which produces 44 days makespan value. Meanwhile, by applying the Non-delay compound engine algorithm, it produces a makespan of 42 days. This shows that the compound machine Non-delay Algorithm method can minimize the makespan value in IKM Maryati. There is an efficiency of 4.55% in both time and cost variables.  

Scheduling a dual-resource flexible job shop with makespan and due date-related criteria

2019 ◽  
Vol 291 (1-2) ◽  
pp. 5-35 ◽  
Author(s):  
Jose L. Andrade-Pineda ◽  
David Canca ◽  
Pedro L. Gonzalez-R ◽  
M. Calle
Keyword(s):  
Job Shop ◽  
Flexible Job Shop ◽  
Due Date
Sign in / Sign up

Export Citation Format

Share Document