Show simple item record

dc.contributor.advisorSawaluddin
dc.contributor.authorLestari, Bella
dc.date.accessioned2024-09-10T09:25:42Z
dc.date.available2024-09-10T09:25:42Z
dc.date.issued2024
dc.identifier.urihttps://repositori.usu.ac.id/handle/123456789/97092
dc.description.abstractDynamic programming is a mathematical technique for optimizing decisions in stages by breaking a problem inton stages mthat solve recursively. It display the quantity and arrangement of invemtory to maintain production and ,businness revenue efficiently when used in inventory control management. This production planning uses a dynamic programming method based on the results of advanced calculations start from stage 1 and move forward to stage 12. the dynamic programming approach in this writing is deterministic because the pattern of the number of requests for bread is known absolutely. Decisions involving a problem are simplified little by little rather than directly. This research uses linear regression with a mathematical formula that is: y=a +bx followed by the defect percetage formula pn=fn1-p to forecast demand for the next 12 months and apply a dynamic program to achieve the minimum total quantity.en_US
dc.language.isoiden_US
dc.publisherUniversitas Sumatera Utaraen_US
dc.subjectSDGs
dc.titlePenerapan Program Dinamik untuk Mengoptimalkan Total Biaya dalam Perencanaan Produksi dan Pengendalian Persediaanen_US
dc.title.alternativeApplication of Dynamic Programming to Optimization of Total Cost in Production Planning and Inventory Controlen_US
dc.typeThesisen_US
dc.identifier.nimNIM180803089
dc.identifier.nidnNIDN0031125982
dc.identifier.kodeprodiKODEPRODI44201#Matematika
dc.description.pages74 Pagesen_US
dc.description.typeSkripsi Sarjanaen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record