algorithm - To find an optimal solution for a dynamic programming issue -

right now, we're struggling how best design solution below problem:

you have funnel can take 3kgs of fruit. aim make fruit juice, following grades of each fruit. (grade non-unit number. can assume grade constant across each gram of juice) - apple: 5 banana: 0.5 oranges: 9

you making juice on hourly basis. grade of each fruit in juice can vary between +20% -20% of required grade every hour. however, end of day, final grades of fruit should not vary more 5% of required grade.

your input different mixed-fruit juices of anywhere between 400-500g. know grades of each fruit in each of these input juices. (assume mixture of banana, apple , orange.)

when input juice, can either put directly in funnel, or store in fridge later use. if store in fridge, need let warm 5 seconds before can use in juice.

your aim maximise number of input juices put directly in funnel while maintaining hourly , daily averages. main problem daily variance lower hourly variance.