The production time optimization study used the Campbell Dudek smith (CDS) algorithm in the production process scheduling aimed at makespan optimization for engine operation to produce 12-size pan products, 14-size griddle, 16-size griddle, 18-size griddle, and 20-size griddle. The method applied by the Campbell Dudek and Smith (CDS) algorithm, CDS is a method used in flowshop-type scheduling developed from Johnson's rule that is able to minimize makespan 2 machines arranged in series. The CDS method is very suitable for production characters who apply the machine sequence to the production process. CDS produces several iterations that have makespan values, from the few iterations the most minimum makespan value is obtained to determine the order of products to be produced. This research produces an application that can schedule products to be produced by the machine automatically. From the results of testing with a total production of 12 pieces on each product with repetitions of 6 times, the minimum makespan value is 210.12 minutes with a work order of 20, grid 18, griddle 16, griddle 14, and griddle 12. Accuracy of results Application testing showed 99.99% for the first time and 99.96% for the second time when compared to manual calculations.

Research has been carried out by developing an optimization information system for scheduling production machines by applying the Android-based GUPTA method. This android-based application is able to optimize production time, because in the android application it implements the GUPTA algorithm which uses the calculation of the comparative processing time on every machine in the company by prioritizing the smallest processing time for scheduling which aims to optimize production scheduling time, by paying attention to the value of makespan to produce product size 12 griddle, size 14 griddle, 16 size griddle, 18 size griddle and 20 size griddle so that an optimal makespan value is obtained. The GUPTA method can be used in problems with more than two machines, because this method combines the time of each process on the first and subsequent machines to find the minimum value and can only be used in pure flow shop scheduling. The advantage of this method is that it determines scheduling only on one machine group. This research resulted in an Android-based application that can schedule products to be produced by machines automatically. From the results of testing with a total of 12 pieces of production in each product with a total of 5 different sizes, the minimum value of makespan is obtained, namely 2054569 minutes with the sequence of product processing with work order 12 griddle, griddle 18, griddle 20, griddle 16, and griddle 14 The accuracy of the application test results shows 98.87% for the first time and 98.84% for the second time when compared with manual calculations.

Abstrak – Penelitian optimalisasi waktu produksi menggunakan algoritma campbell dudek smith (CDS) pada penjadwalan proses produksi bertujuan untuk optimasi makespan untuk pengoperasian mesin untuk memproduksi produk wajan ukuran 12, wajan ukuran 14, wajan ukuran 16, wajan ukuran 18 dan wajan ukuran 20 sehingga didapat nilai makespan yang optimal. Metode yang diterapkan algoritma Campbell Dudek and Smith (CDS), CDS merupakan metode yang digunakan dalam penjadwalan bersifat flowshop dikembangkan dari aturan Johnson yang mampu meminimalkan makespan 2 mesin yang disusun seri. Metode CDS sangat cocok pada karakter produksi yang menerapkan urutan mesin untuk proses produksi. CDS menghasilkan beberapa iterasi yang memiliki nilai makespan, dari beberapa iterasi tersebut didapat nilai makespan yang paling minimal untuk menentukan urutan produk yang akan diproduksi. Penelitian ini menghasilakan aplikasi yang dapat menjadwalkan produk yang akan diproduksi oleh mesin secara otomatis. Dari hasil pengujian dengan jumlah produksi 12 buah pada setiap produk dengan perulangan sebanyak 6 kali, maka didapatkan nilai makespan paling minimal yaitu 210,12 menit dengan urutan pengerjaan produk wajan 20, wajan 18, wajan 16, wajan 14, dan wajan 12. Akurasi hasil pengujian aplikasi menunjukkan 99,99% untuk waktu pertama dan 99,96% untuk waktu kedua jika dibandingkan dengan perhitungan manual.

Ten sub-districts in Jombang, Indonesia, namely jombang downtown, Bareng, Wonosalam, Mojoagung, Mojowarno, Ploso,Kudu, Bandarkedungmulyo, Sumobito dan kesamben experience the impact of natural disasters of floods and landslides each year. All of these sub-districts consists of 32 villages. Disasters that become an annual routine, namely floods and landslides, make residents suffer moral and material losses. The Regional Disaster Management Agency (BPBD) is the main actor in helping this disaster such as donors who want to help the victims of natural disasters is accommodated by BPBD with the aim of equitable distribution of aid and on target. However, the practice in the field encountered obstacles namely not finding the shortest track from the location of the natural disaster to be visited in accordance with the track and logistics needs at the disaster site. The Ant Colony Optimization (ACO) algorithm is used by researchers to solve the problems encountered by Jombang BPBD. There are 6 iterations in implementing this algorithm. ACO algorithm test outcomes to find the track in the distribution of logistics to the disaster location that obtained the value of the number of ants 10, the initial pheromone of 0.117 from C greedy obtained 85,5 and the distance obtained from the google map. With the ACO algorithm found 3 alternatives for logistics distribution tracks in natural disaster areas in Jombang.

Research on optimizing production time using the dudek smith campbell algorithm (CDS) in scheduling the production process aims to makepan optimization for machine operations to produce 12 size griddle products, 14 griddle sizes, 16 griddle sizes, 18 griddle sizes and 20 griddle sizes to get the makepan values. optimal. The method applied by the Campbell Dudek and Smith (CDS) algorithm, CDS is a method used in flowshop scheduling developed from Johnson's rule which is able to minimize the makespan of 2 machines arranged in series. The CDS method is very suitable for production characters who apply machine sequences to the production process. CDS produces several iterations that have the value of makespan, from those iterations, the minimum value of makespan is to determine the order of products to be produced. This research resulted in an application that can schedule products to be produced by machines automatically. From the test results with a total production of 12 pieces on each product with 6 repetitions, the minimum value of makespan is 210.12 minutes with a sequence of product works 20 pans, 18 pans, 16 pans, 14 pans, and 12 pans. Accuracy of results Application testing shows 99.99% for the first time and 99.96% for the second time when compared to manual calculations