TIME SERIES FORECASTING This program performs forecasting for time series data with up to 50 points.

The forecasting techniques include: Weighted Moving Average(WMA), Exponential Smoothing(ES) without trend, Double Smoothing (with trend). Decomposition Method (additive model), and Adaptive Exponential Smoothing. In each case, Mean-Squared Error (MSE), Mean Absolute Deviation (MAD), Bias of the forecast, Coefficient of Variation, and Tracking Signal are reported. @ MULTIPLE REGRESSION This program performs multiple regression with up to 10 independent variables and 60 observations. The output consists of the regression function coefficients, standard deviations of coefficients, and tstatistics. It also provides the analysis of variance table, coefficients of determination, and predicted values. Note that the independent variables should be scaled properly so that the ratio of absolute values of the largest observation to smallest observation is less than about 1000. Poorly scaled problems may produce inaccurate results. @ DECISION ANALYSIS This program solves decision analysis problems utilizing decision trees and decision tables. For decision trees, with up to 50 branches, the conditional payoffs as well as the optimum alternative is provided. For decision tables, with up to 20 alternatives and 20 states of nature, decision analysis under uncertainty and under risk is performed. A decision matrix is used for decision tables with the rows representing the alternative actions and the columns representing the states of nature. @ LINEAR PROGRAMMING This program uses the regular simplex method to solve problems of up to 50 variables and 30 constraints. The problem can be in MIN or MAX form, subject to equality, less than or equal to, and/or greater than or equal to constraints. The output consists of the optimal objective value, values for the decision variables, and the associated reduced costs. Also reported are the values of the slack variables and their shadow

prices. Sensitivity analysis of the right-hand values as well as of the objective function coefficients are provided. @ TRANSPORTATION METHOD This program solves the transportation problem, using the transportation simplex method. The program solves problems with up to 20 sources (plants) and 20 destinations (warehouses). If the problem is unbalanced a dummy warehouse or dummy plant is added. Initial solution is obtained by using the northwest corner method. The program reports the intermediate solutions, presenting the cost as well as the quantities to be shipped for each route. @ ASSIGNMENT METHOD This program solves the assignment problem. The problem may include up to 30 rows (candidates) and 30 columns (jobs). The solution method consists of the standard assignment algorithm. The program solves maximization and minimization problems. If the problem is unbalanced dummy candidates or dummy jobs are added. The input data consists of the number of candidates, the number of jobs, and the assignment costs for each candidate-job combination. @ LOCATION ANALYSIS This program solves the location analysis problem which consists of assigning n departments or facilities to n locations while minimizing the total transportation cost. The problem can include up to 25 facilities. The solution methods consist of a random assignment heuristic and a pairwise exchange heuristic. The user may also request pairwise exchanges of selected department pairs. The input data consists of number of departments, number of locations, the inter-departmental workflows, and the inter-location distances. @ LAYOUT ANALYSIS This program solves the layout design problem which consists of developing a layout design for departments or facilities while maximizing the total adjacency preference ratings. The problem may include up to 30 facilities. The solution methods consist of a random assignment heuristic and a pairwise

exchange heuristic. The user may also request pairwise exchanges of selected department pairs. The input data consist of number of facilities, grid size, and pairwise adjacency ratings using an adjacency preference scale. @ ASSEMBLY LINE BALANCING This program solves the assembly line balancing problem with up to 30 tasks. The solution methods consist of four heuristic rules which prescribe the task that should be scheduled first. The rules are: 1- Longest processing time 2- Largest number of following tasks 3- Largest number of predecessor tasks 4- Largest positional weight. The output consists of the minimum cycle time, number of work stations required, and the assembly line efficiency. @ AGGREGATE PLANNING This program solves the multi-product aggregate or intermediate production planning problem with up to 4 products and 12 periods. The problem may include regular time, overtime, sub-contracting, and backlogs. The solution methods consist of an optimizing procedure based on the transportation model formulation. The output consists of the optimal production schedule and cost report for each product. An overall cost summary report is also provided. @ INVENTORY ANALYSIS This program analyzes and provides the minimum cost solutions for the following inventory models: A-Economic Lot Size without shortage B-Economic Lot Size with shortage C-Economic Run Size without shortage D-Economic Run Size with shortage E-Economic Lot Size model with quantity discounts F-Stochastic Demand model with lead-time For each model, the program reports the optimum order quantity, total cost, holding cost, setup or order cost, and length of the cycle. @ MATERIAL REQUIREMENTS PLANNING This program solves the multi-item material requirements planning (MRP)

problem. The problem may include up to 5 end-items, 30 parts, and 26 periods. Components may include up to 4 subcomponents. The input data consist of the master production schedule, bill of materials, inventory record file, and scheduled receipts. Items can be ordered according to lot-for-lot, lot-size, and/or period order quantity policy. Output consists of the time phase plan and cost report for all components or a selected component. @ PROJECT MANAGEMENT This program solves project management problems using the activity on arc method for up to 30 events and 50 activities using PERT/CPM. Both deterministic activity times and three level time estimate problems can be solved. Events (nodes) must be numbered from 1 to N, with the beginning event as node 1 and the ending event as node N. Each activity also receives a separate number although it can also be identified by its two end nodes. To speed up a project, individual activities can be speeded up (crashed) through time cost trade-offs. @ QUALITY ASSURANCE This program provides the parameters and helps solve two quality control models: the acceptance sampling model and the process control model. The acceptance sampling model provides data to plot the operating characteristics curve and the average outgoing quality curve on the basis of the inputs: lot size, sample size and number of acceptable defectives in sample. The process control model provides the mean and the lower and upper control limits for mean, range, and p and c control charts on the basis of number of defectives found in each of the specified samples. @