scholarly journals PENJADWALAN MESIN DENGAN MENGGUNAKAN ALGORITMA JADWAL NON-DELAY DI PT. SNN SEKSI WORKSHOP

2021 ◽  
Vol 5 (1) ◽  
Author(s):  
Inna Kholidasari ◽  
Keyword(s):  
Production Process ◽  
Production Scheduling ◽  
Completion Time ◽  
Job Shop ◽  
Machine Scheduling ◽  
Spare Parts ◽  
First In First Out ◽  
A Company

Production scheduling is the most important part in carrying out the production process that will be carried out on a production floor. Scheduling activities are carried out before the production process begins to ensure the smooth running of the production process. If the production scheduling is not done properly, there will be obstacles in the production process and will cause losses to the company. This study aims to determine the production machine scheduling in a company engaged in the manufacture of spare parts for automotive products. This company implements a job shop production process and uses the First In First Out method in completing its work. Due to the large number of products that have to be produced, there are often two or more products that must be worked on at the same time and machine. This condition causes some products to have to wait for the associated machine to finish operating and causes long product turnaround times. This problem is solved by making a production machine scheduling using the Non-Delay method. By applying this method, the makespan of completion time can be minimized.

scholarly journals ANALISIS PENJADWALAN PRODUKSI MENGGUNAKAN METODE CAMPBELL DUDEK SMITH DAN DANNENBRING DALAM MEMINIMUMKAN TOTAL WAKTU PRODUKSI BERAS

2021 ◽  
Vol 10 (4) ◽  
pp. 215
Author(s):  
NI KADEK DESI PUJA ANTARI ◽  
LUH PUTU IDA HARINI ◽  
NI KETUT TARI TASTRAWATI
Keyword(s):  
Production Process ◽  
Production Scheduling ◽  
Completion Time ◽  
Total Completion Time ◽  
Efficient Production ◽  
Smith Method ◽  
Manufacturing Company ◽  
Calculation Results ◽  
A Company

The increasing needs for basic materials has resulted in an increased production process of basic materials in a company. CV. Puspa is a manufacturing company engaged in the production of rice, on the production process, CV. Puspa often has a buildup of work so that it requires an alternative production scheduling optimally. This research was conducted to minimize the total time of completion using the Campbell Dudek Smith and Dannenbring method in determining efficient production scheduling. Based on the scheduling sequence obtained, the calculation results of the total completion time using the Campbell Dudek Smith method are less than or equal to the results of calculation using the Dannenbring method. So the Campbell Dudek Smith method is more efficient than the Dannenbring method to be applied to CV. Puspa.

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.

scholarly journals A COMPARATIVE STUDY OF THE USABILITY OF DIFFERENT PRODUCTION SCHEDULING ALGORITHMS AND RULES

2021 ◽  
Vol 2 ◽  
pp. 41-46
Author(s):  
Pavol Jurík
Keyword(s):  
Production Process ◽  
Production Scheduling ◽  
Job Shop ◽  
Flow Shop ◽  
Production Systems ◽  
Scheduling Problems ◽  
History Of ◽  
Service Object ◽  
The Right ◽  
Production Plans

Production scheduling optimization is a very important part of a production process. There are production systems with one service object and systems with multiple service objects. When using several service objects, there are systems with service objects arranged in a parallel or in a serial manner. We also distinguish between systems such as flow shop, job shop, open shop and mixed shop. Throughout the history of production planning, a number of algorithms and rules have been developed to calculate optimal production plans. These algorithms and rules differ from each other in the possibilities and conditions of their application. Since there are too many possible algorithms and rules it is not easy to select the proper algorithm or rule for solving a specific scheduling problem. In this article we analyzed the usability of 33 different algorithms and rules in total. Each algorithm or rule is suitable for a specific type of problem. The result of our analysis is a set of comparison tables that can serve as a basis for making the right decision in the production process decision-making process in order to select the proper algorithm or rule for solving a specific problem. We believe that these tables can be used for a quick and easy selection of the proper algorithm or rule for solving some of the typical production scheduling problems.

Usulan Penjadwalan Produksi dengan Algoritma Ant Colony (Studi Kasus PT. KLM Medan)

2019 ◽  
Vol 2 (2) ◽  
Author(s):  
Dila Syafrina Bangko ◽  
Rosnani Ginting
Keyword(s):  
Production Process ◽  
Production Scheduling ◽  
Completion Time ◽  
Processing Time ◽  
Ant Colony Algorithm ◽  
Optimal Combination ◽  
Ant Colony ◽  
A Value ◽  
Scheduling Method

