English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

PT. XYZ is a manufacturing company that produces plastic and joly cups based on customer orders (job orders). The clear plastic cup product is the company's flagship product because it is always ordered by customers in large quantities. The company implements production scheduling according to the order of the jobs on the order, where every first job that comes must be completed first from another job (which has the same deadline for processing). This has an impact on late delivery of products to consumers. To avoid delays in product shipments, it is necessary to schedule production at the company to minimize product turnaround time (makespan). This study uses a Simulated Annealing Algorithm. Simulated Annealing algorithm is a type of heuristic method because it has a great potential to solve the optimization problem, where the parameters used are initial temperature (Ti) of 2000C, reduction of temperature factor (s) of 0.95, the number of iterations by 15 times. The initial solution to the Simulated Annealing Algorithm uses the First Come First Served method. From the results of the study, the makepan produced on the First Come First Served method was 24568.75 minutes, while the Simulated Annealing Algorithm method was 20149.89 minutes. It can be seen that by using the proposed method, there is a reduction in makespan of 4418.86 minutes = 75.65 hours = 3.06 days. So that job scheduling can be fulfilled on time and there are no delays from the due date set at 14 days. So it can be concluded that the Simulated Annealing Algorithm is more effective than the First Come First Served method

Penjadwalan Produksi dengan Menggunakan Algoritma Simulated Annealing di PT. XYZ