scholarly journals Analisis Penjadwalan Produksi Berdasarkan Pesanan Menggunakan Metode Asas Prioritas pada CV Davero Cemerlang Indonesia Surabaya

2021 ◽  
Vol 4 (2) ◽  
pp. 380-396
Author(s):  
Moh. Fahrul Faris ◽  
Wiwik Handayani
Keyword(s):  
Production Scheduling ◽  
Processing Time ◽  
Point Of View ◽  
Scheduling Problems ◽  
Order Fulfillment ◽  
Order Scheduling ◽  
Average Delay ◽  
Maximum Utility ◽  
Scheduling Method ◽  
Rule System

The purpose of this study was to determine the most efficient order scheduling technique on CV. Davero Jaya Shining Indonesia to reduce delays in order fulfillment. The suggested scheduling approach is based on a priority rule system that includes the following criteria: first come, first served, lowest processing time, longest processing time, and earliest due date (first come first served). Davero Jaya Cemerlang Indonesia uses the SPT technique in its manufacturing process, according to their company CV. The company decided to adopt this technique because it seemed reasonable from a consumer's point of view. The downside of this technique is that it often causes delays in completing client orders. Based on the results of data analysis and debates that have been given, the FCFS technique is the most superior method among others. Considering the fact that the findings of the FCFS method effectiveness measure are consistent with the current criteria, which include minimum average completion scores, maximum utility, minimum average delay, and minimum average labor force in the system. Therefore, the researchers gave suggestions to the company CV. Davero Jaya Cemerlang Indonesia to use the FCFS method as an alternative production scheduling method. With the application of the FCFS method in CV. Davero Jaya Cemerlang Indonesia is expected to be able to help resolve production scheduling problems that have been happening so far. So that the problem of delays in completing orders can be minimized. Keywords: Scheduling, Gantt Chart, Priority Principles and CV. Davero Jaya Cemerlang Indonesia

scholarly journals PENJADWALAN PRODUKSI DENGAN ALGORITMA HEURISTIK POUR (STUDI KASUS: KONVEKSI ONE WAY – MALANG)

2014 ◽  
Vol 15 (1) ◽  
pp. 35 ◽  
Author(s):  
ANDRI SULAKSMI ◽  
ANNISA KESY GARSIDE ◽  
FITHRIANY HADZIQAH
Keyword(s):  
Heuristic Algorithm ◽  
Production Scheduling ◽  
Completion Time ◽  
Heuristic Method ◽  
Process Time ◽  
Order Fulfillment ◽  
Order Scheduling ◽  
Total Process ◽  
First Come First Serve