Algoritma Ant Colony adalah suatu metauristik yang menggunakan teknik semut dengan kombinasi permasalahan secara optimal atau secara komunikasi semunt yang menggunakan alat penciuman untuk memecahkan masalah. Metode penjadwalan produksi yang selama ini digunakan berdasarkan kesamaan proses produksi. Hal inilah yang terkadang menyebabkan waktu penyelesaian produksi menjadi lebih panjang. Maka dilakukan metode lain untuk menggurangi makespan yaitu dengan menggunakan metode penjadwalan algoritma ant colony. Pada metode Shortest Processing Time (SPT) menghasilkan makespan sebesar 236079.89, sedangkan pada algoritma ant colony menghasilkan nilai α=10, β = 1, ρ = 0.5, Ncmax = 50, jumlah semut 7 dan makespan=215243.22. berdasarkan hasil yang diperoleh maka algoritma ant colony memiliki makespan terkecil yaitu 215243.22 detik.   The Ant Colony algorithm is a metauristic that uses ant techniques with optimal combination of problems or semuntic communication using olfactory tools to solve problems. The production scheduling method that has been used is based on the similarity of the production process. This is what sometimes causes the production completion time to be longer. Then another method is used to reduce makespan by using the ant colony algorithm scheduling method. In the Shortest Processing Time (SPT) method produces makespan of 236079.89, while the ant colony algorithm produces a value of α = 10, β = 1, ρ = 0.5, Ncmax = 50, the number of ants 7 and makespan = 215243.22. Based on the results obtained, the ant colony algorithm has the smallest makespan, 215243.22 seconds.

scholarly journals Genetic Algorithm Modification for Production Scheduling

2013 ◽  
Vol 38 (4) ◽  
pp. 299-309 ◽  
Author(s):  
Tomasz Brzęczek ◽  
Dariusz Nowak
Keyword(s):  
Genetic Algorithm ◽  
Production Scheduling ◽  
Completion Time ◽  
Job Shop ◽  
Formal Models ◽  
Theoretical Part ◽  
Solution Algorithms

Abstract Scheduling of production soundly affects its capacity especially if system does complex production jobs. In the theoretical part of the article an overview of the scheduling methods proposed in the literature was presented. In this paper it was stated a variant of job shop problem, in which jobs can overlap in some machines and omit others. Authors designed and presented here genetic algorithm to optimize solution of such a problem. The algorithm finds jobs sequence priority and in accordance with it schedules operations and calculates their completion time. An adequate problem was met in an examined plant, where 20 production jobs consisted of 11 to 20 operations assigned to at most 15 machines. Such big parameter numbers are crucial for big formal models and their solution algorithms. The designed algorithm proved to deal with parameters scale, as it found the schedule with 23,8% shorter jobs completion time in comparison with FIFO heuristic, that has been used so far by the plant.

scholarly journals Minmasi Waktu Produksi Sepatu Allstar Type Chuck Taylor Low Cut Menggunakan Value Stream Mapping (VSM) dan Penjadwalan

2017 ◽  
Vol 1 ◽  
pp. 26
Author(s):  
Widy Setyawan ◽  
Iwan Maifal
Keyword(s):  
Production Process ◽  
Information Flow ◽  
Waiting Time ◽  
Lean Manufacturing ◽  
Completion Time ◽  
Machine Scheduling ◽  
Idle Time ◽  
Value Stream Mapping ◽  
Value Stream

Abstract— CV.Cipendawa is a shoe company, which was established in 2005. The brand of goods produced is Allstar shoes, which become main products. Problems that occur in the process of shoe production Allstar is a waste in the form of idle time (idle time). Waste in the form (idle time) occurs because the company does not pay attention to the existence of alternative Allstar shoe assembly making the engine scheduling less good. This research is done by using lean manufacturing and machine scheduling, in lean manufacturing concept in using the operation of process chart (OPC) and value stream mapping (VSM) to describe the value in production process which includes material and information flow. While the machine scheduling is used to reschedule the production process of Allstar shoes so it is expected to reduce waste. The purpose of this research is to minimize the time of completion of production by paying attention to the assembly alternatives on the production floor. The results of this study indicate that with the scheduling of machines that pay attention to the order of prakitan get the completion time of production of 718 seconds and the waiting time of 114 seconds.dan on making a single shoe score add value of 7102 seconds Keyword : value stream mapping and Scheduling machine.

Penjadwalan Mesin Pada PT.XYZ Dengan Menggunakan Algoritma Genetik

