Schedule Optimization

[eibwen]

I'm in the preliminary stages of authoring a "schedule optimization" program. Basically, I'd like it to parse a database of recurrent events and compute possible combinations based on date, time, and possibly other constraints.

I've tried both CPAN and google searches with minimal results. Are there any existing codes/modules which might be applicable or perhaps serve a similar function?

There seem to be a variety of modules which might be applicable -- but nothing directly. For example, the mathematical permutation and combination modules seem apt, yet I haven't figured out how to compensate for date spans, particularly for multiday events (eg MWF, TTh, etc).

There are a few alternate possibilities -- try to implement the behavior in SQL or write my own code from scratch. Given a well designed database SQL may be the best choice, but that still leaves the problem of linked events (eg Event B subsequent to Event A).

Even if I were to use SQL, I'm not quite sure how to combine the dates with the Math::Combinatorics.

Lastly, test-driven development seems prudent; however I'm not quite sure which tests are necessary. For example, given the objective, I'd test for time conflicts and verification of other constraints -- but beyond that I'm not sure.

[anonymized user 468275]

This is clearly a data modelling problem - even if you do find a module that provides some kind of assistance, it wouldn't be flexible enough to handle those 'other constraints' nor can it remotely address the risk of design change your requirement represents.

My advice is that before even deciding what to implement in perl or SQL, you need to design and maintain your logical data model (here is a short course http://www.sum-it.nl/cursus/dbdesign/english/index.php3) and use that to drive what you then build in perl, DDL and/or SQL as your physical implementation.

At that point you'll have well-definied entities we can look at to advise on how to implement them.

Your requirement does suggest the event entity would be a parent that owns event-day children (as database tables) but I'd need to see the rest of the requirement to be confident about that - also I don't yet see why you want to use mathematical combinations which are different from the simple multiples concept your requirement so far suggests

Hope this helps,

Simon

[jimX11]

If you implement the behavior in SQL, you may be able to use Test::DatabaseRow to run tests in a perl test suite.

Here's an overview of testing modules

I too think sample data would help me better understand your interesting question.

[artist]

If you can give us some sample data, we can try out here.

[fglock]

DateTime::SpanSet may help you write the time functions, together with DateTime::Event::Recurrence. Although these modules don't provide all the logic you need, they do provide the basic operations.

[thor]

In addition to what artist said about sample data, it'd also be nice to know what your definition of "optimal" is given said data.