| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 723797 | IFAC Proceedings Volumes | 2006 | 5 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
