Improved heuristic algorithm for modern industrial production scheduling

Jiang, Yongqing; Pan, Fusheng

doi:10.1109/icmic.2017.8321617

Cited by 3 publications

(2 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Tujuan dari penjadwalan adalah untuk mengatur tugas produksi ke perangkat dalam suatu proses, Karena penjadwalan memiliki banyak proses, banyak stasiun, banyak kendala dan aturan. Penjadwalan produksi sangat penting pada perusahaan yang menggunakan sistem make to order, dimana produk baru akan diproduksi sesuai permintaan dari konsumen (Yongqing & Fucheng, 2017).…”

Section: Kerangka Teoriunclassified

Penerapan Algoritma Campbell Dudek Smith (CDS) untuk Optimasi Waktu Produksi Pada Penjadwalan Produksi

Mashuri¹,

Mujianto²,

Sucipto³

et al. 2020

J. Sistem Info. Bisnis

View full text Add to dashboard Cite

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

show abstract

Section: Kerangka Teoriunclassified

Penerapan Algoritma Campbell Dudek Smith (CDS) untuk Optimasi Waktu Produksi Pada Penjadwalan Produksi

Mashuri¹,

Mujianto²,

Sucipto³

et al. 2020

J. Sistem Info. Bisnis

View full text Add to dashboard Cite

show abstract

“…The purpose of scheduling is to arrange production tasks to devices in a process because scheduling has many processes, many stations, many obstacles, and rules. Production scheduling is very important for companies that use the make to order system, where new products will be produced at the request of consumers [1].…”

Section: Introductionmentioning

confidence: 99%

Production Time Optimization using Campbell Dudek Smith (CDS) Algorithm for Production Scheduling

Mashuri¹,

Mujianto²,

Sucipto³

et al. 2019

E3S Web Conf.

View full text Add to dashboard Cite

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.

show abstract

Solving Injection Molding Production Cost Problem Based on Combined Group Role Assignment with Costs

Teng,

Chen,

Teng

et al. 2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Improved heuristic algorithm for modern industrial production scheduling

Cited by 3 publications

References 8 publications

Penerapan Algoritma Campbell Dudek Smith (CDS) untuk Optimasi Waktu Produksi Pada Penjadwalan Produksi

Penerapan Algoritma Campbell Dudek Smith (CDS) untuk Optimasi Waktu Produksi Pada Penjadwalan Produksi

Production Time Optimization using Campbell Dudek Smith (CDS) Algorithm for Production Scheduling

Solving Injection Molding Production Cost Problem Based on Combined Group Role Assignment with Costs

Contact Info

Product

Resources

About