bill

Thanks for tracking this down. I think it needs to track the next execution time and then simply wait again if the timer expires too early (more than 1 second...

I haven't had time to update the code and tests yet. I believe the fix described above should work, but would need to be tested.

Later is a basic constraint solver. Each constraint (such as what hours or minutes a schedule is valid for) is considered independently. In other words, the hour constraint has no...

It's based on standard critical path/float algorithms (see http://www.pmexamsmartnotes.com/how-to-calculate-critical-path-float-and-early-and-late-starts-and-finishes/ for an example on how to calculate the critical path and float). I use the calculated float and a couple of...

Later was really designed for human scale activities, not machine scale activities so I don't think I ever bothered to clear out the milliseconds before calculating instances. I'm guessing that's...

Does 0, 6 do what you want? Or SAT, SUN? Or are they all broken at the moment?

Thanks for reporting this.

Every time you call `schedule.create(tasks, resources);` it creates a schedule based on what is currently specified. Every time you add a resource or task, you should just reschedule everything. If...

I thnk you would need to convert your schedule to an exception schedule and then attempt to schedule that. If the exception schedule was the inverse of the normal schedule,...

I know of no other alternatives (which is why I originally developed this library). Unfortunately I ported it over to Go a long time ago for my uses and no...