This class models a buffer that is replenish by an external supplier using a reorder-point policy.
More...
|
| BufferProcure (const string &c) |
|
virtual void | endElement (XMLInput &, const Attribute &, const DataElement &) |
|
virtual PyObject * | getattro (const Attribute &) |
|
TimePeriod | getFence () const |
|
TimePeriod | getLeadtime () const |
|
TimePeriod | getMaximumInterval () const |
|
double | getMaximumInventory () const |
|
TimePeriod | getMinimumInterval () const |
|
double | getMinimumInventory () const |
|
Operation * | getOperation () const |
|
virtual size_t | getSize () const |
|
double | getSizeMaximum () const |
|
double | getSizeMinimum () const |
|
double | getSizeMultiple () const |
|
virtual const MetaClass & | getType () const |
|
virtual int | setattro (const Attribute &, const PythonObject &) |
|
void | setFence (TimePeriod p) |
|
void | setLeadtime (TimePeriod p) |
|
void | setMaximumInterval (TimePeriod p) |
|
void | setMaximumInventory (double f) |
|
void | setMinimumInterval (TimePeriod p) |
|
void | setMinimumInventory (double f) |
|
void | setSizeMaximum (double f) |
|
void | setSizeMinimum (double f) |
|
void | setSizeMultiple (double f) |
|
virtual void | solve (Solver &s, void *v=NULL) const |
|
virtual void | writeElement (XMLOutput *, const Keyword &, mode=DEFAULT) const |
|
virtual void | beginElement (XMLInput &, const Attribute &) |
|
| Buffer (const string &str) |
|
void | deleteOperationPlans (bool deleteLockedOpplans=false) |
|
size_t | extrasize () const |
|
Flow * | findFlow (const Operation *o, Date d) const |
|
virtual void | followPegging (PeggingIterator &, FlowPlan *, short, double, double) |
|
double | getCarryingCost () const |
|
const flowplanlist & | getFlowPlans () const |
|
flowplanlist & | getFlowPlans () |
|
const flowlist & | getFlows () const |
|
bool | getHidden () const |
|
Item * | getItem () const |
|
Location * | getLocation () const |
|
double | getMaximum () const |
|
CalendarDouble * | getMaximumCalendar () const |
|
double | getMinimum () const |
|
CalendarDouble * | getMinimumCalendar () const |
|
double | getOnHand (Date d=Date::infinitePast) const |
|
double | getOnHand (Date, Date, bool min=true) const |
|
Operation * | getProducingOperation () const |
|
void | setCarryingCost (const double c) |
|
void | setHidden (bool b) |
|
void | setItem (Item *i) |
|
void | setLocation (Location *i) |
|
void | setMaximum (double) |
|
void | setMaximumCalendar (CalendarDouble *) |
|
void | setMinimum (double) |
|
void | setMinimumCalendar (CalendarDouble *) |
|
void | setOnHand (double f) |
|
void | setProducingOperation (Operation *o) |
|
virtual void | updateProblems () |
|
virtual | ~Buffer () |
|
void | beginElement (XMLInput &, const Attribute &) |
|
memberIterator | beginMember () const |
|
void | endElement (XMLInput &, const Attribute &, const DataElement &) |
|
unsigned short | getHierarchyLevel () const |
|
Buffer * | getOwner () const |
|
| HasHierarchy (const string &n) |
|
bool | hasOwner () const |
|
bool | isGroup () const |
|
void | setOwner (Buffer *f) |
|
void | writeElement (XMLOutput *, const Keyword &, mode=DEFAULT) const |
|
| ~HasHierarchy () |
|
int | compare (const PyObject *other) const |
|
| HasName (const string &n) |
|
| HasName (const char *n) |
|
void | setName (const string &newname) |
|
virtual PyObject * | str () const |
|
| ~HasName () |
|
TreeNode * | decrement () const |
|
const string & | getName () const |
|
TreeNode * | increment () const |
|
bool | operator< (const TreeNode &o) |
|
| TreeNode (const string &n) |
|
virtual | ~TreeNode () |
|
| Object () |
|
virtual | ~Object () |
|
virtual PyObject * | call (const PythonObject &args, const PythonObject &kwds) |
|
Py_ssize_t | getReferenceCount () const |
|
void | initType (const MetaClass *t) |
|
void | initType (PyTypeObject *t) |
|
virtual PyObject * | iternext () |
|
| PythonExtensionBase () |
|
void | resetReferenceCount () |
|
virtual | ~PythonExtensionBase () |
|
unsigned short | getCluster () const |
|
short | getLevel () const |
|
bool | getChanged () const |
|
bool | getDetectProblems () const |
|
Plannable * | getEntity () const |
|
| Plannable () |
|
void | setChanged (bool b=true) |
|
void | setDetectProblems (bool b) |
|
| HasProblems () |
|
virtual | ~HasProblems () |
|
virtual | ~Solvable () |
|
void | endElement (XMLInput &, const Attribute &, const DataElement &) |
|
string | getCategory () const |
|
string | getDescription () const |
|
string | getSubCategory () const |
|
void | setCategory (const string &f) |
|
void | setDescription (const string &f) |
|
void | setSubCategory (const string &f) |
|
void | writeElement (XMLOutput *, const Keyword &, mode=DEFAULT) const |
|
This class models a buffer that is replenish by an external supplier using a reorder-point policy.
It represents a material buffer where a replenishment is triggered whenever the inventory drops below the minimum level. The buffer is then replenished to the maximum inventory level.
A leadtime is taken into account for the replenishments.
The following parameters control this replenishment:
- MinimumInventory:
Inventory level triggering a new replenishment.
The actual inventory can drop below this value.
- MaximumInventory:
Inventory level to which we try to replenish.
The actual inventory can exceed this value.
- Leadtime:
Time taken between placing the purchase order with the supplier and the delivery of the material.
Using the additional parameters described below the replenishments can be controlled in more detail. The resulting inventory profile can end up to be completely different from the classical saw-tooth pattern!
The timing of the replenishments can be constrained by the following parameters:
- MinimumInterval:
Minimum time between replenishments.
The order quantity will be increased such that it covers at least the demand in the minimum interval period. The actual inventory can exceed the target set by the MinimumInventory parameter.
- MaximumInterval:
Maximum time between replenishments.
The order quantity will replenish to an inventory value less than the maximum when this maximum interval is reached. When the minimum and maximum interval are equal we basically define a fixed schedule replenishment policy.
The quantity of the replenishments can be constrained by the following parameters:
- MinimumQuantity:
Minimum quantity for a replenishment.
This parameter can cause the actual inventory to exceed the target set by the MinimumInventory parameter.
- MaximumQuantity:
Maximum quantity for a replenishment.
This parameter can cause the maximum inventory target never to be reached.
- MultipleQuantity:
All replenishments are rounded up to a multiple of this value. When the minimum and maximum quantity are equal we basically define a fixed quantity replenishment policy.
Definition at line 2972 of file model.h.