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 Usulan Penjadwalan Job Machine Seri Menggunakan Metode Campbell Dudek Smith (CDS) untuk Meminimasi Makespan di UD. Wira Vulkanisir

2019 ◽  
Vol 12 (2) ◽  
pp. 62
Author(s):  
Tengku Nurainun ◽  
Wira Oktiandri
Keyword(s):  
Production Process ◽  
Production System ◽  
Customer Demand ◽  
Scheduling System ◽  
Important Thing ◽  
Make To Order ◽  
Speed Up ◽  
A Company ◽  
Actual Method

Dalam perkembangan industri saat ini yang terus maju maka setiap perusahaan dituntut untuk dapat bersaing dan mempunyai strategi yang tepat agar tidak ketinggalan dari perusahaan pesaing yang lainnya. Strategi dari perusahaan itu sendiri bermacam-macam, dapat berupa peningkatan kualitas, ketepatan waktu penyelesaian suatu pekerjaan dan lain sebagainya. UD. Wira Vulkanisir merupakan suatu perusahaan yang bergerak di bidang vulkanisir ban, dengan jenis sistem produksi yang diterapkan yaitu MTO (Make To Order) dimana perusahaan ini sering mengalami keterlambatan dalam pengirim kepada konsumen, yang tentunya berdampak terhadap performa perusahaan itu sendiri. Penjadwalan dengan menggunakan metode CDS pada bulan maret 2019 mengahsilkan urutan job 9-8-7-6-3-4-2-5-1 dengan makespan sebesar 284,49 jam dimana metode ini lebih optimal dibandingkan dengan metode aktual perusahaan dengan selisih makespan sebesar 17,29 jam.Dari hasil penjadwalan menggunakan metode CDS dapat mempercepat proses produksi sebesar 5,6% di bandingkan penjadwalan perusahaan saat ini. Oleh karena ini itu, penajdwalan menggunakan metode CDS dapat di pertimbangkan oleh perusahaan untuk di terapkan di lantai produksi. In an industry scheduling is a very important thing to support the productivity of a company. Therefore, to meet customer demand and satisfaction, a scheduling system that is properly planned, effective and efficient is needed. UD. Wira Vulkanisir is a company engaged in tire retreading, with the type of production system being applied, namely MTO (Make To Order) where the company often experiences delays in the sender to consumers, which of course has an impact on the performance of the company itself. Scheduling using the CDS method in March 2019 produces a sequence of jobs 9-8-7-6-3-4-2-5-1 with makespan of 284.49 hours where this method is more optimal than the actual method of the company with a difference of makespan of 17.29 hours. From the results of scheduling using the CDS method it can speed up the production process by 5.6% compared to the current company scheduling. Because of this, the prediction of using the CDS method can be considered by the company to be applied on the production floor.

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.

Dual Resource Constrained Job Shop Dynamic Scheduling with Local Time Window

2014 ◽  
Vol 933 ◽  
pp. 708-713 ◽  
Author(s):  
Yuan Huang ◽  
Xiu Tian Yan ◽  
Jing Yao Li
Keyword(s):  
Local Time ◽  
Job Shop ◽  
Dynamic Scheduling ◽  
Time Window ◽  
Scheduling Algorithm ◽  
Resource Constrained ◽  
Dynamic Disturbance ◽  
Scheduling System ◽  
Scheduling Method ◽  
Disturbance Analysis

To solve the Dual Resource Constrained Job Shop Dynamic Scheduling Problem with heterogeneous workers (DRCJDSP-HW),a three-tier dynamic scheduling system including dynamic disturbance analysis, dynamic disturbance evaluation and dynamic scheduling method was constructed based on the idea of scheduling with local time window. To minimize the revision of old scheduling scheme in DRCJDSP-HW, a hybrid dynamic scheduling algorithm was proposed based on the chromosome reduction mechanism and the scheduling optimization of local job in stages. The outstanding application effect of the dynamic scheduling system and the hybrid dynamic scheduling algorithm were validated reducing the influence of dynamic disturbances effectively by simulation experiment at last.

