Solving multi-objective master production schedule problem using memetic algorithm

Shireen S. Sadiq, Adnan Mohsin Abdulazeez, Habibollah Haron


A master production schedule (MPS) need find a good, perhaps optimal, plan for maximize service levels while minimizing inventory and resource usage. However, these are conflicting objectives and a tradeoff to reach acceptable values must be made. Therefore, several techniques have been proposed to perform optimization on production planning problems based on, for instance, linear and non-linear programming, dynamic-lot sizing and meta-heuristics. In particular, several meta- heuristics have been successfully used to solve MPS problems such as genetic algorithms (GA) and simulated annealing (SA). This paper proposes a memetic algorithm to solve multi-objective master production schedule (MOMPS). The proposed memetic algorithm combines the evolutionary operations of MA (such as mutation and Crossover) with local search operators (swap operator and inverse movement operator) to improve the solutions of MA and increase the diversity of the population). This algorithm has proved its efficiency in solving MOMPS problems compared with the genetic algorithm and simulated annealing. The results clearly showed the ability of the algorithm to evaluate properly how much, when and where extra capacities (overtime) are permitted so that the inventory can be lowered without influencing the level of service. 


Genetic algorithm; Master production schedule; Memetic algorithm; Multi-objective optimization; Simulated annealing

Full Text:




  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

shopify stats IJEECS visitor statistics