A forward algorithm for the capacitated lot size model with stockout
Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A framework for locally convergent random-search algorithms for discrete optimization via simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Computers & Mathematics with Applications
Finding preferred subsets of Pareto optimal solutions
Computational Optimization and Applications
Multi-objective inventory planning using MOPSO and TOPSIS
Expert Systems with Applications: An International Journal
Computers & Mathematics with Applications
Expert Systems with Applications: An International Journal
A hybrid intelligent system for multiobjective decision making problems
Computers and Industrial Engineering
Operations Research Letters
Combinatorial approximation algorithms: a comparative review
Operations Research Letters
Inventory replenishment model: lot sizing versus just-in-time delivery
Operations Research Letters
Characterization of Pareto dominance
Operations Research Letters
Computers and Electronics in Agriculture
Hi-index | 0.00 |
Real world production planning is involved in optimizing different objectives while considering a spectrum of parameters, decision variables, and constraints of the corresponding cases. This comes from the fact that production managers desire to utilize from an ideal production plan by considering a number of objectives over a set of technological constraints. This paper presents a new multi-objective production planning model which is proved to be NP-Complete. So a random search heuristic is proposed to explore the feasible solution space with the hope of finding the best solution in a reasonable time while extracting a set of Pareto-optimal solutions. Then each Pareto-optimal solution is considered as an alternative production plan in the hand of production manager. Both the modeling and the solution processes are carried out for a real world problem and the results are reported briefly. Also, performance of the proposed problem-specific heuristic is verified by comparing it with a multi-objective genetic algorithm on a set randomly generated test data.