Intelligent Job Shop Scheduling in Auto Blanking Plant

2012 ◽  
Vol 476-478 ◽  
pp. 2023-2027
Author(s):  
Nian Sheng Cheng
Keyword(s):  
Job Shop ◽  
Job Shop Scheduling ◽  
Real Life ◽  
Priority Rule ◽  
Scheduling System ◽  
Shop Scheduling ◽  
Complete Problems ◽  
First Come First Serve ◽  
Logistics Management System ◽  
Intelligent Logistics

Job shop scheduling belongs to the large class of NP-complete (nondeterministic polynomial time complete) problems and the complexity of job shop scheduling characterizes many real-life situations. In auto blanking plant, intelligent scheduling system is needed to deal with the automation of production. The core structure of job shop scheduling system is designed. The scheduling rules such as mission-critical priority rule, first come first serve rule, the highest task priority rule and the urgent tasks priority rule are built with the definitions of express tasks, urgent tasks, middle urgent tasks and normal tasks according to the time features of tasks. The heuristic optimization algorithm is designed to follow the above rules. The intelligent logistics management system is built to optimize job shop scheduling in auto blanking plant.

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.

Bi-Level Quantum Evolutionary Algorithm for Scheduling of Dynamic Alliance

2009 ◽  
Vol 626-627 ◽  
pp. 783-788 ◽  
Author(s):  
W.L. Wang ◽  
S.X. Chen ◽  
Yan Wei Zhao ◽  
J.L. Zhang ◽  
H.Y. Wang
Keyword(s):  
Evolutionary Algorithm ◽  
Production Process ◽  
Production Scheduling ◽  
The Other ◽  
Scheduling System ◽  
Dynamic Alliance ◽  
Scheduling Model ◽  
The Relationship

The plan scheduling is an important part for forming a dynamic alliance on the ASP platform. In order to solve this problem, in the first place, a scheduling model of multi-objectives and multi-enterprise has been developed. The scheduling objectives of this model considered the enterprise credibility, production tasks, production process and the relationship between them. Secondly, a bi-level quantum evolutionary algorithm is provided for this model. One level is the coding of processes that determines the sequence of process. The other level is the coding of bidding enterprise that chooses each procedure of bidding enterprise. This scheduling approach in an ASP platform realizing dynamic alliance production scheduling system has been applied actually. And the approach can get faster convergence and better characteristics.

scholarly journals The Method of Production Scheduling with Uncertainties Using the Ants Colony Optimisation

2020 ◽  
Vol 11 (1) ◽  
pp. 171
Author(s):  
Iwona Paprocka ◽  
Damian Krenczyk ◽  
Anna Burduk
Keyword(s):  
Numerical Simulations ◽  
Production System ◽  
Production Scheduling ◽  
Flow Shop ◽  
Ant Colony Optimisation ◽  
Maintenance Costs ◽  
Machine Failure ◽  
Scheduling Method ◽  
Method Of Production ◽  
Flow Shop Systems

Production and maintenance tasks apply for access to the same resources. Maintenance-related machine downtime reduces productivity, but the costs incurred due to unplanned machine failures often outweigh the costs associated with predictive maintenance. Costs incurred due to unplanned machine failure include corrective maintenance, reworks, delays in deliveries, breaks in the work of employees and machines. Therefore, scheduling of production and maintenance tasks should be considered jointly. The problem of generating a predictive schedule with given constrains is considered. The objective of the paper is to develop a scheduling method that reflects the operation of the production system and nature of disturbances. The original value of the paper is the development of the method of a basic schedule generation with the application of the Ant Colony Optimisation. A predictive schedule is built by planning the technical inspection of the machine at time of the predicted failure-free time. The numerical simulations are performed for job/flow shop systems.

Sign in / Sign up

Export Citation Format

Share Document