This program computes forecasts for time series data. You can choose
from six different forecasting methods to use.
First enter the number of periods of past data, enter the name of
the variable you want to forecast, and enter the number of most
recent periods to be used in computing MAD. Next enter the past data
in the grid on the left. Then select one of the six forecasting
methods to use, and enter values for the necessary parameters
depending on which forecasting method you choose.
First enter the number of periods of past data, enter the name of
the variable you want to forecast, enter the number of periods to
forecast, enter the percent confidence interval for forecast
ranging, enter the number of most recent periods to be used in
computing MAD, and enter the number of independent variables. Then
enter the name of each independent variable. Next enter the past
data in the grid on the left. Finally enter the values of the
independent variables for future periods to be forecasted, in the
grid at the bottom right.
First enter the number of sources and destinations. Then enter the
unit shipping cost from each source to each destination, the
capacity of each source, and the requirement of each destination. If
a particular shipping route is not allowed, then enter a large cost
(e.g., 999999).
__
Line Balancing -- Help Screen
Enter the annual demand estimate, the ordering or setup cost, the
expected demand during the lead time, the carrying cost, the maximum
inventory target, and the current number of units in inventory.
RP -- Help Screen
After the inventory status information for all parts has been
entered, click on the ‘Product Structure’ tab at the top to describe
the product structure tree. The left side of the ‘Product
Structure’ tab show a version of the product structure tree called
the indented parts list. The right side shows a list of all the
parts you entered in the ‘Inventory Status’ tab.
To add the first-level items below the end item, click on the end
item on the left side of the screen, then click on the next part on
the right side of the screen that is to be added as a first-level
item below the end item. Then click the add button the number of
times as there are units of this part below the end item. For
example, if end item A requires 3 units of part B, first click on
item A(1) on the left side of the screen, then click on part B on
the right side of the screen, then click the ‘Add’ button 3 times to
add 3 units of part B underneath parent item A. To add 2 units of
part E below part B (at level 2), click on B on the left side of the
screen, then click on E on the right side of the screen, then click
the ‘Add’ button 2 times.
After all inventory status information and product structure
information has been entered, click the solve button at the top of
the screen to obtain the completed MRP tables and planned order
release schedule.
aiting Lines -- Help Screen
First enter the values for the arrival rate (lambda) as arrivals per
time period, and the service rate (mu) as entities serviced per time
period. Then select the type of queuing model to use. For a single
channel with limited waiting line length, enter the maximum line
length allowed. For multi-channel, enter the number of channels.
For X-bar chart, enter the value of X-bar-bar, the expected value of
X based on past samples. Also enter the value of R-bar.
For R chart, enter the value of R-bar, the expected value of R based
on past samples.
For X-Bar acceptance plan, select whether you will be entering the
standard error of the sampling distribution or the universe standard
deviation. Then enter the sample size and value of X-Bar.
_
Critical Path Method -- Help Screen
This program finds the minimum project duration and critical path
for a project. For each activity, it finds the earliest start and
finish times, the latest start and finish times, and the slack.
This program finds the expected project duration and critical path
for a project. For each activity, it finds the earliest start and
finish times, the latest start and finish times, and the slack.