PENJADWALAN PRODUKSI DENGAN ALGORITMAHEURISTIK POUR (STUDI KASUS: KONVEKSI ONE WAY –MALANG)ANDRI SULAKSMI, ANNISA KESY GARSIDE*, DAN FITHRIANY HADZIQAHJurusan Teknik Industri, Fakultas Teknik, Universitas Muhammadiyah MalangJl. Raya Tlogomas 246, Malang, Jawa Timur 65144Email: [email protected], [email protected], [email protected] One Way memproduksi berbagai jenis kaos berdasarkan order yang datang dari konsumen.Dalam memenuhi order tersebut, perusahaan menggunakan aturan First Come First Serve dalammenjadwalkan urutan pengerjaan ordernya. Aturan ini sering tidak menguntungkan bagi order yangmembutuhkan waktu proses yang pendek karena apabila order tersebut berada di belakang antrian makaharus menunggu yang lama sebelum diproses dan menyebabkan waktu penyelesaian seluruh order menjadilebih panjang. Penelitian ini bertujuan untuk menjadwalkan urutan pengerjaan kaos di konveksi OneWay dengan menggunakan algoritma heuristik Pour sehingga waktu penyelesaian menjadi lebih singkatdan order kaos bisa selesai tepat waktu. Tahapan-tahapan penelitian terdiri dari pengumpulan data,perhitungan waktu standar, perhitungan total waktu proses berdasarkan order, penjadwalan denganmetode awal perusahaan, penjadwalan dengan metode heuristik pour, dan perbandingan makespan antarakedua metode. Berdasarkan hasil penjadwalan menggunakan heuristik Pour diperoleh penghematanmakespan sebesar 8,09 jam atau 19,25% dibanding makespan dengan metode perusahaan saat ini.Kata kunci: penjadwalan produksi, first come first serve, heuristik pour, makespanABSTRACT“One Way Convection” is a garment company which produces many kinds of t-shirt based on thecustomer’s order. In order to fulfill the order, the company applies role of First-Come First-Serve forscheduling the order production sequence. This role is often disadvantageous for the order with shortprocess time because if it is dispatched after the order with long process time, then it will take longer in queueand causes the completion time of all order to be longer. This research aims to schedule t-shirt’s sequenceoperation in “One Way Convection” company by using Pour heuristic algorithm so that completion timebecomes shorter and order fulfillment can be accomplished on-time. The steps in this methodology consistof collecting data, calculating standard time and total process time according to the order, scheduling usinginitial method proposed by company, scheduling using Pour heuristic algorithm, and comparing makespanof both approaches. According to the Pour Heuristic method, saving is obtained in makespan as 8.09 hoursor 19.25% compared with initial method proposed by company.Key words: production scheduling, first come first serve, pour heuristic, makespan

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.

The Advanced Production Planning of Automated Scheduling Problems in Irradiation Industry

2010 ◽  
Vol 139-141 ◽  
pp. 1688-1691
Author(s):  
Zhong Wang ◽  
Gang Zhang ◽  
Guo Wei Zhao
Keyword(s):  
Production Planning ◽  
Production Scheduling ◽  
Production Efficiency ◽  
Research Field ◽  
Scheduling Problems ◽  
Planning And Scheduling ◽  
Shop Scheduling ◽  
Complex Processes ◽  
Scheduling Method ◽  
Advanced Production

Because of the continuity and discreteness during production, Irradiation industry becomes one of an especial industry. Various product type, uncertain lots and complex processes cycle increase the difficulty of production planning and scheduling. The implementation of CIMS/ERP systems during product processes in the enterprise can not fulfill the special requirements especially in product automation monitoring and quality information monitoring. Research and application of scheduling method and optimization technology effect crucially for enterprise to improve its production efficiency and reduce its production cost. So, more and more scholars pay their attention to this research field. For this reason, the paper presents a mathematical production scheduling model in irradiation workshop based on the research of irradiation industry development and shop scheduling in China and abroad. The author also design an application of the irradiation shop scheduling Optimization with this model in detailed, based on described the concept, principle of genetic algorithm and its method.

Using Electronic Data Interchange (EDI) to Improve the Efficiency of Accounting Transactions

2002 ◽  
Vol 77 (4) ◽  
pp. 703-729 ◽  
Author(s):  
Shannon W. Anderson ◽  
William N. Lanen
Keyword(s):  
Information Technology ◽  
Processing Time ◽  
Electronic Data Interchange ◽  
Order Scheduling ◽  
Negative Effects ◽  
Electronic Data ◽  
Order Processing ◽  
Data Interchange ◽  
Using Data ◽  
Office Furniture

Electronic data interchange (EDI) is an information technology that standardizes the exchange of information between transacting parties. Using data from a major U.S. office furniture manufacturer that adopted EDI primarily to improve the efficiency of accounting transactions, we evaluate whether EDI reduces order-processing time (the time from sales order receipt to sales order scheduling) and whether this improvement is greater for more complex orders. Our measure of complexity reflects both the mix of different products the dealer orders as well as features and options the dealer selects for each product in the order. We find that EDI is associated with faster order processing, independent of complexity, and that EDI mitigates most of the negative effects of complexity on processing time. We also find that dealers learn to submit error-free orders to the manufacturer, and that previous errors provide feedback that helps dealers submit more accurate orders. However, we find only mixed evidence that order complexity impedes learning.

