A Partheno-genetic Algorithm for the Economic Lot Scheduling Problem under Power-of-Two Policy

摘要

The purpose of this paper is to investigate the use of partheno-genetic algorithm for the Economic Lot Scheduling Problem (ELSP) under Power-of-Two (PoT) policy. The ELSP is to find a feasible schedule that allows cyclic production pattern for each product and such that the sum of the setup and holding costs for all products per unit time is minimized, and, PoT policy requires the replenishment frequency of each item to be a PoT integer. Considering the complexity of this problem, we use improved genetic algorithm that is equipped with a partheno-genetic operators for solving this model. Numerical examples demonstrate that this improved partheno-genetic algorithm is an efficient approach in solving the ELSP under PoT policy.