Hello KNIMERs,
Is it possible to solve assignment and transportation
problem with KNIME/KNIME Optimization extension?
Could I formulate additional limitations beside the limitations of the standard assignment/transportation problem?
For example in case of assignment problem: I have 3 workers (A B C), they have to fulfil 3 different tasks (1 2 3), they can complete the tasks with different cycle time. The objective function is to minimize the total cycle time, what was spent on the tasks.
Additional limitation: Worker B is able to fulfil only task “2”
Thank you in advance!
Roland