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.  

scholarly journals PENERAPAN JOB SHOP SCHEDULING DENGAN ONE-MACHINE SCHEDULING UNTUK PRODUKSI FURNITURE DI UD. MANDIRI MEUBEL DAN FURNITURE BOJONEGORO

2020 ◽  
Vol 14 (10) ◽  
pp. 3387
Author(s):  
Agus Sulistiawan ◽  
Denny Nurdiansyah
Keyword(s):  
Processing Time ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Machine Scheduling ◽  
Shop Scheduling ◽  
One Machine Scheduling ◽  
One Machine

Mebel adalah suatu perabot yang diperlukan seperti barang yang dapat dipindah-pindahkan untuk melengkapi rumah, kantor, dsb. Mebel juga disebut furniture. Bahan yang paling mahal adalah kayu jati. Tradisi membuat kerajinan mebel dan ukir-ukiran kayu jati di Bojonegoro sudah turun temurun dan terkenal dengan kualitasnya. Kerajinan kayu jati ini membuka peluang usaha di Bojonegoro dengan adanya beberapa pengrajin yang mendirikan Usaha Dagang (UD). Permasalahan biasanya muncul ketika pesanan yang dikerjakan tidak bisa memenuhi target konsumen karena terjadi keterlambatan produksi. Untuk menyelesaikan permasalahan ini diperlukan penjadwalan produksi. Tujuan penelitian ini adalah menerapkan job shop scheduling dengan one-machine scheduling untuk penjadwalan produksi furniture di UD. Mandiri Meubel dan Furniture Bojonegoro. Metode yang digunakan adalah job shop scheduling dengan one-machine scheduling berdasarkan tujuh kaidah prioritas dengan bantuan software POM-QM dan pertimbangan multi-starting days. Sumber data penelitian adalah data primer yang diperoleh melalui proses wawancara dengan pemilik UD pada bulan maret 2020. Hasil penelitian ini diperoleh penjadwalan terbaik adalah shortest processing time (SPT) dengan rata-rata keterlambatan sebesar 39 hari. Penelitian ini memberikan kesimpulan bahwa penggunaan job shop scheduling dengan one-machine scheduling dan pertimbangan multi-starting days sangat sesuai diterapkan untuk penjadwalan produksi furniture di UD. Penjadwalan terbaik jatuh pada penjadwalan SPT dengan penjadwalan Moore sebagai alternatifnya

scholarly journals Single Machine Scheduling and Due Date Assignment with Past-Sequence-Dependent Setup Time and Position-Dependent Processing Time

2014 ◽  
Vol 2014 ◽  
pp. 1-9
Author(s):  
Chuan-Li Zhao ◽  
Chou-Jung Hsu ◽  
Hua-Feng Hsu
Keyword(s):  
Single Machine ◽  
Processing Time ◽  
Machine Scheduling ◽  
Setup Time ◽  
Single Machine Scheduling ◽  
Due Date ◽  
Position Effects ◽  
Due Date Assignment ◽  
Sequence Dependent ◽  
Tardy Jobs

This paper considers single machine scheduling and due date assignment with setup time. The setup time is proportional to the length of the already processed jobs; that is, the setup time is past-sequence-dependent (p-s-d). It is assumed that a job's processing time depends on its position in a sequence. The objective functions include total earliness, the weighted number of tardy jobs, and the cost of due date assignment. We analyze these problems with two different due date assignment methods. We first consider the model with job-dependent position effects. For each case, by converting the problem to a series of assignment problems, we proved that the problems can be solved inOn4time. For the model with job-independent position effects, we proved that the problems can be solved inOn3time by providing a dynamic programming algorithm.

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.

Sign in / Sign up

Export Citation Format

Share Document