Real life multi-product multi-period production planning often deals with several conflicting objectives while considering a set of technological constraints. The solutions of these problems can provide deeper insights to the decision makers/managers than those of single-objective problems. Some managers want to use from a production plan that is corresponding to minimum change in production policy along with minimum total cost simultaneously as possible. On the other hand, these two objectives have intrinsic conflicts such that producing in a fixed rate will cause huge costs than producing economically or according to JIT. So this paper presents a novel multi-objective model for the production smoothing problem on a single stage facility that some of the operating times could be determined in a time interval for. The model is to: (a) smooth the variations of production volume, and (b) minimize total cost of the corresponding production plan, while satisfying a set of technological constraints such as limited available time. The proposed model is developed in a real case study and is solved by a new genetic algorithm. The proposed genetic algorithm uses a novel achievement function for exploring the solution space, based on LP-metric concepts. Computational experiences reveal the sufficiency and efficiency of the proposed approach in contrast to previous researches. © 2011 Elsevier Inc.
Karimi-Nasab, M., & Aryanezhad, M. B. (2011). A multi-objective production smoothing model with compressible operating times. Applied Mathematical Modelling, 35(7), 3596–3610. https://doi.org/10.1016/j.apm.2011.01.038