A declarative decision support framework for scheduling groups of orders

This paper deals with declarative decision support framework for scheduling groups of orders. All orders in a group should be delivered at the same time after processing. The authors present a novel declarative approach to modeling and solving scheduling problems as a declarative decision support framework. The proposed framework makes it possible to ask different types of questions (general, specific, logical, etc.). It also allows, scheduling emerging orders or groups of orders without changing the existing schedules. To implement was used CLP (Constraint Logic Programming) environment. To increase the efficiency of the framework, particularly in the area of optimization made its integration with MP (Mathematical Programming) environment. The paper also presents the implementation of illustrative model, using the proposed framework. In addition, an efficiency analysis of the presented solution in relation to the application of mathematical programming have been conducted.