L-CLASS ENUMERATION ALGORITHMS FOR ONE INTERVAL PRODUCTION PLANNING PROBLEM

A discrete production planning problem with interval input data is considered. An approach for solving this problem based on using its relaxation set is suggested. Some L-class enumeration algorithms for the problem are described. Results of computational experiments are presented.