A DECLARATIVE APPROACH TO SHOP ORDERS OPTIMIZATION

Main Article Content

DOI

Jarosław WIKAREK

j.wikarek@tu.kielce.pl

Paweł SITEK

sitek@tu.kielce.pl

Mieczysław JAGODZIŃSKI

mieczyslaw.jagodzinski@polsl.pl

Abstract

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 optimization. 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 Programming, the constraints may be directly introduced to the problem declaration, 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 professional mathematical programming solver “LINGO”. The application of ECLiPSe-CLP in accessing data from relational databases has been presented.

Keywords:

MRP II, linear optimization, relational databases, ECLiPSe -CLP

References

Article Details

WIKAREK, J., SITEK, P., & JAGODZIŃSKI, M. (2019). A DECLARATIVE APPROACH TO SHOP ORDERS OPTIMIZATION. Applied Computer Science, 15(4), 5–15. https://doi.org/10.23743/acs-2019-25