Article Per Year (5 Year)
p-Index From 2019 - 2024
0.23
P-Index
This Author published in this journals
All Journal Jurnal Teknik Industri International Journal of Supply Chain Management Jurnal Telematika
Teguh Ersada Natail Sitepu
Institut Teknologi Harapan Bangsa
Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Electrical & Electronics Engineering Engineering Environmental Science Industrial & Manufacturing Engineering Transportation

Published : 3 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search
Journal : International Journal of Supply Chain Management

 1 
An Integrated Model for Lot Sizing with Supplier Selection Considering Quantity Discounts, Expiry Dates, and Budget Availability Teguh Ersada Natail Sitepu; Andi Cakravastia
International Journal of Supply Chain Management Vol 8, No 3 (2019): International Journal of Supply Chain Management (IJSCM)
Publisher : International Journal of Supply Chain Management

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

In this paper, a dynamic multi-product multi-period lot sizing with supplier selection problem (DLSSP) with quantity discount, expiry dates, and budget availability is presented. Demand of products for each period are independent and known. The cost consists of ordering, purchasing, transportation, expiry, holding, and interest charge. The objective is to find the optimal order quantity of all items in each period to minimize inventory cost. A mixed integer nonlinear model programming (MINLP) is first developed to model the problem. Since model is hard to solve using exact method, Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) is applied, in which design parameters are set using Taguchi method. Computational results demonstrate the applicability of the proposed model and comparing the results show efficiency of both algorithms as well. The results show that, while both algorithms have statistically similar performances, GA is the better algorithm in all problems.
Co-Authors Andi Cakravastia Ari Setiawan Ari Setiawan Malvin Hilmanto