algorithm calculate unbroken set sequence
i am looking an algorithm calculate unbroken set operations sequence. here rudimentary construction sequence.
- task 1a finished each 500 hours
- task 2a finished each 1000 hours
- task 3a finished each 1500 hours
so during t=500, 1a. during t=1000, both 1a 2a, during t=1500 1a 3a, nonetheless 2a 1500 churned 1000. idea.
it definitely easy i tangible time, nonetheless i don't. i have story tasks (eg final [1a+2a] done).
knowing final (eg [1a+2a]) adequate decide:
- [1a+2a] during t=1000: unbroken [1a+3a] during t=1500
- [1a+2a] during t=5000: unbroken [1a] during t=5500
is there an algorithm this? looks informed problem (some arrange sieve?) nonetheless i can't seem solution.
also contingency "scale" i indeed have some-more 3 tasks.
Comments
Post a Comment