A DECLARATIVE APPROACH TO SHOP ORDERS OPTIMIZATION

Print

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.

FULL TEXT

HOW TO CITE THIS PAPER

Wikarek, J., Sitek, P., & Jagodziński, M. (2019). A declarative approach to shop orders optimization. Applied Computer Science, 15(4), 5-15. doi:10.23743/acs-2019-25
Wikarek, Jarosław, Paweł Sitek, and Mieczysław Jagodziński. "A Declarative Approach to Shop Orders Optimization." Applied Computer Science 15, no. 4 (2019): 5-15.
J. Wikarek, P. Sitek, and M. Jagodziński, "A declarative approach to shop orders optimization," Applied Computer Science, vol. 15, no. 4, pp. 5-15, 2019, doi: 10.23743/acs-2019-25.
Wikarek J, Sitek P, Jagodziński M. A declarative approach to shop orders optimization. Applied Computer Science. 2019;15(4):5-15.