Genetic Algorithm for Solving a Just-In-time Inventory Model With Imperfect Rework Implemented in a Serial Multi-echelon System

0Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

As global industrial competition intensifies, enterprises can achieve substantial competitive advantages in the supply chain management environment by promptly meeting customer demands and efficiently reducing both supply and demand costs. This paper proposes an inventory model for supply chain optimization that considers uncertain delivery lead times and defective products. Solving the model requires solving a nonlinear mixed-integer problem, which traditionally requires considerable time. Solutions to nondeterministic polynomial-time hard problems with high complexity and difficulty are often obtained using heuristic algorithms. Among these algorithms, genetic algorithms have high efficiency and quality. Therefore, we employed a genetic algorithm to solve the proposed model.

Cite

CITATION STYLE

APA

Tsao, H. C., Chung, C. C., Lee, H. S., Lin, C. P., Tu, Y. Y., & Lin, S. C. (2023). Genetic Algorithm for Solving a Just-In-time Inventory Model With Imperfect Rework Implemented in a Serial Multi-echelon System. Journal of Marine Science and Technology (Taiwan), 31(4), 383–402. https://doi.org/10.51400/2709-6998.2712

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free