2019 ◽  
Vol 2 (2) ◽  
Author(s):  
Rosnani Ginting ◽  
Benedictus Vito Bayu
Keyword(s):  
Genetic Algorithm ◽  
Job Shop ◽  
Spare Part ◽  
Industrial Sector ◽  
Spare Parts ◽  
Make To Order ◽  
Fitness Value ◽  
Scheduling Method ◽  
Palm Oil Mill ◽  
A Company

Persaingan antar perusahaan semakin meningkat seiring dengan meningkatnya kemajuan ilmu pengetahuan dan teknologi. Permintaan konsumen juga semakin meningkat sesuai dengan perkembangan dalam bidang perindustrian. PT. XYZ merupakan perusahaan yang bergerak di bidang produksi mesin pada Pabrik Kelapa Sawit (PKS) dan juga memproduksi spare part mesin untuk perusahaan lainnya. Perusahaan melakukan kegiatan produksi berdasarkan pesanan atau order yang masuk (make to order), dengan proses pengerjaan job shop. Permasalahan yang dihadapi oleh PT. XYZ adalah permasalahan keterlambatan. Terdapat 5 produk yang mengalami keterlambatan. Untuk itu, pada penelitian ini dilakukan penjadwalan mesin untuk mengatasi permasalahan keterlambatan tersebut.Metode penjadwalan yang digunakan yaitu menggunakan algoritma genetik. Pada lagoritma genetik ini, dilakukan inisialisasi awal dengan menggunakan metode SPT untuk memperoleh urutan job. Kemudian dilakukan tahap seleksi, crossover dan mutase untuk memperoleh uruta job yang paling optimal. Berdasarkan pengolahan data yang dilakukan, diperoleh bahwa dalam tiga generasi terdapat empat kromosom terbaik, yaitu BECAD, BACED, BEACD, BCAED dengan nilai fitness yang sama yaitu 0,02144. Urutan kerja yang dipilih dalam hal ini adalah BCAED, yakni urutan pengerjaan semua produk. Urutan job ini memiliki makespan sebesar 46,637 jam merupakan yang terbaik dari tiap generasi dengan nilai fitness terbaik yaitu 0,02144.   Competition between companies is increasing along with the advancement of science and technology. Consumer demand is also increasing according to developments in the industrial sector. PT. XYZ is a company engaged in the production of machinery at the Palm Oil Mill (PKS) and also produces engine spare parts for other companies. The company conducts production activities based on orders or orders that enter (make to order), with the job shop process. Problems faced by PT. XYZ is a matter of delay. There are 5 products that experience delays. For that reason, in this study a machine scheduling was carried out to overcome the problem of delay. The scheduling method used was using a genetic algorithm. In this genetic lag, initial initialization is done by using the SPT method to obtain the job sequence. Then do the selection, crossover and mutase stages to get the most optimal job sequence. Based on the data processing performed, it was found that in three generations there were four of the best chromosomes, namely BECAD, BACED, BEACD, BCAED with the same fitness value of 0.02144. The work order chosen in this case is BCAED, which is the order of work for all products. This job sequence has a makespan of 46,637 hours which is the best of each generation with the best fitness value of 0,02144.

Penjadwalan Produksi Job Shop dengan Menggunakan Algoritma Tabu Search pada PT. KLM

2019 ◽  
Vol 2 (2) ◽  
Author(s):  
Aris Selamat Sinaga ◽  
Rosnani Ginting
Keyword(s):  
Tabu Search ◽  
Relative Error ◽  
Production Scheduling ◽  
Job Shop ◽  
Initial Conditions ◽  
Search Algorithm ◽  
Spare Part ◽  
Efficiency Index ◽  
Spare Parts ◽  
Tabu Search Algorithm

