Taking as many items from an ordered list as necessary to sum to a value

[BenBl]

Hey all,

I have a list of orders sorted by priority. Each order has a list of associated tasks sorted by step sequence. Each task has a duration.

e.g.

Order 1 priority 3:
Step 1) Unclamp 25 pieces. - 1 hour
Step 2) Mask 25 pieces. - 3 hours
step 3) Paint 25 pieces - 2 hours

Order 2 priority 2:
Step 1) Unclamp 13pieces. - .5 hour
Step 2) Mask 13 pieces. - 1.5 hours
step 3) Paint 13 pieces - 1 hours

Order 3 priority 1:
Step 1) Heat 60 pieces - 1.5 hours
Step 2) Package 60 pieces - 5 hours.

I want to pick all the tasks that sum to less than an amount of person-hours. For example, say I want to schedule 11 person hours for tomorrow.

Start at the highest priority, and add as many steps as possible to a total of less than 11 hours.

O3 S1 (1.5 hours), 03 S2 (5 hours), O2 S1 (0.5 hours), O2 S2 (1.5 hours), O2 S3 (1 hour), O1 S1 (1 hour) STOP. (We can’t add O1 S2 without going above 11 hours).

How do you recommend doing this? Do I need to use a Steve-recursive actions hack or is there a formula that will do the trick?