Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Heuristic

PERBANDINGAN MODEL LOT SIZING BERBASIS MATERIAL REQUIREMENT PLANNING UNTUK MENGOPTIMALKAN BIAYA PERSEDIAN Widodo, Dian Setiya
Heuristic Vol 15 No 02 (2018)
Publisher : Fakultas Teknik Universitas 17 Agustus 1945 Surabaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30996/he.v15i02.2138

Abstract

Persediaan menjadi sangat penting untuk melancarkan aktivitas proses produksi. Artikel ini bertujuan untuk menentukan lot sizing optimal dengan meminimalkan biaya persediaan. Untuk mendapatkan lot sizing optimal dengan membandingkan model lot sizing menggunakan Lot For Lot, Economic Order Quantity, Period Order Quantity  dan Algorithm Wagner Within berbasis Material Requirement Planning untuk mendapatkan biaya persediaan minimal. Dari hasil perhitungan dengan membandingkan model-model lot sizing Lot For Lot, Economic Order Quantity, Period Order Quantity dan Algorithm Wagner Within, ditunjukkan bahwa Algorithm Wagner Within memberikan  total  biaya persediaan  lebih minimal dengan  biaya perediaannya  sebesar  Rp. 927,600. dibandingkan teknik lot sizing lainnya.Kata kunci: Biaya Persediaan, Lot sizing, MRP
PENJADWALAN FLOW SHOP DENGAN PENDEKATAN CROSS ENTROPY-GENETIC ALGORITHM UNTUK MENURUNKAN MAKESPAN PADA PEMBUATAN RODA GIGI Widodo, Dian Setiya; Ellianto, Mario Sarisky Dwi
Heuristic Vol 12 No 02 (2015)
Publisher : Fakultas Teknik Universitas 17 Agustus 1945 Surabaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30996/he.v12i02.629

Abstract

Flow shop is the process of determining the sequence of jobs that have the same product path. While the flow-shop scheduling takes assumption that a number of jobs that each has the same machine work sequence. The problems faced by com-panies, namely the high demand and yet the existence of a good scheduling planning resulted in the company should be able to optimize sche-duling job. One of the ways to solve these problems is by minimizing the Makespan. This research will solve the problem regarding to the flow shop scheduling by using cross entropy-genetic algorithm (CEGA) method to minimize Makespan. The technique that is used to solve the problem is by comparing the result of the application of existing methods in the company with the proposed method (CEGA). To support the application of CEGA used MATLAB software. Finally known that the results CEGA can give optimal solution, Makespan values obtained for 10829 seconds. So far, it was more effective than the method that used at the firm with Makespan efficiency by 10.06%.Keywords: Flow Shop, Scheduling, Cross Entropy-Genetic Algorithm, Makespan.