A DECLARATIVE APPROACH TO SHOP ORDERS OPTIMIZATION

The paper presents the problem of material requirements planning with optimization of load distribution between work centers and workers’ groups. Moreover, it discusses the computational example for shop orders opti-mization. The data for this example were taken from the relational database. The method of Constraint Logic Programming (CLP) for shop orders optimization has been suggested. Using Constraint Logic Program-ming, the constraints may be directly introduced to the problem declara-tion, which is equivalent to the source code of the program. The ECLiPSe-CLP software system has been presented. It allows for solving optimization problems concerning dimensions greater than in the case of the profes-sional mathematical programming solver “LINGO”. The application of ECLⁱPS^e-CLP in accessing data from relational databases has been presented.