200 lazydelay(86400L), iteration_threshold(1), iteration_accuracy(0.01),
339 throw DataException(
"Invalid iteration threshold: must be >= 0");
340 iteration_threshold = d;
354 if (d<0.0 || d>100.0)
355 throw DataException(
"Invalid iteration accuracy: must be >=0 and <= 100");
356 iteration_accuracy = d;
422 typedef map < int, deque<Demand*>, less<int> > classified_demand;
423 typedef classified_demand::iterator cluster_iterator;
424 classified_demand demands_per_cluster;
442 double iteration_threshold;
447 double iteration_accuracy;
571 : sol(s), cluster(c), demands(d), constrainedPlanning(true),
601 throw LogicException(
"Use the method SolverMRPdata::getLogLevel() instead of SolverMRPdata::getVerbose()");
605 inline void push(
double q = 0.0,
Date d = Date::infiniteFuture)
607 if (
state >= statestack + MAXSTATES)
625 if (--
state < statestack)
631 static const int MAXSTATES = 256;
642 deque<Demand*>* demands;
645 State statestack[MAXSTATES];
648 bool constrainedPlanning;