Given an an table that contains products I am selling with the dates, and given a table that contains the possible work orders with each work order, arrange the work orders such that all items are filled. (assume a starting stock of 0)
What I can produce per day:
The efficiency of the solution can be judged by the standard deviation of the stock quantity.
For example if I have 100 of Item1 and 0 of Item2 the solution is inefficient. If I have 50 of each the solution is optimal.
I can't think of a way to calculate it other than to iterate through all possible configurations, leaving me with a runtime on $n!$