PT. KLM adalah perusahaan yang bergerak dalam manufaktur spare part. Dalam penelitian ini hanya dilakukan pada produksi spare part worm screw, cone guide, protection nut, extension shaft, pin and nut coupling, plat dismentling, cone, strainer dengan menggunakan mesin screwpress, Pola aliran proses jobshop digunakan dan diproduksi bersifat make to order. Tiap item melalui fasilitas mesin yng sama namun memiliki aliran proses yang berbeda, urutan dan waktu proses yang berbeda. sehingga dapat mengakibatkan terjadinya waktu menganggur pada sebuah mesin dan menyebabkan adanya tumpukan pekerjaan pada mesin yang lain. Penjadwalan produksi yang digunakan perusahaan saat ini masih menyebabkan keterlambatan penyelesaian pesanan, juga terdapat banyak pekerjaan yang belum dikerjakan yang disebabkan angka makespan yang terlalu besar. Penelitian ini bertujuan untuk meniminalkan makespan dengan menggunakan Algoritma Tabu Search. Hasil penelitian ini yaitu penjadwalan produksi mengalami reduksi waktu setelah digunakan algoritma Tabu Search dimana pada kondisi awal selama 815.6 menit atau 13,59 jam menjadi 758,2 menit atau 12,63 jam. Relative Error yang ditemukan menunjukkan adanya reduksi makespan yang diperoleh antara Algoritma Tabu Search dengan metode perusahaan adalah 6,87%. sedangkan besarnya Indeks Efisiensi yaitu 1,075.   PT. KLM is a company engaged in manufacturing spare parts. In this research, only the production of spare part worm screw, guide cone, protection nut, extension shaft, pin and nut coupling, dismentling plate, cone, strainer using screwpress machine, the pattern of the jobshop process used and produced are made to order. Each item through the same machine facility but has a different process flow, different order and processing time. so that it can result in idle time on a machine and cause a pile of work on another machine. The production scheduling used by the company currently still causes delays in completing orders, there are also a lot of work that has not been done due to the figure of makespan that is too big. This study aims to minimize makespan by using the Tabu Search Algorithm. The results of this study are that production scheduling experiences a time reduction after the Tabu Search algorithm is used where the initial conditions for 815.6 minutes or 13.59 hours to 758.2 minutes or 12.63 hours. The Relative Error found shows that makespan reduction is obtained between Tabu Search Algorithm and company method is 6.87%. while the magnitude of the Efficiency Index is 1.075.

Penjadwalan Produksi Menggunakan Metode Simulated Annealing pada Unit Produksi Daun Pintu di PT. ML

2019 ◽  
Vol 2 (2) ◽  
Author(s):  
Rosnani Ginting ◽  
Chairul Rahmadsyah Manik
Keyword(s):  
Simulated Annealing ◽  
Problem Solving ◽  
Production Scheduling ◽  
Production Control ◽  
Delivery Time ◽  
Production Schedule ◽  
A Company ◽  
Predetermined Time ◽  
Factory Floor

Penjadwalan merupakan aspek yang sangat penting karena didalamnya terdapat elemen perencanaan dan pengendalian produksi bagi suatu perusahaan yang dapat mengirim barang sesuai dengan waktu yang telah ditentukan, untuk memperoleh waktu total penyelesaian yang minimum. Masalah utama yang dihadapi oleh PT. ML adalah keterlambatan penyelesaian order yang mempengaruhi delivery time ke tangan costumer karena pelaksanaan penjadwalan produksi dilantai pabrik belum menghasilkan makespan yang sesuai dengan order yang ada. Oleh kaena itu dituntut untuk mencari solusi pemecahan masalah optimal dalam penentuan jadwal produksi untuk meminimisasi total waktu penyelessaian (makespan) semua order. Dalam penelitian ini, penjadwalan menggunakan metode Simulated Annealing (SA) diharapkan dapat menghasilkan waktu total penyelesaian lebih cepat dari penjadwalan yang ada pada perusahaan.   Scheduling is a very important aspect because in it there are elements of planning and production control for a company that can send goods in accordance with a predetermined time, to obtain a minimum total time of completion. The main problem faced by PT. ML is the delay in completing orders that affect delivery time to customer because the implementation of production scheduling on the factory floor has not produced the makespan that matches the existing order. Therefore, it is required to find optimal problem solving solutions in determining the production schedule to minimize the total time of elimination (makespan) of all orders. In this study, scheduling using the Simulated Annealing (SA) method is expected to produce a total time of completion faster than the existing scheduling in the company.

Research on Workshop Management System of Body-in-White Pressing Production

2012 ◽  
Vol 468-471 ◽  
pp. 2661-2667
Author(s):  
Ya Zhou Chen ◽  
Lin Wang
Keyword(s):  
Production Scheduling ◽  
Management System ◽  
Production Management ◽  
Task Assignment ◽  
Production Management System ◽  
Dispatching Algorithm ◽  
Body In White ◽  
Dynamic Dispatching ◽  
A Company ◽  
Detailed Function

Based on the analyzing of the characteristics of a Body-In-White pressing production process a pressing workshop production management system has been given in order to make the ERP production scheduling more executable. The detailed function model of it such as task assignment, quality control, mold maintenance and production scheduling has been thoroughly discussed. In order to make the production line capability balance the task dispatching algorithm has been given and the dynamic dispatching and controlling process has been explained. This system can be integrated with the upper ERP/CAPP/PDM system which can improve the information level of a company.

Sign in / Sign up

Export Citation Format

Share Document