Research on Production Scheduling Method and the Application in Switch Machine Production Enterprise

2012 ◽  
Vol 190-191 ◽  
pp. 156-159
Author(s):  
Jian Qing Chen
Keyword(s):  
Production Scheduling ◽  
Product Configuration ◽  
Production Schedule ◽  
Material Requirements Planning ◽  
Enterprise Informatization ◽  
Order Processing ◽  
Master Production Scheduling ◽  
Sales Forecasts ◽  
Planning Methods ◽  
Scheduling Method

This paper is under the research background of a switch machine production enterprise informatization projects, and the production schedule is mainly based on customer orders and sales forecasts. This paper mainly studies the combination of similar order processing sheets according to the similarity of types and specifications of products in an order processing sheet, and the experience of master production scheduling personnel, to generate the master production scheduling methods and techniques. Finally, studies the material requirements planning methods based on nested components, focusing on the configuration of parts and components of such products in the product configuration.

Production Scheduling Method to Reduce Fuel Costs of Hot Rolling Processes

2020 ◽  
Vol 2020 (0) ◽  
pp. S14202
Author(s):  
Takeru DOAN ◽  
Satoshi NAGAHARA ◽  
Takafumi CHIDA ◽  
Junichi KATSUBE ◽  
Tooru ADACHI ◽  
...  
Keyword(s):  
Hot Rolling ◽  
Production Scheduling ◽  
Scheduling Method ◽  
Fuel Costs

scholarly journals Semi-Online Scheduling on Two Machines withGoSLevels and Partial Information of Processing Time

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Taibo Luo ◽  
Yinfeng Xu
Keyword(s):  
Processing Time ◽  
Parallel Machines ◽  
Partial Information ◽  
Online Scheduling ◽  
Scheduling Problems ◽  
Total Processing Time ◽  
Grade Of Service ◽  
Two Machines

This paper investigates semi-online scheduling problems on two parallel machines under a grade of service (GoS) provision subject to minimize the makespan. We consider three different semi-online versions with knowing the total processing time of the jobs with higherGoSlevel, knowing the total processing time of the jobs with lowerGoSlevel, or knowing both in advance. Respectively, for the three semi-online versions, we develop algorithms with competitive ratios of3/2,20/13, and4/3which are shown to be optimal.

scholarly journals Realtime production scheduling and control systems in smart industry

Impact ◽  
2020 ◽  
Vol 2020 (8) ◽  
pp. 60-61
Author(s):  
Wei Weng
Keyword(s):  
Control Systems ◽  
Real Time ◽  
Production Scheduling ◽  
Production Control ◽  
Optimal Solution ◽  
Scheduling Problem ◽  
Optimal Solutions ◽  
Scheduling Problems ◽  
Smart Industry ◽  
And Control

For a production system, 'scheduling' aims to find out which machine/worker processes which job at what time to produce the best result for user-set objectives, such as minimising the total cost. Finding the optimal solution to a large scheduling problem, however, is extremely time consuming due to the high complexity. To reduce this time to one instance, Dr Wei Weng, from the Institute of Liberal Arts and Science, Kanazawa University in Japan, is leading research projects on developing online scheduling and control systems that provide near-optimal solutions in real time, even for large production systems. In her system, a large scheduling problem will be solved as distributed small problems and information of jobs and machines is collected online to provide results instantly. This will bring two big changes: 1. Large scheduling problems, for which it tends to take days to reach the optimal solution, will be solved instantly by reaching near-optimal solutions; 2. Rescheduling, which is still difficult to be made in real time by optimization algorithms, will be completed instantly in case some urgent jobs arrive or some scheduled jobs need to be changed or cancelled during production. The projects have great potential in raising efficiency of scheduling and production control in future smart industry and enabling achieving lower costs, higher productivity and better customer service.

Sign in / Sign up

Export Citation Format

Share Document