|
Objects in this document may appear out of sequence if not viewed with Internet Explorer |
|
ORMSware NMOD Primer: Chapter 5 |
|
![]() |
We can do this by looping through the top network several times with various values of PiecesPerHour. However, if we are to use this approach, we do not want the values we are looping through to be replaced by PiecesPerHour value calculated in the PiecesPerHour [sub]network. We can prevent execution of PiecesPerHour network while also incorporating the looping process, by changing the Type property of n[2] to Arrival and adding a loop-back arc from PiecesPerHour to itself as shown in Figure 7. We will expand on Arrival nodes and another way to generate values for the curve a little later in this document. |
|
Figure 7 |
|
Notes
In the case of our simple model so far, it is easy to find the value of PiecesPerHour that will yield minimum CostPerPiece by finding the root of the first derivative of the cost-per-piece function. If pieces per hour is x, labor cost per hour is z=$25, wear coefficient is a=0.1 and wear exponent is b=1.8, minimum value of
Whenever it is possible to find the desired value of a variable analytically that way in a real situation, we should incorporate that calculation process into the model's calculation network. Notice the point we made in Chapter 1 that even when a model is normative (using the above equation we solved for what pieces per hour should be to achieve minimum cost per piece), it still has the form of a network. In fact, if we diagram the above model, it will look very similar to the original what-if model minus the node for x (PiecesPerHour). x will become the dependent variable in this case, becoming a function of wear parameters and labor cost per hour, and its expression will be in Node 5 where CostPerPiece used to be! That model can also be considered a what-if model, answering the question what if the values of wear parameters and labor cost per hour were such and such? What will the value of x be? To facilitate discussion of various NMOD concepts, we will use a more generalized and explicit evaluation approach for curve development. Though inefficient and imprecise, it can be applied in many situations as you will see shortly. We can also easily gather the values necessary to build the desired curve by using Trivial Search, which is shown in Problem 5 in the Examples section. If we are only interested in the minimum cost per piece rather than the whole curve, we can use the Golden Section Search explained in Chapter 19 (Reinforcing concepts through PrimerSig's feedback file) of this primer. |
|
Click to go to Chapter 4: Visio pages and ORMSware networks |
|
Click to go to Chapter 6: Calculation/execution threads |
|
Click to go to Introduction: NMOD Primer |