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

Minimizing Completion Time for Order Scheduling: Formulation and Heuristic Algorithm

2017 ◽  
Vol 14 (4) ◽  
pp. 1558-1569 ◽  
Author(s):  
Zhongshun Shi ◽  
Longfei Wang ◽  
Pai Liu ◽  
Leyuan Shi
Keyword(s):  
Heuristic Algorithm ◽  
Completion Time ◽  
Order Scheduling

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 Optimization of Pipe Production Scheduling in Line 18 Using First Come First Serve (Fcfs), Earlier Due Date (Edd), Short Process Time (Spt) Methods (Case Study: Pt Wtur)

2021 ◽  
Vol 3 (2) ◽  
pp. 44-54
Author(s):  
Mohamad Rizal Fadli ◽  
Wiwik Sulistiyowati
Keyword(s):  
Production Scheduling ◽  
Consumer Demand ◽  
Item Type ◽  
Process Time ◽  
Pipe Production ◽  
Due Date ◽  
Optimal Method ◽  
Average Completion Time ◽  
First Come First Serve ◽  
The Impact

For machine line 18, is intended to produce PVC pipe with a 5 ", 6" and 8 "with each contained item type AW and type D with a turn of the cycle a certain schedule. From the turn of this cycle, there are a couple of the impact is too long good finish duration of vacant stock in the Warehouse Production (GHP) pipe. The impact of the long duration of the good stock of empty finish unachieved impact on consumer demand (in this case the agent). By not reaching the consumer demand impact on service level SCM & Delivery. The purpose of this study to determine the optimal level of machine line 18 so that the products PVC size 5 ", 6" and 8 "are produced to meet the buffer stock storage. Thus, this research is expected to make a production schedule to meet the stock warehouse to the fullest, can meet the needs of consumers (agent) to the maximum but not over. From the data and data analysis using the First Come First Serve (FCFS), Earlier Due Date (EDD), Short Process Time (SPT), the SPT method is the most optimal method by having an average completion time of 4,10 days with 36,75% utility, then the average number of jobs 2,77 work, and delays the average occupation is 0,42 days.

scholarly journals Towards 6G IoT: Tracing Mobile Sensor Nodes with Deep Learning Clustering in UAV Networks

Sensors ◽  
2021 ◽  
Vol 21 (11) ◽  
pp. 3936
Author(s):  
Yannis Spyridis ◽  
Thomas Lagkas ◽  
Panagiotis Sarigiannidis ◽  
Vasileios Argyriou ◽  
Antonios Sarigiannidis ◽  
...  
Keyword(s):  
Deep Learning ◽  
Heuristic Method ◽  
Sensor Nodes ◽  
Convolutional Network ◽  
Received Signal Strength Indicator ◽  
Anchor Nodes ◽  
Time Required ◽  
Rf Signal ◽  
Deep Learning Model

Unmanned aerial vehicles (UAVs) in the role of flying anchor nodes have been proposed to assist the localisation of terrestrial Internet of Things (IoT) sensors and provide relay services in the context of the upcoming 6G networks. This paper considered the objective of tracing a mobile IoT device of unknown location, using a group of UAVs that were equipped with received signal strength indicator (RSSI) sensors. The UAVs employed measurements of the target’s radio frequency (RF) signal power to approach the target as quickly as possible. A deep learning model performed clustering in the UAV network at regular intervals, based on a graph convolutional network (GCN) architecture, which utilised information about the RSSI and the UAV positions. The number of clusters was determined dynamically at each instant using a heuristic method, and the partitions were determined by optimising an RSSI loss function. The proposed algorithm retained the clusters that approached the RF source more effectively, removing the rest of the UAVs, which returned to the base. Simulation experiments demonstrated the improvement of this method compared to a previous deterministic approach, in terms of the time required to reach the target and the total distance covered by the UAVs.

The Research of Heuristic Algorithm for Flow Shop Scheduling Problem

2012 ◽  
Vol 605-607 ◽  
pp. 528-531
Author(s):  
Dan Tang ◽  
Hong Ping Shu
Keyword(s):  
Heuristic Algorithm ◽  
Processing Time ◽  
Flow Shop ◽  
Heuristic Method ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Average Quality ◽  
Simulation Experiments ◽  
Shop Scheduling ◽  
Better Than

For the flow shop scheduling problem which aims to minimize makespan, this paper gives a new derivation about its mathematical definition, and mining characteristics of the problem itself further. By which analysis, the new heuristic method proposed in the paper shorten the waiting time of each job as much as possible on the basis of reduce the processing time of the first machine and last job. The result of simulation experiments shows that, our new heuristic algorithm has good performance, and the average quality and stability of scheduling sequences generated by new method is significantly better than other heuristic algorithm which has the same complexity.

scholarly journals Customer order scheduling with job-based processing on a single-machine to minimize the total completion time

2021 ◽  
Vol 12 (3) ◽  
pp. 273-292 ◽  
Author(s):  
Ferda Can Çetinkaya ◽  
Pınar Yeloğlu ◽  
Hale Akkocaoğlu Çatmakaş
Keyword(s):  
Completion Time ◽  
Numerical Control ◽  
Total Completion Time ◽  
Mixed Integer ◽  
Order Scheduling ◽  
Customer Order ◽  
Processing Approach ◽  
Problem Instances ◽  
Customer Order Scheduling ◽  
Customer Orders

This study considers a customer order scheduling (COS) problem in which each customer requests a variety of products (jobs) processed on a single flexible machine, such as the computer numerical control (CNC) machine. A sequence-independent setup for the machine is needed before processing each product. All products in a customer order are delivered to the customer when they are processed. The product ordered by a customer and completed as the last product in the order defines the customer order’s completion time. We aim to find the optimal schedule of the customer orders and the products to minimize the customer orders’ total completion time. We have studied this customer order scheduling problem with a job-based processing approach in which the same products from different customer orders form a product lot and are processed successively without being intermingled with other products. We have developed two mixed-integer linear programming models capable of solving the small and medium-sized problem instances optimally and a heuristic algorithm for large-sized problem instances. Our empirical study results show that our proposed tabu search algorithm provides optimal or near-optimal solutions in a very short time. We have also compared the job-based and order-based processing approaches for both setup and no-setup cases and observed that the job-based processing approach yields better results when jobs have setup times.

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 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 Branch and Bound Method to Solve Multi Objectives Function

2016 ◽  
Vol 12 (3) ◽  
pp. 5964-5974
Author(s):  
Tahani Jabbar Kahribt ◽  
Mohammed Kadhim Al- Zuwaini
Keyword(s):  
Lower Bounds ◽  
Branch And Bound ◽  
Single Machine ◽  
Upper Bound ◽  
Completion Time ◽  
Heuristic Method ◽  
Total Weighted Completion Time ◽  
Branch And Bound Method ◽  
Special Cases ◽  
Weighted Completion Time

This paper  presents  a  branch  and  bound  algorithm  for  sequencing  a  set  of  n independent  jobs  on  a single  machine  to  minimize sum of the discounted total weighted completion time and maximum lateness,  this problems is NP-hard. Two lower bounds were proposed and heuristic method to get an upper bound. Some special cases were  proved and some dominance rules were suggested and proved, the problem solved with up to 50 jobs.

Sign in / Sign up

Export Citation Format

Share Document