L-Class Enumeration Algorithms for One Interval Production Planning Problem

L-class enumeration algorithms for a discrete production planning problem with interval resource quantities

“…However, such approach does not take into account the specific properties of the problem. It was shown that modifications of well-known algorithms developed specially for the interval problem can reduce computer time required for solving the problem [16,17]. Besides, the developed algorithms may be used as approximate algorithms for solving problem (1)- (4).…”

Application of uncertain variables to production planning in a class of manufacturing systems

“…A multi-product multi-period production planning problem is addressed in [8] where some cost coefficients in a performance index are assumed to be represented by fuzzy variables. The discrete version of a production planning problem with interval values of the resource quantities is investigated in [9]. The important feature of this approach consists in the fact that no other information about uncertainty is given besides of bounds of intervals.…”