Abstract:
Conventionally, for a product accompanied by supplies such as a copy machine or a printer, the demand figures relating to the supply which such a main machine consumes have been determined empirically from the transition of the past sales records of the supply, the trends of the market, and a sales scheduled figures of the main machine. Therefore, the forecasted values of the demand figures differ in accordance with the skills or experiences of individuals carrying out the forecasting, and necessarily, the accuracy of the forecasted values deteriorates. Further, a demand forecast method relating to the supplies of a product has not been realized due to the large number of parameters, the complexity of calculation, and the difficulty of a systematic approach for solving problems.  
     In order to overcome the above-described problems, the invention of the present application forecasts consumption figures of a supply for outputting an outputted matter in the future, on the basis of inputted output figures of an outputted matter outputted by a product and sales figures of the supply.

Description:
BACKGROUND OF THE INVENTION  
         [0001]    1. Field of the Invention  
           [0002]    The present invention relates to a supply demand forecasting device, method, and program, and in particular, to a supply demand forecasting device, method, and program for forecasting the demand of supplies which a main machine consumes before and after a product accompanying supplies (hereinafter, “main machine”) is sold on the market.  
           [0003]    2. Related Background Art  
           [0004]    Conventionally, with respect to a product, such as a copy machine or a printer, accompanying supply (hereinafter, “main machine”), the demand figure relating to a supply which such a main machine consumes is determined empirically from changes in the past sales records of the supply, trends of the market, and sales schedule figures of the main machine.  
           [0005]    In this way, because the forecast of the demand figure (hereinafter, “demand forecast”) depends on rules learned by experience or know-how, the forecasted value of the demand figure differs in accordance with the skills and experience of an individual carrying out the forecast, and necessarily, the accuracy of the forecasted value deteriorates. In this way, a demand forecast method relating to supplies for a product has not been realized due to the large number of parameters, the complexity of calculation, and the difficulty of a systematic approach for solving problems.  
         SUMMARY OF THE INVENTION  
         [0006]    Other features and advantages of the present invention will be apparent from the following description taken in conjunction with the accompanying drawings, in which like reference characters designate the same or similar parts throughout the figures thereof. 
       
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0007]    The accompanying drawings, which are incorporated in and constitute a part of the specification, illustrate embodiments of the invention and, together with the description, serve to explain the principles of the invention.  
         [0008]    [0008]FIG. 1 is a diagram showing a configuration of an information processing device for realizing a demand forecast device, method, and program of the present invention.  
         [0009]    [0009]FIG. 2 is a table showing a table for explanation of forecast process units in an embodiment.  
         [0010]    [0010]FIG. 3 is a table showing one example in which main machine sales record/schedule figures x(t) are calculated from main machine sales record figures a(t) and main machine sales schedule figures b(t) from January 2001 to December 2001.  
         [0011]    [0011]FIG. 4 is a table showing one example of operating main machine record figures y(t) from January 2001 to December 2001.  
         [0012]    [0012]FIG. 5 is a graph showing remaining rate functions at installation time A, installation time B, installation time C.  
         [0013]    [0013]FIG. 6 is a graph showing relationships between installed main machine figures and operating main machine figures.  
         [0014]    [0014]FIG. 7 is a table showing correspondences between sales areas and supply models.  
         [0015]    [0015]FIG. 8 is a flowchart showing a process flow at the time of forecasting operating figures of the main machines.  
         [0016]    [0016]FIG. 9 is a flowchart showing a process flow at the time of forecasting an average PV of the main machines.  
         [0017]    [0017]FIG. 10 is a flowchart showing a process flow at the time of forecasting a total PV of the main machines.  
         [0018]    [0018]FIG. 11 is a flowchart showing a process flow at the time of carrying out demand forecasting of a supply.  
         [0019]    [0019]FIG. 12 is a diagram showing an operating main machine forecast block, an average PV forecast block, and a total forecast PV block.  
         [0020]    [0020]FIG. 13 is a diagram showing a supply forecast block.  
         [0021]    [0021]FIG. 14 shows one example of install diffusion coefficients j(t).  
         [0022]    [0022]FIG. 15 is a table showing monthly installed machine figures and installed machine total figures in the present embodiment.  
         [0023]    [0023]FIG. 16 is one example showing changes in the remaining rate function when an average lifetime μ and a variation coefficient φ are varied.  
         [0024]    [0024]FIG. 17 shows a module structure of a program of the present invention.  
         [0025]    [0025]FIG. 18 is a conceptual diagram of a supply demand forecast.  
         [0026]    [0026]FIG. 19 is a conceptual diagram of an initial demand forecast.  
         [0027]    [0027]FIG. 20 is a conceptual diagram of a competitor reflected demand forecast.  
         [0028]    [0028]FIG. 21 is a conceptual diagram of a demand forecast at the final stage of the sales term (trend forecast).  
         [0029]    [0029]FIG. 22 is a table showing forecast methods of supply initial demand forecast, competitor reflected supply demand forecast, and supply demand forecast, and conditions for switching forecast methods.  
         [0030]    [0030]FIG. 23 is a diagram showing a module structure to be added to the module structure of the program of FIG. 17.  
         [0031]    [0031]FIG. 24 is an overall flowchart.  
         [0032]    [0032]FIG. 25 is a flowchart showing details of a supply initial demand forecast process.  
         [0033]    [0033]FIG. 26 is a flowchart showing details of a competitor reflected supply demand forecast process.  
         [0034]    [0034]FIG. 27 is a flowchart showing details of a supply trend demand forecast process.  
         [0035]    [0035]FIG. 28 is a flowchart showing a flow of determination of the forecast method.  
         [0036]    [0036]FIG. 29 is a flowchart showing a flow of determination of the forecast method.  
         [0037]    [0037]FIGS. 30A, 30B,  30 C and  30 D are diagrams showing a transition of databases at the time of supply initial demand forecast.  
         [0038]    [0038]FIGS. 31A, 31B,  31 C,  31 D,  31 E and  31 F are diagrams showing a transition of databases at the time of competitor reflected supply demand forecast.  
         [0039]    [0039]FIGS. 32A, 32B,  32 C and  32 D are diagrams showing a transition of databases at the time of supply trend demand forecast.  
         [0040]    [0040]FIGS. 33A, 33B,  33 C,  33 D and  33 E are diagrams showing a transition at the time of determination of the forecast method.  
         [0041]    [0041]FIGS. 34A, 34B,  34 C,  34 D,  34 E,  34 F,  34 G and  34 H are diagrams showing various types of databases of the present invention.  
         [0042]    [0042]FIGS. 35A, 35B,  35 C,  35 D and  35 E are diagrams showing various types of databases of the present invention.  
         [0043]    [0043]FIG. 36 is a diagram showing examples of a supply sales record (RC) and a competitor reflected supply forecast object term (T(FC 5 )).  
         [0044]    [0044]FIGS. 37A, 37B,  37 C,  37 D and  37 E are graphs showing conceptual diagrams of supply macro demand forecasts.  
         [0045]    [0045]FIG. 38 shows a module structure for macro demand forecast.  
         [0046]    [0046]FIG. 39 is a schematic diagram of a flow of supply macro demand forecast.  
         [0047]    [0047]FIG. 40 is a detailed view of a flow of supply macro demand forecast.  
         [0048]    [0048]FIGS. 41A, 41B,  41 C and  41 D are transition diagrams of DBs of a supply macro composition module  3803 .  
         [0049]    [0049]FIGS. 42A, 42B and  42 C are transition diagrams of DBs of a supply macro decomposition module  3805 .  
         [0050]    [0050]FIGS. 43A, 43B,  43 C,  43 D and  43 E are diagrams showing a list of databases relating to supply macro demand forecast.  
         [0051]    [0051]FIG. 44 is a diagram showing a screen at the time of displaying the supply demand forecast result on an output unit  103 .  
         [0052]    [0052]FIG. 45 is a table showing the supply sales record up to October of a given year.  
         [0053]    [0053]FIG. 46 is a graph showing weights by which sales records are to be multiplied. 
     
    
     DESCRIPTION OF THE PREFERRED EMBODIMENT  
       [0054]    An object of the present invention is to establish a demand forecast method of a supply relating to a main machine which has not been conventionally realized, and to carry out schedule work-out support (a new product introducing schedule or a replacing (exchanging) schedule) of a supply business on the basis of the result.  
         [0055]    In order to realize those objects, there are following technical topics.  
         [0056]    (1) A method for forecasting operating figures of main machines in which the supply is used.  
         [0057]    (2) A method for forecasting an average print volume (hereinafter “PV”) of the main machines in which the supply is used.  
         [0058]    (3) A method for forecasting the total PV of the main machines in which the supply is used.  
         [0059]    (4) A method for forecasting figures of the supply which will be used in the future from record figures of sales of the supply in the past and the total forecast PV of the main machines in which the supply is used.  
         [0060]    (5) A method for forecasting operating figures of the main machines when sufficient sales records do not exist (scheduling stage or a stage immediately after starting).  
         [0061]    (6) A method for forecasting the average PV of the main machines when sufficient sales records do not exist.  
         [0062]    (7) A method for determining the endurance print volume of the supply when sufficient sales records do not exist.  
         [0063]    (8) A method for compensating (increasing or decreasing) the forecast result in consideration of the market trends.  
         [0064]    (9) A method for carrying out correction of seasonal variations on the forecast result.  
         [0065]    In the present embodiment, the main machines are a copy machine and a printer, and the supplies are paper, toner, and a drum used in the copy machine and the printer. However, the main machine may be a vehicle, and the supply may be gasoline (fuel) used in the car.  
         [0066]    The present embodiment has the following structure.  
         [0067]    1. System configuration  
         [0068]    2. Main machine average PV (print volume) forecast (average PV forecast block)  
         [0069]    3. Main machine total PV forecast (total forecast PV block)  
         [0070]    4. Supply demand forecast (supply forecast block)  
         [0071]    5. Forecast result display  
         [0072]    6. Forecast method switching  
         [0073]    7. Supply macro demand forecast  
         [0074]    Hereinafter, in accordance with the attached figures, a preferred embodiment relating to the present invention will be described in detail.  
         [0075]    1. System configuration  
         [0076]    [0076]FIG. 1 is a diagram showing a configuration of an information processing device for realizing the present invention.  
         [0077]    Reference numeral  101  is a CPU, and carries out controls of the respective units in the information processing device, and carries out controls for realizing the processes shown in the present embodiment.  
         [0078]    Reference numeral  102  is an input unit, and enables input of information from an operator of the information processing device. As the input unit  102 , there are, for example, a keyboard, a mouse, a digitizer, or the like.  
         [0079]    Reference numeral  103  is an output unit, and displays information to the operator of the information processing device. As the output unit  103 , there are, for example, a CRT, a liquid crystal display, or the like. The output unit  103  displays information urging the operator to input various types of information, and displays forecast results which will be described later as graphs and/or tables.  
         [0080]    Reference numeral  104  is an external storage device, and carries out reading and writing of information to a medium other than the information processing device. As the external storage device  104 , there are, for example, an FD drive, an MO drive, a CD-R drive, or the like.  
         [0081]    Reference numeral  105  is a ROM (Read Only Memory), and is a read only memory. As the ROM  105 , there are a PROM (Programmable Rom) in which a user can electrically write a program, and a mask ROM in which contents are written at the time of manufacture. Any ROM may be used in the present embodiment.  
         [0082]    Reference numeral  106  is a RAM (Random Access Memory), and is a memory which can be freely written and freely read. The RAM  106  has a function of temporarily storing data at the time of carrying out the processes of the present embodiment or the like.  
         [0083]    Reference numeral  107  is a network interface, and enable connection to a network such as the Internet, a LAN/WAN, or the like. As the network interface  107 , there are, for example, a modem, a network card, or the like. Further, communication is realized by a network protocol such as TCP/IP or the like.  
         [0084]    Reference numeral  108  is an internal storage device, and is a device for storing information in the information processing device. As an example of the internal storage device, there is a hard disk or the like.  
         [0085]    Reference numeral  109  is a bus, and exchanges various types of data among the respective blocks in the information processing device and supplies electric power. The bus  109  is formed from an address line, a data line, a control line, a power source/ground line, or the like.  
         [0086]    Hereinafter, operations of the respective units in the information processing device will be described.  
         [0087]    First, the CPU  101  reads into the RAM  106  a program (hereinafter, “program”) which has been stored in the ROM  105 , the internal storage device  108 , or the external storage device  104 , and which realizes the processes (functions) shown in the present embodiment. Further, the program read into the RAM  106  is expanded on the RAM  106 . The program may be an interpreter type or may be a compiling type.  
         [0088]    The program expanded on the RAM  106  realizes various types of processes by co-operating with the CPU  101 .  
         [0089]    [0089]FIG. 17 shows a modular structure of the program.  
         [0090]    The program can be broadly divided into an “input control module”, a “computation module”, an “output module”, a “network module”, and the like. The respective modules are divided into further subdivided modules.  
         [0091]    The processes of the invention of the present application by the program are concretely realized by using hardware resources such as the CPU  101 , the RAM  106 , or the like. Namely, due to the program being read by the information processing device, a unique information processing device corresponding to the object of the invention of the present application or an operating method therefor is structured by a concrete means in which the software and the hardware resources co-operate.  
         [0092]    Further, the program does not have to be a single program, and may be a combination of a plurality of programs. For example, the processes of the invention of the present application may be realized by a program utilizing a part of functions of a general purpose spreadsheet software (for example, a macro program or the like).  
         [0093]    The CPU  101  urges the user to input via the output unit  103  by co-operating with the input control module in the program, and realizes inputting of data from the user via the input unit  102 , and makes the external storage device  104 , the RAM  106 , the internal storage device  108  or the like store the inputted data.  
         [0094]    Further, the CPU  101  executes various types of computations required for the processes of the invention of the present application (for example, computation forecasting consumption figures of the supply, or the like) by co-operating with the computation module in the program.  
         [0095]    Furthermore, the CPU  101  displays to the user various types of information (for example, an input request, a computed result, or the like) via the output unit  103  by co-operating with the output module in the program.  
         [0096]    Moreover, the CPU  101 , by co-operating with the network module in the program, realizes connection with a network (not shown) such as a LAN, a WAN, or the like, and realizes exchange of various types of data with external devices via the network.  
         [0097]    It goes without saying that the structure of the program is not limited to the above-described program modules.  
         [0098]    In forecasting the sales figures (demand figures) of a supply of the main machine in the present invention, a total forecast PV is determined (total forecast PV block) on the basis of a forecast of operating figures of the main machines using the supply (operating main machine figure forecast block) and a forecast of the average PV (average PV forecast block), and demand forecasting of the supply (supply forecast block) is carried out by using the total forecast PV.  
         [0099]    [0099]FIG. 12 is a diagram showing the operating main machine figure forecast block, the average PV forecast block, and the total forecast PV block.  
         [0100]    [0100]FIG. 13 is a diagram showing the supply forecast block.  
         [0101]    Hereinafter, the respective forecast blocks will be described.  
         [0102]    1. Forecasting of operating figure of main machines (operating main machine figure forecast block)  
         [0103]    [0103]FIG. 8 is a flowchart showing a process flow at the time of forecasting the operating figure of the main machines.  
         [0104]    Constants, variables, and functions used in the present process are as follows.  
         [0105]    t: Unit-time in which data was observed (for example, month), and here, the main machine sales start date is 0 (starting point).  
         [0106]    a(t): Main machine sales record figure of t month  
         [0107]    b(t): Main machine sales schedule figure of t month  
         [0108]    x(t): Main machine sales record/schedule figure of t month  
         [0109]    d: Delay coefficient (for example, the number of months)  
         [0110]    y(t): Operating main machine record figure of t month  
         [0111]    T: The last month when operating main machine record figure was observed (term and effective number in which y(t) was observed)  
         [0112]    {circumflex over (γ)}(t): Operating main machine forecast figure of t month  
         [0113]    S(j): Remaining rate function (remaining rate j months after installation of the main machines)  
         [0114]    f(t): Failure rate probability density function of main machines (failure rate probability in the unit-time j months after installation of the main machines)  
         [0115]    J(t): Installation diffusion coefficient  
         [0116]    μ: Average lifetime of the main machine  
         [0117]    σ: Standard deviation of average lifetime of the main machine  
         [0118]    φ: Variation coefficient of average lifetime of the main machine  
         [0119]    h: Reliability coefficient of operating main machines forecast figure  
         [0120]    s: Standard error in operating main machines forecast figure  
         [0121]    Ag: Aging coefficient  
         [0122]    Ed: Main machine disappearance date  
         [0123]    Hereinafter, forecasting of the operating main machine figure will be described.  
         [0124]    The forecasting of the operating main machine figure is executed for each forecast process unit. The forecast process unit is a unit divided into each product and geographical area. The forecast process unit is inputted in advance via the input unit  102  by the user (it goes without saying that the main body urging the user to input or transmitting the inputted data to the respective units in the information processing device is the CPU  101 ), and is stored in the RAM  106 . Further, a forecast process unit which has been stored in advance in the external storage device  104  or the internal storage device  108  may be used.  
         [0125]    [0125]FIG. 2 is a diagram showing a table for explanation of the forecast process units in the present embodiment.  
         [0126]    In FIG. 2, the products are the four products of copy machine A, copy machine B, printer A, and printer B, and the geographical areas are the five countries of Japan, the US, England, Germany, and France. In the present embodiment, the geographical areas are set in units of countries, but may be set in units of local governments or in units of geographical areas served by a sales company. Hereinafter, the products are called “product models”, and the unit of the geographical area is called a “sales area”.  
         [0127]    In FIG. 2, the forecast process units denoted by “◯”s show that the products are sold in the sales areas. That is, all of the products are merchandised in Japan. However, only copy machine A and printer B are sold in England.  
         [0128]    Hereinafter, the procedure of forecasting the operating main machine figure for each forecast process unit will be shown. (step m 0 ) Main machine sales record/schedule figure calculating step (S 802 )  
         [0129]    In this step, the main machine sales record/schedule figure x(t) is generated from the main machine sales record figures a(t) or the main machine sales schedule figures b(t).  
         [0130]    First, the data of the main machine sales record figures a(t) and the main machine sales schedule figures b(t) are inputted. Here, “input” means:  
         [0131]    A. input of data via the input unit  102  by the user;  
         [0132]    B. input of data stored in the external storage device  104  or the internal storage device  108 ; or  
         [0133]    C. input of data received via a network from an external device by the network interface  107 . The functions of the “input” are realized by the CPU  101  or the like on the basis of the program. The input may be carried out on the basis of instructions of the user, or may be realized by a fixed rule (for example, periodically) on the basis of the program. Hereinafter, unless otherwise noted, “input” means inputting by the above-described A, B, C.  
         [0134]    The main machine sales record figures a(t) and the main machine sales schedule figures b(t) inputted are stored in the RAM  106 . Further, on the basis of the computation module in the program, the following computing process is carried out by the CPU  101 .  
         [0135]    (Formula 1)  
           a ( t )= null then x ( t )= b ( t )  
           a ( t )≠ null then x ( t )= a ( t )  
         [0136]    Note that the main machine sales record figures a(t) can obtain a substantially accurate transition of the sales figures for each forecast process unit by referring to data of actual sales of a sales store, a dealer, or the like. Further, the main machine sales schedule figures b(t) are the transition of scheduled values of the sales figures determined from the market target, the economic situations, and the like.  
         [0137]    [0137]FIG. 3 is a table showing one example in which the main machine sales record/schedule figures x(t) are calculated from the main machine sales record figures a(t) and the main machine sales schedule figures b(t) from January 2001 to December 2001.  
         [0138]    From February to August of 2001, because the main machine sales record figures a(t) have values, the main machine sales record/schedule figures x(t) are a(t). On the other hand, after September 2001, because the main machine sales record figures a(t) have no values (null), the main machine sales record/schedule figures x(t) are the main machine schedule figures b(t).  
         [0139]    In this way, it is one of the features of the present invention that subsequent forecasting is carried out by using the main machine sales record/schedule figures x(t) in which the main machine sales record figures a(t) and the main machine sales schedule figures b(t) are combined.  
         [0140]    The present step will be described in further detail. In the present step, the record data is given priority over the schedule data.  
         [0141]    Switching of the main machine sales record figures a(t) and the main machine sales schedule figures b(t) may be considered as being based on time. For example, it can be considered that “The main machine sales record/schedule figures x(t) are the main machine sales record figures a(t) before September 2001, and the main machine sales record/schedule figures x(t) are the main machine sales schedule figures b(t) after October 2001”. However, problems arise in a process based on time, due to the time lag caused by the time taken to acquire data or the like. In particular, when data from foreign countries is dealt with, the lag in time for acquiring data is marked.  
         [0142]    Therefore, in the invention of the present application, by discriminating (switching) on the basis of “there are”/“there are no” main machine sales record figures a(t) as in formula 1, the above-described problem can be solved.  
         [0143]    (step m 1 ) Object sales area and object model selecting step (S 803 )  
         [0144]    The above-described forecast process units (sales areas/main body models) are selected. In the present embodiment, in order to simplify, the forecast process is carried out by focusing on one forecast process unit. However, the forecast process units to be selected may be plural (a method in which, after a plurality of forecast process units are collectively forecasted, the forecast results are divided so as to calculate the forecast result for each forecast process unit will be described later).  
         [0145]    “Selection” of the forecast process unit is, in the same way as in the case of the above-described “input”, realized by any method of the A, B, C by the CPU  101  or the like on the basis of instructions of the program.  
         [0146]    (Step m 2 ) Main machine sales record/schedule figures x(t) and operating main machine record figures y(t) reading step (S 804 )  
         [0147]    The main machine sales record/schedule figures x(t) and the operating main machine record figures y(t) stored in time series are read into the RAM  106  for each forecast process unit (1 main machine model/1 sales area). The operating main machine record figure y(t) is the operating situation of the main machine (operating figure) which is confirmed when a service engineer visits customers for maintenance, or the like. Inputting of the operating main machine record figures y(t) is, in the same way as in the case of the above-described “input”, realized by any method of the A, B, C by the CPU  101  or the like on the basis of the program. The read data are used at the time of calculating the operating main machine forecast figure which will be described later.  
         [0148]    (Step m 3 ) Main machine sales start date detecting step (S 805 )  
         [0149]    The sales start date of the main machines is detected.  
         [0150]    The CPU  101  searches the main machine sales record/schedule figures x(t) stored in the RAM  106  from the beginning (searches from the left in FIG. 3), and stores the time when a value other than 0 is first detected as the starting point (t=0) of an address in the RAM  106 . Taking FIG. 3 as an example, February 2001 is the starting point of the address.  
         [0151]    [0151]FIG. 4 is a table showing one example of the operating main machine record figures y(t) from January 2001 to December 2001.  
         [0152]    The CPU  101  searches the operating main machine record figures y(t) stored in the RAM  106  from the end (searches from the right in FIG. 4), and, when a value other than 0 or null is first detected, sets an effective number T which can be counted from the starting point (t=0) of the address, and stores the effective number T in the RAM  106 .  
         [0153]    As is known from FIG. 4, because the time when a value other than 0 is first detected in the operating main machine record figures y(t) is July 2001, if the starting point of the address is February 2001, the effective number T is 6.  
         [0154]    (Step m 3 c) Forecast mode control step (S 806 )  
         [0155]    One forecast method is selected from two forecast methods.  
         [0156]    (Forecast method  1 ) Steps m 3 a 1 , m 3 a 2 , m 3 a 3 , and m 3 a 4  are executed.  
         [0157]    (Forecast method  2 ) Steps m 3 b 1  and m 3 b 2  are executed.  
         [0158]    As will be described later, because forecast method  1  requires a certain number of data such as the main machine sales record/schedule figures x(t), the operating main machine record figures y(t), or the like, forecast method  1  is not suited to a case in which there is little data, and there are a large number of cases to which forecast method of forecast method  2  is suited. The forecast method may be set in advance (manual forecast mode), or, as follows, the forecast method may be automatically selected (automatic forecast mode).  
         [0159]    In other words, when the effective number T stored in the RAM  106  is equal to or greater than a threshold value N, the CPU  101  selects forecast method  1  by judging that there are sufficient data for forecast method  1 . On the other hand, when the effective number T is less than or equal to the threshold value N, the CPU  101  selects the forecast method  2  by judging that there is not sufficient data for forecast method  1  (S 807 ). The threshold value N has been stored in advance in the RAM  106  via the input unit  102  or the network interface  107  by the user.  
         [0160]    For example, when N=24, if the effective number T is equal to or greater than 24, forecast method  1  is selected, and if the effective number T is less than 24, forecast method  2  is selected.  
         [0161]    There are a large number of cases in which forecast method  2  is selected when sufficient data cannot be obtained or at the time of simulation at the sales scheduling stage.  
         [0162]    Generally, forecast method  1  has a higher accuracy of forecast than forecast method  2 . In such a case, forecast method  2  is forcibly selected as a manual forecast mode. However, in certain cases, even when there is sufficient data, there are cases in which the accuracy of forecast method  2  is higher than that of forecast method  1 . In such cases, the manual forecast mode or the automatic forecast mode is appropriately used.  
         [0163]    (Step m 3 a 1 ) Compensating step by delay coefficient (forecast method  1 ) (S 809 )  
         [0164]    A time difference (delay coefficient) arises from the time of actual sale of the main machine to the time of installing (operating) the main machine. Namely, there is a delay coefficient d between the main machine sales record/schedule figure x(t) and the main machine sales record figure y(t). If this time difference is considered, a more accurate forecast is possible.  
         [0165]    Hereinafter, a method for calculating the delay coefficient d will be described.  
         [0166]    First, the install diffusion coefficient J(t) is set.  
         [0167]    [0167]FIG. 14 shows one example of the install diffusion coefficients J(t) inputted in advance in the RAM  106 . The abscissa is time, and the ordinate shows the install diffusion coefficients J(t). In the present embodiment, the time of the abscissa is in units of months, but it goes without saying that the time may be in units of years, in units of weeks, or in units of days.  
         [0168]    The install diffusion coefficient J(t) shows the probability of time in which the main machine sales record/schedule figures x(t) will be installed in the future. Therefore, by multiplying the main machine sales record/schedule figure x(t) of each month and the install diffusion coefficient J(t) stored in the RAM  106  by the CPU  101 , it can be known whether the main machines which were sole (were scheduled to be sold) in that month are installed. The time integral of the install diffusion coefficient J(t) is 1.  
         [0169]    [0169]FIG. 15 is a table showing monthly installed machine figures and installed machine total figures in the present embodiment.  
         [0170]    July 2001 will be described as an example. The main machine sales record/schedule figure x(t) of July 2001 is 53. All these 53 machines are not installed in the market immediately after being sold, and are gradually installed over time. The install diffusion coefficient J(t) expresses this state. Because the install diffusion coefficient J(t) of one month after sale is 0.1, it can be supposed that 10 percent of the 53 machines (5.3 machines) will be installed. Because the install diffusion coefficient J(t) of two months later is 0.15, it can be supposed that 7.95 machines will be installed in this term among the 53 machines. In the same way, the number of machines which will be installed in the third month and months thereafter as well are calculated.  
         [0171]    A similar calculation is applied to the monthly main machine sales record/schedule figures x(t). Further, for each month, the installed machine total figure is determined by totaling up the installed machine figures.  
         [0172]    An arbitrary fixed point is then determined. For example, June is the fixed point. 68 which is the main machine sales record/schedule figures x(t) of June is smaller than 111.1 which is the installed machine total figure. This means that the actual operating figures do not follow the forecast figures. Next, the installed machine total figures is shifted by one month in the future direction, and it is used as the temporary installed machine total figure. The temporary installed machine total figure of June becomes 66.45, and 68 which is the main machine sales record figure y(t) followed 66.45 which is the installed machine total figure (forecast figure). The one month which is the shifting amount is the time difference (delay coefficient) d.  
         [0173]    The x(t) is shifted in the future direction (the direction in which t increases) by a time difference d determined from the main machine sales record/schedule figures x(t) and the operating main machine record figures y(t). The shifted value newly serves as x(t), and by executing following forecast process, a more accurate forecast is possible. It goes without saying that the process computing the time differenced and the shifted x(t) is carried out by the CPU  101  on the basis of the program.  
         [0174]    The shifted x(t) is defined thereafter as the installed figure.  
         [0175]    (Step m 3 a 2 ) Remaining rate function calculating step and operating main machine forecast figure calculating step (forecast method  1 ) (S 810 )  
         [0176]    The remaining rate function S(t) is determined. The remaining rate function S(t) is a function showing the rate of the operating main machine figure t months later with respect to the installed main machine figure. When all of the installed main machines are operating, the remaining rate is 1, and when half of the installed main machines are operating, the remaining rate is 0.5.  
         [0177]    [0177]FIG. 5 is a graph showing remaining rate functions at installation time A, installation time B, and installation time C.  
         [0178]    The abscissa of FIG. 5 is time t, and the ordinate shows the remaining rate. The concept of the forecast method of the operating figure here is that the same main machine model of the same sales area (forecast process unit) remains at “the same” remaining rate regardless of when it was installed. That is, although the same main machine model of the same sales area is respectively installed at different times which are installation time A, installation time B, and installation time C, the remaining rate functions thereof are common.  
         [0179]    Accordingly, the operating main machine figure at t is the sum of the remaining number of machines of the previous installed number of machines. This relationship is also established in the sales figures in sales scheduling. Accordingly, the operating main machine record figure y(t) at time t can be expressed by the following formula.  
                 y                   (   t   )       =         ∫   0   t          S                   (     t   -   τ     )          x        (   τ   )               τ         +     e        (   t   )                              (     Formula                 2     )                               
 
         [0180]    e(t) is the error at time t. Because the operating main machine record figures y(t) and the main machine sales record/schedule figures x(t) are already known up to the effective number T, Se expressing the sum of squares of the error e(t) is expressed as follows.  
               Se   =         ∫   0   T              e        (   t   )       2             t         =       ∫   0   T              (       y        (   t   )       -       ∫   0   t            S        (     t   -   τ     )            x        (   τ   )               τ           )     2             τ                                (     Formula                 3     )                               
 
         [0181]    Further, a remaining rate function S(t) making the sum of squares of error Se be a minimum is analytically or numerically determined. There are a large number of cases in which it is difficult to analytically determine the remaining rate function S(t) by formula 3, and generally, for example,  
         S(t)=e ωt     γ     
         [0182]    and constants ω and r are determined by numerical calculation. In this case, the remaining rate function S(t) is not limited to the function, and may be any function provided that it is a function which is suited to the object model.  
         [0183]    The above-described process is realized as follows by the CPU  101  in accordance with the program. Namely, the CPU  101  sets the above-described formula (formula 3) on the RAM  106  on the basis of the operating main machine record figures y(t), the remaining rate function S(t), and the main machine sales record/schedule figures x(t) stored in the RAM  106 . Further, a scale width t required for the numerical calculation is set, and S(t) is determined by the numerical calculation such that the sum of squares Se of the error becomes a minimum when calculation is carried out from time 0 to T.  
         [0184]    [0184]FIG. 6 is a graph showing the relationships of the installed main machine figures and the operating main machine figures.  
         [0185]    The line shown by the broken line in the figure shows the operating main machine record figures y(t). Further, the starting points of the lines which extend while attenuating and whose starting points are the respective months, are respectively the installed figures of the respective months. On the basis of formula 3, the remaining rate function S(t) making the sum of squares Se of the error be a minimum is determined, and the remaining number of machines is determined from the remaining rate function S(t) and the main machine sales record/schedule figure x(t).  
         [0186]    In accordance with this forecast method (forecast method  1 ), when there are sufficient main machine sales record/schedule figures x(t), an extremely accurate and stable forecast is possible. (Step m 3 a 3 ) Failure rate probability density function calculating step (forecast method  1 ) (S 811 )  
         [0187]    A failure rate probability density function f(t) is determined. The failure rate probability density function is a function in which a failure total function (F(t)=1−S(t)) is differentiated by time, and is given by the following formula.  
               f        (   t   )       =     -            S        (   t   )              t                 (     Formula                 4     )                               
 
         [0188]    The CPU  101  computes the remaining rate function S(t) on the basis of the S(t) computed at (Step m 3 a 2 ) stored in the RAM  106 . The failure rate probability density function f(t) is a function showing the disappearance rate of the main machines in the market.  
         [0189]    (Step m 3 a 4 ) Average lifetime, standard deviation, and variation coefficient calculating step (forecast method  1 )  
         [0190]    An average lifetime μ, a standard deviation σ of the average lifetime, and a variation coefficient φ of the average lifetime are determined.  
             μ   =       ∫   0   ∞            tf        (   t   )                          t                 (     Formula                 5     )                               
 
         σ={square root}{square root over (∫ 0   ∞ ( t −μ) 2   f ( t ) dt )}  (Formula 6)  
         [0191]    [0191]             φ   =     σ   μ             (     Formula                 7     )                                 
         [0192]    These average lifetime μ, standard deviation σ of the average lifetime, and variation coefficient φ of the average lifetime are successively computed by the CPU  101  on the basis of the failure rate probability density function f(t) stored in the RAM  106 . These values are values showing the disappearance state of the main machines, and are utilized for development, production, marketing, or the like.  
         [0193]    [0193]FIG. 16 is one example showing changes in the remaining rate functions when the average lifetime μ and the variation coefficient φ are changed.  
         [0194]    It is known that the larger the average lifetime μ which is the ordinate in the figure, the larger the lifetime of the main machine.  
         [0195]    It is known that the larger the variation coefficient φ which is the abscissa in the figure, the more the remaining rate function becomes flat and smoothly disappears. On the other hand, it is known that the smaller the variation coefficient φ, the more the change in the remaining rate function is steep and suddenly disappears at a given point in time.  
         [0196]    In this way, by investigating the average lifetime μ and the variation coefficient φ, the evaluation of the performance of the main machine (how does it disappear), the introduction timing of a new product, the timing of replacement, or the like can be investigated, and strategic business is possible.  
         [0197]    Hereinafter, the feature of the present invention will be again described. The present invention has a feature which is not the forecast of “sales figures”, but the forecast of “operating figures”. This has an effect in businesses in which a profit is made by maintenance after a main machine such as a printer, a copy machine, or the like is sold (businesses targeting the after market).  
         [0198]    (Step m 3 b 1 ) Failure rate probability density function calculating step (forecast method  2 ) (S 812 )  
         [0199]    Generally, when there is not a sufficient number of data of the main machine sales record/schedule figures x(t), the accuracy and stability of the forecast are not good. In this case, the above-described failure rate probability density function is determined from parameters set in advance.  
         [0200]    The parameters required for calculation of the failure rate probability density function are the average lifetime μ and the variation coefficient φ of the average lifetime (or the standard deviation σ of the average lifetime). These parameters are inputted by any of the methods of the A, B, C.  
         [0201]    Further, the main machine sales record/schedule figures x(t) are shifted (compensated) in the future direction by the delay coefficient d, and are newly set as the installed figures x(t).  
         [0202]    The delay coefficient d is inputted by any of the methods of the A, B, C.  
         [0203]    The CPU  101  then determines the failure rate probability density function f(t) by numerical calculation from formula 4 through formula 7 on the basis of μ and φ (or σ) inputted and stored in the RAM  106 .  
         [0204]    (Step m 3 b 2 ) Remaining rate function calculating step (forecast method  2 ) (S 814 )  
         [0205]    As is clear from formula 4, the CPU  101  determines the remaining rate function S(t) from the failure rate probability density function f(t) by using the following formula.  
               S        (   t   )       =     1   -       ∫   0   t            f        (   τ   )                          τ                   (     Formula                 8     )                               
 
         S(0)=1  (formula 9)  
         [0206]    (Step m 4 ) Operating main machine forecast figure calculating step (S 814 )  
         [0207]    As is clear from formula 1, the operating main machine forecast figure is as follows.  
         ŷ(t)  
         [0208]    is as follows.  
                 y   ^          (   t   )       =       ∫   0   t            S        (     t   -   τ     )            x        (   τ   )                          τ                 (     Formula                 10     )                               
 
         [0209]    [0209]FIG. 6 is a graph showing the relationships of the installed main machine figures and the operating main machine forecast figures/operating main machine record figures.  
         [0210]    The line shown by the broken line in the figure shows the operating main machine record figures y(t). Further, the starting points of the lines which extend while attenuating at the respective months are respectively the installed figures x(t) The CPU  101  takes the sum of the remaining number of machines for each month, and uses the sum as the operating main machine forecast figure of each month. This is shown by the one-dot chain line in the figure.  
         [0211]    (Step m 5 ) Various coefficients calculating step  
         [0212]    The CPU  101  determines a reliability coefficient h of the operating main machine forecast figure, a standard error s, a disappearance date Ed in the market, and an aging coefficient Ag on the basis of the various types of parameters stored in the RAM  106 .  
             h   =     T   μ             (     Formula                 11     )                               
 
         [0213]    Generally, the forecast reliability coefficient h is not calculated at the time of manual forecast mode.  
         [0214]    The forecast reliability coefficient h is an index expressing stability/accuracy of the forecast model, and if the value is greater than 1, a stable forecast result can be obtained.  
         [0215]    Further, the standard error s can be determined by the following formula.  
             s   =         1   T        Se               (     Formula                 12     )                               
 
         [0216]    The standard error s is an index expressing the forecast accuracy, and the smaller the value thereof, the better.  
         [0217]    The disappearance date Ed in the market expresses the time (date) at which the main machines in the forecast model will probably disappear from the market. The disappearance date is the time at which the operating main machine forecast figure  
         ŷ(t)  
         [0218]    becomes 0. However, instead of the time when it becomes 0, the time at which the operating main machine forecast figure  
         [0219]    ŷ(t)  
         [0220]    becomes less than a certain threshold value may be the disappearance time.  
         [0221]    The aging coefficient Ag can be determined by following formula.  
             Ag   =         ∫   0   C              y   ^          (   t   )                          t             ∫   0   ∞              y   ^          (   t   )                                   (     Formula                 13     )                               
 
         [0222]    C is time corresponding to the time when the forecast process is executed. This value is an index showing a state in which the main machine “is aging” in the market. If it is immediately after the main machines are introduced onto the market, the aging coefficient Ag is 0, and if the main machines disappear from the market, the aging coefficient Ag becomes 1.  
         [0223]    The aging coefficient Ag is an important index in that it expresses the operating situation of the main machines in the market.  
         [0224]    2. Forecast of main machine average PV (print volume) (average PV forecast block)  
         [0225]    [0225]FIG. 9 is a flowchart showing a process flow at the time of forecasting an average PV of the main machines.  
         [0226]    Constants, variables, and functions used in the present process block are as follows.  
         [0227]    t: Unit-time in which data was observed (for example, month), and here, the main machine sales start date is the origin 0.  
         [0228]    p(t): Average PV record of t month  
         [0229]    q(t): Average PV dummy of t month  
         [0230]    v(t): Average PV record dummy of t month  
         [0231]    {circumflex over (v)}(t): Average PV forecast of t month  
         [0232]    R: Multiple correlation coefficient  
         [0233]    s: Standard error  
         [0234]    (Step p 0 ) Average PV record dummy calculating step (S 902 )  
         [0235]    The CPU  101  generates the average PV record dummy v(t) on the basis of the following formula from the average PV record p(t) and the average PV dummy q(t) inputted and stored in the RAM  106 .  
         [0236]    (Formula 14)  
         [0237]    if p(t)=null then v(t)=q(t)  
         [0238]    if p(t)≠null then v(t)=p(t)  
         [0239]    The average PV record p(t) can be obtained by a service engineer visiting a customer and confirming. When there are no records or even when records exist, the average PV dummy q(t) is set in advance when the data cannot be relied on. Note that the average PV is the print volume of one machine per one unit-time. In the present embodiment, the unit-time is units of months. However, it goes without saying that the unit-time may be units of years, units of weeks, units of days, or the like.  
         [0240]    (Step p 1 ) Object sales area and object model selecting step (S 903 )  
         [0241]    In the same way as in step m 1 , a sales area and a main machine model (forecast process units) for which forecast process is to be executed are selected. The forecast process units which are selected may be plural. The selection is realized by the above-described “input”.  
         [0242]    (Step p 2 ) Average PV record and average PV dummy retrieving step (S 904 )  
         [0243]    In the same way as in step m 2 , the average PV record p(t) and the average PV dummy q(t) accumulated in time series are read for each forecast process unit. Namely, the average PV record p(t) and the average PV dummy q(t) inputted are stored in the RAM  106 .  
         [0244]    (Step p 3 ) Average PV forecasting step (S 905 )  
         [0245]    Forecasting of the average PV has the following three modes.  
         [0246]    (1) Forecast mode  1 : Nonlinear regression is applied to the average PV record p(t).  
         [0247]    (2) Forecast mode  2 : Nonlinear regression is applied to the average PV dummy q(t).  
         [0248]    (3) Forecast mode  3 : Nonlinear regression is applied to the average PV record dummy v(t).  
         [0249]    The most appropriate forecast mode is selected from among the above-described three forecast modes by taking the reliability of the data or the like into consideration. The “selection” may be carried out via the input unit  102  by the user, or may be carried out by the CPU  101  on the basis of a certain condition (for example, the number of data or the like).  
         [0250]    As an example, the case of the forecast mode  3  will be described. The average PV record dummy v(t) is the following model formula.  
           v ( t )= ae   bt     γ     +e ( t )  (Formula 15)  
         [0251]    It goes without saying that the model formula is not limited to formula 15. e(t) is the error at time t. If it is supposed that T is the effective number of the v(t), the sum of squares Se of the error can be expressed as  
             Se   =       ∫   0   T              e        (   t   )       2                        t                 (     Formula                 16     )                               
 
         [0252]    and coefficients b, r, a are determined such that the sum of squares Se of the error is made to be a minimum. The CPU  101  determines the coefficients b, r, a by using numerical analysis (for example, the method of least squares) . From the determined b, r, a, the average PV forecast  
         {circumflex over (V)}(t)  
         [0253]    is as follows.  
         {circumflex over (v)}(t)=ae bt     γ     (Formula 17)  
         [0254]    Note that it goes without saying that it may be linear regression in accordance with the model.  
         [0255]    (Step p 4 ) Multiple correlation coefficient and standard error calculating step  
         [0256]    In order to evaluate the nonlinear regression (linear regression) in step p 3 , the CPU  101  calculates the multiple correlation coefficient R and the standard error s on the basis of various types of parameters stored in the RAM  106  by using the following formulas.  
             R   =         ∫   0   T            (         v   ^          (   t   )       -       v   _          (   t   )       -     v   _       )                        t               ∫   0   T              (         v   ^          (   t   )       -     v   _       )     2                        t            ∫   0   T              (       v        (   t   )       -     v   _       )     2                        t                         (     Formula                 18     )               (       v   _     =       1   T            ∫   0   T            v        (   t   )                          t             )           (     Formula                 19     )               s   =         1   T        Se               (     Formula                 20     )                               
 
         [0257]    (3. Forecast total PV of main machines (total forecast PV block)  
         [0258]    [0258]FIG. 10 is a flowchart showing a process flow at the time of forecasting the total PV of the main machines.  
         [0259]    Constants, variables, and functions used in the present process are as it follows.  
         [0260]    t: Unit-time (for example, month)  
         [0261]    ŷ(t): Operating main machine forecast figure of t month  
         [0262]    {circumflex over (v)}(t): Average PV forecast of t month  
         [0263]    {circumflex over (V)}(t): Total PV forecast of t month  
         [0264]    Ag: Aging coefficient considering PV  
         [0265]    (Step s 1 ) Total PV forecast calculating step (S 1002 )  
         [0266]    Average PV forecast {circumflex over (V)}(t) may be calculated in time-series based on the following formula.  
         {circumflex over (V)}(t)={circumflex over (v)}(t)ŷ(t)  (Formula 21)  
         [0267]    The above-described computation is realized by the CPU  101  on the basis of the parameters stored in the RAM  106 .  
         [0268]    (Step s 2 ) Aging coefficient calculating step (S 1003 )  
         [0269]    The CPU  101  determines the aging coefficient Ag to which PV is added by using the following formula.  
             Ag   =         ∫   0   C              V   ^          (   t   )                          t             ∫   0   ∞              V   ^          (   t   )                          t                   (     Formula                 22     )                               
 
         [0270]    C is a value in which the time (date) of the forecast process day has been converted into an address. The value of the aging coefficient Ag is an index showing the state in which the main machines to which PV is added are aging in the market. If it is a state in which the main machines are first introduced, the aging coefficient Ag is 0, and when the main machines disappear, the aging coefficient Ag is 1.  
         [0271]    4. Demand forecast of supply (supply forecast block)  
         [0272]    [0272]FIG. 11 is a flowchart showing a process flow at the time of forecasting demand for a supply.  
         [0273]    Constants, variables, and functions used in the present process are as follows.  
         [0274]    t: Unit-time (for example, month)  
         [0275]    z(t): Supply sales record of t month  
         [0276]    {circumflex over (z)}(t): Supply sales forecast of t month  
         [0277]    {circumflex over (V)}(t): Total PV forecast of t month for a main machine model using a supply model to be forecasted  
         [0278]    T: Term in which record data has been observed  
         [0279]    When 0≦t≦T, there are records, and when T≦t, there are forecasts  
         [0280]    C: Endurance print volume  
         [0281]    H: Diffusion range (delay width)  
         [0282]    p(i): Diffusion density coefficient (0≦i≦H)  
         [0283]    u(i): Seasonal variation coefficient (0≦i≦11)  
         [0284]    Ed: Disappearance time  
         [0285]    Ag: Aging coefficient  
         [0286]    R: Multiple correlation coefficient  
         [0287]    s: Standard error  
         [0288]    (Step k 1 ) Object sales area and object model selecting step (S 1102 )  
         [0289]    A sales area and a supply model for which forecast process is to be carried out are selected. The sales area and the supply model which are selected may be plural. The “selection” is realized by any of the methods of the A, B, C.  
         [0290]    [0290]FIG. 7 is a table showing correspondences of sales areas and the supply models.  
         [0291]    “◯”s in the figure show that the supply models are sold in the sales areas.  
         [0292]    (Step k 2 ) Supply sales record and total PV forecast retrieving step (S 1103 )  
         [0293]    The supply sales record z(t) accumulated in a time series and the total PV forecast of the main machine using the supply  
         {circumflex over (V)}(t)  
         [0294]    are inputted for each one supply model/one sales area (each supply forecast process unit), and are stored in the RAM  106 . If the supply of interest is used for a plurality of main machines, the sum of the total PV forecast of each main machine  
         {circumflex over (V)}(t)  
         [0295]    is newly made to be  
         {circumflex over (V)}(t)  
         [0296]    For example, in FIG. 2 and FIG. 7, when copy machine A ( 201 ) and printer B ( 202 ) utilize a common toner C ( 707 ) in Japan, the sales area of the supply forecast process unit is Japan, and the supply model is the toner C, and total PV forecast  
         {circumflex over (V)}(t)  
         [0297]    is a value in which the total PV forecast of copy  
         {circumflex over (V)}(t)  
         [0298]    and the total PV forecast of printer B  
         {circumflex over (V)}(t)  
         [0299]    are added together.  
         [0300]    (Step k 3 ) Forecast mode control step (S 1104 )  
         [0301]    In the same way as in a case in which the operating main machine figures are forecasted, one forecast method is selected from the following two forecast methods.  
         [0302]    (Forecast method A) Steps k 3 a 1  and k 3 a 2  are executed.  
         [0303]    (Forecast method B) Step k 3 b 1  is executed.  
         [0304]    Because forecast mode A requires a certain number of data of the record data, forecast mode A is not suited to a case in which there is little data, and there are a large number of cases in which the forecast method of forecast method  2  is suited. The forecast method may be set in advance (manual forecast mode), or as follows, the forecast method may be automatically selected (automatic forecast mode).  
         [0305]    In other words, when the effective number T is equal to or greater than a certain threshold value N, it is judged that there are sufficient data for forecast method  1 , and forecast method  1  is selected. On the other hand, when the effective number T is less than the threshold value N, it is judged that there is not sufficient data for forecast method  1 , and forecast method  2  is selected (S 1105 ). The judgement is realized by the CPU  101 .  
         [0306]    For example, with N=24, if the effective number T is 24 or more, forecast method  1  is selected, and if the effective number T is less than 24, forecast method  2  is selected.  
         [0307]    Further, in the above-described example, the forecast method is selected in accordance with the effective number T, but the forecast method may be selected by using another parameter.  
         [0308]    There are a large number of cases in which forecast method  2  is selected when sufficient data cannot be obtained or at the time of simulation at a sales scheduling stage.  
         [0309]    In the same way as in the case in which the operating main machine figures are forecasted, the forecast accuracy of forecast method  1  is higher than that of forecast method  2 . However, in certain cases, even if there are sufficient data, there are cases in which the accuracy of forecast method  2  is higher than that of forecast method  1 . In such cases, the manual forecast mode is selected.  
         [0310]    (Step k 3 a 1 ) Supply sales record smoothing step (S 1106 )  
         [0311]    The supply sales record z(t) is smoothed. The CPU  101  realizes smoothing by applying a moving average (for example, a moving average of 12 months) to the supply sales record z(t) stored in the RAM  106 . The smoothed supply sales record z(t) serves as a new supply sales record z(t). Because the smoothing is for absorbing variations due to errors or seasonal variations, provided that it is a method enabling smoothing, the smoothing is not limited to applying a moving average.  
         [0312]    (Step k 3 a 2 ) Endurance print volume and diffusion coefficient calculating step (S 1107 )  
         [0313]    An endurance print volume per unit-time C and a diffusion density function p(t) are determined from the smoothed supply sales record z(t) and the total PV forecast  
         {circumflex over (V)}(t)  
         [0314]    The endurance print volume is PV taken per one unit of unit-time, and the diffusion density function p(t) is the probability density that a supply sold during a time period H (diffusion range, delay width) before a certain time will be consumed during the time period H.  
         [0315]    In the forecast model of the supply in this case, the endurance print volume C of the same supply model of the same sales area is constant at all times, and follows the same diffusion density function. This assumption is one of the features of the present invention.  
         [0316]    Accordingly, the forecast model of the supply can be expressed by the following formula.  
                 V   ^          (   t   )       =       C          ∫     t   -   H     t            p        (     t   -   τ     )            z        (   τ   )                          τ           +     e        (   t   )                 (     Formula                 23     )                               
 
         [0317]    Here, p(t) is the probability density function. p(t) is defined in the section 0≦t≦H, and satisfies  
                 ∫   0   H            p        (   t   )                          t         =   1           (     Formula                 24     )                               
 
         [0318]    and  
         [0319]    p(t)≧0 (Formula 25). Further, e(t) is the error at time t. The sum of squares Se of the error showing the sum of squares of the error e(t) can be expressed as follows.  
             Se   =         ∫   0   T              e        (   t   )       2                        t         =       ∫   0   T              (         V   ^          (   t   )       -     C          ∫     t   -   H     t            p        (     t   -   τ     )            z        (   τ   )                          t             )     2             t                   (     Formula                 26     )                               
 
         [0320]    (Formula  26 )  
         [0321]    The endurance print volume C and the diffusion density function p(t) making the sum of squares Se of the error be a minimum under the conditions of formula  24  and formula  25  are determined by numerical analysis by the CPU  101 . Note that, at this time, it is supposed that the diffusion range (delay width) H has been inputted in advance.  
         [0322]    (Step k 3 b 1 ) Endurance print volume and diffusion coefficient setting step (S 1109 )  
         [0323]    Because it is difficult to determine a stable endurance print volume C and probability density function p(t) when the number of data of the supply sales record z(t) is few, the endurance print volume C, the diffusion density function p(t), and the diffusion range (delay width) H are inputted in advance.  
         [0324]    (Step k 4 ) Supply sales forecast step (S 1110 )  
         [0325]    The sales forecast of the supply (demand forecast) determines  
         {circumflex over (Z)}(t).  
         [0326]    The endurance print volume C, the diffusion density function p(t), and the diffusion range H determined in step k 3 a 1 , or the endurance print volume C, the diffusion density function p(t), and the diffusion range H set by step k 3 b 1 , are substituted into formula  23 , and the z(t)s are successively determined such that the Se is made to be a minimum.  
         [0327]    The sales forecast of the supply is  
         {circumflex over (Z)}(t).  
         [0328]    (Step k 5 ) Seasonal variation compensating step (S 1111 )  
         [0329]    Compensation process by seasonal variations is carried out. What is called seasonal variation here is that the sales figures vary in accordance with the season such as, in the example of the image forming device in the present embodiment, the print volume increases at the Christmas season or at the time when accounts are settled.  
         [0330]    First, it is judged whether seasonal variation compensation is to be carried out or not. This judgement may be realized by the CPU  101  noticing a certain condition (for example, the number of data of a certain parameter stored in the RAM  106 ), or may be determined by the user via the input unit  102 . When it is judged that there is seasonal variation, sales forecasting of the supply in consideration of the seasonal variation is carried out. When it is judged that there is no seasonal variation, sales forecasting of the supply in consideration of the seasonal variation is not carried out.  
         [0331]    When sales forecast of the supply in consideration of the seasonal variation is carried out, the following process is carried out.  
         [0332]    When a seasonal variation is considered, there is the need to determine a seasonal variation coefficient u(i) . The seasonal variation coefficient u(i) is calculated from record data, and may be inputted in advance. It is appropriately selected whether to use a seasonal variation coefficient u(i) calculated from the record data or a seasonal variation coefficient u(i) set in advance. The selection may be automatically carried out on the basis of a certain condition by the CPU  101 , or may be inputted. The selection method has the following two modes.  
         [0333]    (1) Automatic calculating mode  
         [0334]    When the effective number T stored in the RAM  106  is equal to or greater than a threshold value N (for example, N=24) also stored in the RAM  106 , the seasonal variation coefficient is calculated from the record data. A maximum natural number n satisfying 12n≦T is found among the most recent time data, and the seasonal variation coefficient is determined from the data from time T−12n+1 to T. Here, for convenience, it is supposed that T−12n+1 is the starting point 0 and that T is the time of 12n−1.  
         [0335]    The CPU  101  determines a variation ratio g(t) from the period stored in the RAM  106  by using following formula.  
               g        (   t   )       =         z        (   t   )       -       z   ^          (   t   )             z   ^          (   t   )                 (     Formula                 27     )                               
 
         [0336]    When the seasonal variation is extracted, the magnitude of the variation largely varies when the absolute quantity of that month is large, and varies slightly when the absolute quantity is small. For example, if the sales figures (basic demand figures) is 100 in January 2000 and is 1000 in January 2001, because there are a large number of cases in which the variation quantity varies to 10 and 100 in correspondence therewith, it should be taken at the variation ratio. In this example, they are 10/100 and 100/1000, and the both are 0.1. Accordingly, when a periodic variation is extracted, there are a large number of cases in which taking by the variation ratio in order to not depend on the magnitude of the absolute quantity is more suited to actuality (normalization). To this end, a trend value (basic demand figure) is removed from an observed value, and normalization is carried out by dividing it by the trend value. Further, the CPU  101  determines the seasonal variation coefficient u(i) by the following formula.  
               u        (   i   )       =       1   n            ∑     j   =   0       n   -   1            g        (     i   +     12      j       )                   (     Formula                 28     )                               
 
         [0337]    The above-described formula determines the average of the variation ratios of the respective months. The average of the variation ratios for each month from January to December is determined, such as, for example, the variation coefficient of May is an average of the variation ratios of May 1998, May 1999, and May 2000, and this serves as the seasonal variation coefficient. Because the variation ratio is determined so as to not depend on the absolute quantity in (formula 27), taking the average is important, and the accuracy is improved even more by taking the average. However,  
         0≦i≦11  (Formula 29).  
         [0338]    The sales forecast after compensating the seasonal variation  
         {circumflex over ({circumflex over (Z)})}(t)  
         [0339]    is determined by the following formula.  
           {circumflex over ({circumflex over (Z)})} ( t )= {circumflex over (Z)} ( t )(1 +u ( mod ( t, 12)))  Formula 30)  
         [0340]    The above formula is a formula determining the sales forecast in which the sales forecast (trend value, basic demand figure) is multiplied by the seasonal variation coefficient of each month and the seasonal variation is added thereto. This computation is realized by the CPU  101 .  
         [0341]    For example, the sales forecast of May 2000 is to determine a value in which the seasonal variation coefficient of May is multiplied by the sales forecast of May 2000, and the seasonal variation is added.  
         [0342]    Note that mod(t,12) expresses the remainder when t is divided by 12. The determined  
         {circumflex over ({circumflex over (z)})}(t)  
         [0343]    newly serves as  
         {circumflex over ({circumflex over (z)})}(t).  
         [0344]    On the other hand, when the effective number T is less than a certain threshold value N, u(i) is a seasonal variation coefficient of i+1 month given in advance. The value after compensating the seasonal variation is determined by formula  30  by using u(i) given in advance, and the determined  
         {circumflex over ({circumflex over (Z)})}(t)  
         [0345]    newly serves as  
         {circumflex over ({circumflex over (Z)})}(t).  
         [0346]    (2) Manual mode  
         [0347]    In the automatic calculating mode, it is automatically judged whether the seasonal variation coefficient is to be calculated or a value given in advance is to be used. However, there are cases in which automatic judgement is inconvenient. In such cases, whether the seasonal variation coefficient is to be calculated or a value given in advance is to be used is determined in advance by the manual mode.  
         [0348]    In this way, by making it possible to select whether the automatic calculating mode or the manual mode is to be used, more flexible and mobile forecast is possible.  
         [0349]    (Step k 6 ) Various coefficients calculating step  
         [0350]    Next, the CPU  101  determines the disappearance date Ed, the aging coefficient Ag, the multiple correlation coefficient R, and the standard error s of the supply on the basis of various types of parameters stored in the RAM  106 .  
         [0351]    The disappearance date Ed is a time (date) when  
         {circumflex over (Z)}(t)  
         [0352]    becomes 0. This expresses the time at which the demand for the supply on the market will probably disappear.  
         [0353]    Instead of that  
         {circumflex over (Z)}(t)  
         [0354]    becoming 0, a time at which it is less than a certain threshold value may serve as the time Ed at which the demand disappears.  
         [0355]    The aging coefficient can be calculated by the  
             Ag   =           ∫   0   C              z   ^          (   t   )                          t             ∫   0   ∞              z   ^          (   t   )                          t           .             (     Formula                 31     )                               
 
         [0356]    C is an address corresponding to the time when the forecast process is executed. This is an index showing how much demand is there at the present point in time with respect to all of the demand for the supply in the market. When the aging coefficient Ag is 0, it shows that demand does not arise at the present point in time, and when the aging coefficient Ag is 1, it shows that demand has already ended at the present point in time.  
         [0357]    The multiple correlation coefficient R is determined by the following formula.  
             R   =         ∫   0   T            (         z   ^          (   t   )       -       z   _                 )          (       z        (   t   )       -     z   _       )                        t               ∫   0   T              (         z   ^          (   t   )       -     z   _       )     2                        t            ∫   0   T              (       z        (   t   )       -     z   _       )     2                        t                         (     Formula                 32     )                               
 
         [0358]    Note that  
               z   _     =       1   T            ∫   0   T          z        (   t   )                          t     .                   (     Formula                 33     )                               
 
         [0359]    The multiple correlation coefficient R is an index expressing the forecast accuracy. The closer R is to 1, the better the accuracy, and the closer R is to 0, the worse the accuracy.  
         [0360]    The standard error s is determined by the following formula.  
             s   =           1   T        Se       .             (     Formula                 34     )                               
 
         [0361]    The standard error s is an index expressing the forecast accuracy, and the closer S is to 0, the better the accuracy.  
         [0362]    In the present embodiment, the unit-time is a month. However, the unit-time may be units of years, units of days, or units of weeks. Further, the process does not proceed at each unit-time, and may be carried out at each arbitrary time. Namely, the process may proceed at an inconstant interval such as for one month→for two months→for one month→for three months.  
         [0363]    As described above, in accordance with the present invention, schedule planning support of a supply business or the like can be carried out on the basis of the demand forecast result for the supply.  
         [0364]    5. Display of Forecast result  
         [0365]    The forecast result of the operating main machine figures and the demand forecast result of the supply described above are displayed in a table format and/or a graph format on the output unit  103  by control by the CPU  101 .  
         [0366]    [0366]FIG. 36 shows a screen when the demand forecast result of a supply is displayed on the output unit  103 .  
         [0367]    In the same way, it goes without saying that various types of coefficients (for example, the reliability coefficient h, the disappearance date Ed, the aging coefficient Ag, or the like) may also be displayed on the output unit  103 .  
         [0368]    6. Switching of Forecast method  
         [0369]    In the conventional forecast method and the above-described forecast method, because a single forecast method is used throughout the entire sales term of the product, when the sales demand varies due to a cause which the forecast method does not suppose, there are cases in which accuracy of the sales forecast deteriorates.  
         [0370]    In particular, with regard to the following three points, it has been difficult for the conventional forecast method to realize a precise forecast.  
         [0371]    A. Pipeline fill  
         [0372]    In the industry of supplies or the like of business machines or peripheral equipment of personal computers, because there is the obligation to exactly supply to the end users, there are a large number of cases in which a commission merchant or a sales store has a stock of the supply. The demand for keeping the stock full is generally called pipeline fill. Because of the pipeline fill, at the initial term of sales, a characteristic demand which cannot be forecasted by the conventional forecast method arises.  
         [0373]    B. Appearance of Compatible products  
         [0374]    In the industry of supplies or the like of business machines or peripheral equipment of personal computers, there are cases in which compatible products which have compatibility and are manufactured by other manufacturers appear in addition to the supply manufactured by the manufacturer of the main machine such as business equipment or the like. In this case, there are cases in which the sales of the supply manufactured by the manufacturer of the main machine are affected. The conventional forecast method has not been able to forecast sufficiently with respect to such appearance of compatible products.  
         [0375]    C. Supply sales term final stage  
         [0376]    The supplies of business machines or peripheral equipment of personal computers must be sold during the term in which users continue to use the main machine after sale of the main machine has ended. Therefore, in the final stage of the supply sales term, there are cases in which the sales of the supply become unstable due to used products of the business machines or peripheral equipment of personal computers being distributed in markets other than the market supposed by the manufacturer, or the like. The conventional forecast method has not been able to precisely forecast such a final stage of the sales term.  
         [0377]    The present invention is created in order to solve the problems as described above. This will be described in detail on the basis of the figures hereinafter.  
         [0378]    [0378]FIG. 18 is a conceptual view of demand forecast for a supply.  
         [0379]    In the figure, the demand forecast for a supply at a certain point in time which is a transition of the sales record is shown. Hereinafter, a “supply” will be described. However, the “supply” may be a “product”.  
         [0380]    [0380]FIG. 19 is a conceptual diagram of an initial demand forecast for solving the problem of the pipeline fill (A).  
         [0381]    As can be understood by looking at the sales record in FIG. 19, the sales figures, in an initial term of the sales, show movement different from that of the other terms.  
         [0382]    [0382]FIG. 20 is a conceptual diagram of competitor reflected demand forecast for solving the problem of the appearances of compatible products (B).  
         [0383]    As can be understood by looking at the sales record in FIG. 20, the sales figures stray away from the initial demand forecast from a certain point in time (appearance of compatible product).  
         [0384]    [0384]FIG. 21 is a conceptual diagram of a trend demand forecast for solving the problem of the final stage of the sales term.  
         [0385]    As can be understood by looking at the sales record in FIG. 21, in the final stage of the sales term, movement dissociated from the initial demand forecast is shown.  
         [0386]    [0386]FIG. 23 shows a module structure which is for switching forecast methods and which is added to the module structure of the program of FIG. 17.  
         [0387]    (Supply demand forecast module ( 2303 ))  
         [0388]    This is a module executing the above-described demand forecast method of the main machine or the supply, or demand forecast utilizing simple linear (nonlinear) approximation. The supply demand forecast module ( 503 ) assumes that the latest forecast results are always accumulated therein.  
         [0389]    (Supply initial demand forecast module ( 2304 ))  
         [0390]    This is a module realizing supply initial demand forecast (F 2 ) for solving the problem of the pipeline fill of FIG. 19.  
         [0391]    The supply initial demand forecast module is realized on the basis of the following two models.  
         [0392]    (Model  1 ) Main machine accompanying model  
         [0393]    For a constant term from the main machine sales start month (designated by a supply initial demand forecast model master), a coefficient designated by the supply initial demand forecast model master is applied to the main machine sales record/schedule (RPM), and the forecast result is adopted.  
         [0394]    (Model  2 ) Demand forecast proportional model  
         [0395]    For a constant term from the first month of the supply demand forecast (designated by a supply initial demand forecast model master), a coefficient designated by the supply demand forecast model master is applied to the supply demand forecast result (FC 1 ), and the forecast result is adopted.  
         [0396]    (Competitor reflected supply demand forecast module ( 2305 ))  
         [0397]    This is a module realizing the competitor reflected supply demand forecast (F 4 ) for solving the problem of the appearance of a compatible product (B) of FIG. 20.  
         [0398]    Here, the competitor reflected supply demand forecast is a forecast in which a competitor reflected supply coefficient is applied to the supply demand forecast result (FC 1 ) and the calculated result serves as the forecast result. The object term is determined as follows.  
         [0399]    The months after a term (months) of the competitor reflected forecast model master have passed from the first month in which there is the supply sales record (RC), are the competitor reflected supply forecast object term (T(FC 5 )).  
         [0400]    [0400]FIG. 36 is a diagram showing an example of the supply sales record (RC) and the competitor reflected supply forecast object term (T(FC 5 ))  
         [0401]    In the example of FIG. 36, because there is the sales record from March, 1999, the term from February 2001 which is the 24 th  month can be the object term.  
         [0402]    Further, a competitor reflected supply coefficient is arbitrarily set in advance for the competitor reflected model master.  
         [0403]    (Supply trend demand forecast module ( 2306 ))  
         [0404]    This is a module realizing the supply trend demand forecast (F 3 ) for solving the problem of the final stage of the sales term of FIG. 21.  
         [0405]    In the supply demand trend forecast, without using the causal relation with the total PV forecast used for the supply demand forecast, the demand is forecasted by carrying out nonlinear regression analysis or the like on the sales record of the supply itself on a time base.  
         [0406]    The supply which is to be the object is an object for which the sales of the main machine thereof have substantially ended, or is an arbitrarily designated supply.  
         [0407]    (Determination module ( 2307 ))  
         [0408]    It is determined which demand forecast result is suited to the latest record. Differences between the record of the latest past n months and the respective demand forecasts are calculated, and a demand forecast having the smallest difference is selected.  
         [0409]    [0409]FIG. 24 is an overall flowchart of the present invention.  
         [0410]    The supply demand forecast process in S 2401  of the figure is in accordance with the above-described 1. Operating main machine figure forecast, 2. Main machine average PV forecast, 3. Main machine total PV forecast, and 4. Supply demand forecast.  
         [0411]    [0411]FIG. 25 is a flowchart showing details of the supply initial demand forecast process in S 2402  of FIG. 24.  
         [0412]    In S 2501 , the CPU  101  calls up a supply initial demand area/cross master MC from a supply initial demand cross master DB (DB(F)), and writes it into the RAM  106 .  
         [0413]    In S 2502 , the CPU  101  calls up a supply initial demand model master M 11  designated by the MC from a supply initial demand model DB (DB(G)), and writes it into the RAM  106 .  
         [0414]    In S 2503 , the CPU  101  calls up a main machine sales record/schedule RPM from a main machine sales schedule/record DB (DB(H)), and writes it into the RAM  106 .  
         [0415]    In S 2504 , the CPU  101  executes the initial demand forecast (F 2 ).  
         [0416]    In S 2505 , the result of the initial demand forecast (F 2 ) is written in the region of the supply initial demand forecast result FC 3  in the supply initial demand forecast result DB (DB(C)).  
         [0417]    [0417]FIG. 26 is a flowchart showing details of the competitor reflected supply demand forecast process in S 2403  of FIG. 24.  
         [0418]    In S 2601 , the CPU  101  calls up a competitor reflected supply area/cross master MC 4  from a competitor reflected supply cross master DB (DB(K)), and writes it into the RAM  106 .  
         [0419]    In S 2602 , the CPU  101  calls up a competitor reflected supply demand forecast model master M 12  designated by MC 4  from a competitor reflected supply model master DB (DB(L)), and writes it into the RAM  106 .  
         [0420]    In S 2603 , the CPU  101  calls up a supply sales record (RC) from a supply sales record DB (DB(D)), and writes it into the RAM  106 .  
         [0421]    In S 2604 , the CPU  101  creates a competitor reflected supply forecast object term (T(FC 5 )) on the RAM  106 .  
         [0422]    In S 2605 , the CPU  101  determines whether it is within the object term of the competitor reflected supply demand forecast. Concretely, when there is no supply sales record (RC) within the competitor reflected supply demand forecast object term (T(FC 5 )), the routine proceeds to S 2606 , and the CPU  101  writes “0” into all of the regions of the competitor reflected supply demand forecast result FC 5  of the competitor reflected supply demand forecast result DB (DB(M)).  
         [0423]    Further, in S 2605 , when the CPU  101  determines that there is a supply sales record within the competitor reflected supply demand forecast term, the routine proceeds to S 2607 , and the CPU  101  calls up the supply demand forecast result (not compensated) (FC 1 ) from the supply demand forecast result (not compensated) (DB(A)), and writes it into the RAM  106 .  
         [0424]    In S 2608 , the CPU  101  executes competitor reflected supply demand forecast (F 4 ).  
         [0425]    In S 2609 , the CPU  101  writes the result of the competitor reflected supply demand forecast (F 4 ) into the region of competitor reflected supply demand forecast result FC 5  of the competitor reflected supply demand forecast result DB (DB(M)).  
         [0426]    [0426]FIG. 27 is a flowchart showing details of the supply trend demand forecast process in S 2404  of FIG. 24.  
         [0427]    In S 2701 , the CPU  101  calls up the main machine sales record (RM) and the main machine sales record/schedule from the main machine sales schedule/record DB (DB(H)), and writes them into the RAM  106 .  
         [0428]    In S 2702 , the CPU  101  writes a supply trend forecast object item from a supply trend demand forecast item DB (DB(I)) into the RAM  106 .  
         [0429]    In S 2703 , the CPU  101  determines whether it is within supply trend forecast term or not. Concretely, a case in which a value in which the sum of the main machine sales record is divided by the sum of the main machine sales record/schedule is equal to or greater than an arbitrary numeric value (0.90 in FIG. 27) is considered to be within the supply trend demand forecast term.  
         [0430]    Further, in S 2703 , even if it is not within the supply trend demand forecast term, there is the request that the user wishes to manually execute the supply trend demand forecast. Thus, in S 2704 , it is determined whether the supply trend demand forecast item DB (DB(I)) exists or not, and when it exists, the routine is manually made to proceed to S 2709 .  
         [0431]    On the other hand, in S 2704 , when the supply trend demand forecast item DB (DB(I)) does not exist, the routine proceeds to S 2705 , and “0”s are written into all of the regions of the competitor reflected supply demand forecast result FC 5  of the supply trend demand forecast result DB (DB(M)).  
         [0432]    In S 2706 , the CPU  101  calls up the supply sales record (RC) from the supply sales record DB (DB(D)), and writes it into the RAM  106 .  
         [0433]    In S 2707 , the CPU  101  executes the supply trend demand forecast (F 3 )  
         [0434]    In S 2708 , the CPU  101  writes the result of the supply trend demand forecast into the region of the supply trend demand forecast result FC 4  of the supply trend demand forecast result DB (DB(I)).  
         [0435]    [0435]FIG. 28 and FIG. 29 are flowcharts showing flows of discrimination of forecast methods in S 2405  and S 2407  of FIG. 24.  
         [0436]    In S 2801 , the CPU  101  calls up the supply demand forecast result (FC 1 ) from the supply demand forecast module, and writes it into the RAM  106  and the supply demand forecast result (compensated) DB (DB(B)).  
         [0437]    In S 2802 , the CPU  101  calls up the supply demand forecast result (FC 3 ) from the initial supply demand forecast module, and writes it into the RAM  106 .  
         [0438]    In S 2803 , the CPU  101  retrieves the competitor reflected supply demand forecast result (FC 5 ) from the competitor reflected supply demand forecast module, and writes it into the RAM  106 .  
         [0439]    In S 2804 , the CPU  101  calls up the supply trend forecast result (FC 4 ) from the supply trend forecast module, and writes it into the RAM  106 .  
         [0440]    In S 2805 , the CPU  101  calls up the supply sales record (RC) from the supply sales record DB (DB(D)), and writes it into the RAM  106 .  
         [0441]    In S 2806 , the CPU  101  determines whether there is a supply sales record or not. Concretely, if the supply sales record term (T(RC)) is greater than  0 , the routine proceeds to S 2807 , and if it is not, the routine proceeds to S 2809 .  
         [0442]    In S 2807 , the CPU  101  determines whether or not the supply sales record term is less than or equal to the initial demand forecast term. Concretely, if the initial demand forecast term (T(FC 3 )) is equal to or greater than the supply sales record term (T(RC)), the routine proceeds to S 2808 , and if it is not, the routine proceeds to S 2910  of FIG. 29 which will be described later.  
         [0443]    In S 2808 , the CPU  101  determines whether the difference between the initial demand forecast result and the supply sales record is smaller as compared with that of the supply demand forecast result. Concretely, it is determined whether or not the absolute value of the difference between the supply demand forecast result and the supply sales record result of the past n months (n is arbitrary) is smaller than the absolute value of the difference between the supply demand forecast result and the supply sales record result. When the CPU  101  determines that the absolute value of the difference between the supply demand forecast result and the supply sales record result of the past n months is smaller than the absolute value of the difference between the supply demand forecast result and the supply sales record result, the routine proceeds to S 2809 , and if it is not so, the CPU  101  operates to move to S 2910  of FIG. 29 which will be described later.  
         [0444]    In S 2809 , the CPU  101  writes the supply initial demand forecast result (FC 4 ) into the supply demand forecast result (FC 2 ) of the supply demand forecast result (compensated) DB (DB(B)).  
         [0445]    In S 2910  of FIG. 29, the smallest absolute value of the difference among following A, B, C is determined.  
         [0446]    A. The absolute value of a difference between the supply demand forecast result and the supply sales record result of the past n months.  
         [0447]    B. The absolute value of a difference between the supply trend demand forecast result and the supply sales record result of the past n months.  
         [0448]    C. The absolute value of a difference between the competitor reflected supply demand forecast result and the supply sales record result of the past n months.  
         [0449]    If B. is the smallest value, the routine proceeds to S 2911 , and the supply trend demand forecast result (FC 4 ) is written into the supply demand forecast result (FC 2 ) of the supply demand forecast result (compensated) DB (DB(B)). If C. is the smallest value, the routine proceeds to S 2912 , and the competitor reflected supply demand forecast result (FC 3 ) is written into the supply demand forecast result (FC 2 ) of the supply demand forecast result (compensated) DB (DB(B)).  
         [0450]    [0450]FIGS. 34A to  34 H through FIGS. 35A to  35 E are diagrams showing various types of databases of the present invention.  
         [0451]    [0451]FIGS. 30A to  30 D are diagrams showing the transition of the databases at the time of the initial supply demand forecast.  
         [0452]    [0452]FIGS. 31A to  31 F are diagrams showing the transition of the databases at the time of the competitor reflected supply demand forecast.  
         [0453]    [0453]FIGS. 32A to  32 D are diagrams showing the transition of the databases at the time of the supply trend demand forecast.  
         [0454]    [0454]FIGS. 33A to  33 E are diagrams showing the transition of the databases at the time of determining the forecast method.  
         [0455]    Note that it goes without saying that all of the above-described processes are realized by the CPU  101  shown in FIG. 1 or the like.  
         [0456]    As can be understood by referring to the flows or the transitions of the databases from FIG. 24 to FIGS. 35A to  35 E, in the present invention, by focusing on the sales properties of A. Pipeline fill, B. Compatible product appearance, and C. Sales term final stage, measures are taken to make forecast errors, which will be probably arise due to these properties, be minimum.  
         [0457]    [0457]FIG. 22 is a table in which these processes are arranged compiled.  
         [0458]    The present invention has the following effects.  
         [0459]    Supply demand forecast switching system  
         [0460]    Highly-accurate production, sales, and stock schedules can be executed for each sales term by providing and selecting a demand forecast method which is appropriate for each sales term. As a result, it is possible to not miss sales opportunities and to maintain the appropriate stock.  
         [0461]    Initial supply demand forecast system  
         [0462]    By forecasting demand for satisfying the demand for-stock of a commission merchant or a sales store generated at the initial term of the supply sales term, it is possible to not miss sales opportunities and to maintain the appropriate stock.  
         [0463]    Competitor reflected supply demand forecast system  
         [0464]    In the industry of supplies or the like of business machines or peripheral equipment of personal computers, with the respect to the supplies, there are cases in which, in addition to a compatible product manufactured by the manufacturer of the business main machine, a compatible product, which has compatibility therewith and which is manufactured by a manufacturer other than the manufacturer of the main machine, exists. When such a compatible product appears, by reflecting the affects thereof on the demand forecast, it is possible to not miss sales opportunities and to maintain the appropriate stock.  
         [0465]    Supply trend demand forecast  
         [0466]    Because usage of the main machine is continued during the sales term of the supply of the business machine or peripheral equipment of personal computers and after the sales of the main machines are ended, there are cases in which the sales of the supply become unstable due to used products of the business machine or peripheral equipment of personal computers being distributed in markets other than the market supposed by the manufacturer, or the like, in the final stage of the supply sales term. In such a case, the future sales forecast is carried out from the sales record of the supply itself. As a result, it is possible to not miss sales opportunities and to maintain the appropriate stock.  
         [0467]    7. Supply macro demand forecast  
         [0468]    In a conventional supply forecast method, because forecasting is carried out by using one market and one product as the object, when markets and merchandises which affect one another exist, the conventional forecast cannot handle such a case.  
         [0469]    A case in which two products whose functions can be replaced by the other exist (Example: the case of a supply for copy machine C 3300 , a C 3300  drum unit, and a C 3300  single drum)  
         [0470]    A photosensitive body drum is a main supply which must be replaced when a copy machine or a peripheral equipment of a personal computer, for which maintenance work is required, has outputted a given amount of output. Further, the copy machine or the peripheral equipment of the personal computer have replaceable parts which must be replaced in addition to the photosensitive body drum.  
         [0471]    In the present embodiment, with respect to the C 3300  drum unit, because the photosensitive body drum and other replaceable parts previously built in the unit can be simultaneously replaced, the working time of the operator can be reduced. On the other hand, with respect to the C 3300  single drum, because the operator judges the degrees of consumption of the respective supplies and replaces them, the costs of parts can be reduced.  
         [0472]    Accordingly, the total demand for the C 3300  drum unit and the C 3300  single drum does not change, and it is in a relationship that if the sales of one product increase, the sales of the other product decrease.  
         [0473]    In order to forecast the demands for both, after the total demand forecast of the C 3300  drum unit and the C 3300  single drum for the copy machine C 3300  is carried out, the total demand forecast is divided from the record of the conventional machine or the past record of the C 3300  drum unit and the C 3300  single drum themselves, and thus value serves as the demand forecast of each machine.  
         [0474]    A case in which demands of two markets which affect one another are forecasted (Example: the case of copy machine C 3300  and C 3300  toner which are soled in Germany and Austria)  
         [0475]    When one type of copy machine or peripheral equipment for a personal computer is sold in two different markets as well, there are cases in which the respective two markets affect one another with respect to the supply. For example, when the copy machine C 3300  and the supplies thereof are sold in Germany and Austria, it can be thought that a sales stores handling the supply will purchase the supply without considering national borders, from the reasons of geographical and cultural closeness. In this case, the total demand of the both does not change, and it is in a relationship that if the sales of one product increase, the sales of the other product decrease. Therefore, in order to forecast the demand for both, after the demand forecast of the C 3300  toner of the total of both markets is carried out, the total demand forecast is divided from the record of the conventional machine or the past record of the C 3300  toner itself, and thus value serves as the demand forecast of each market.  
         [0476]    [0476]FIGS. 37A to  37 E are graphs showing conceptual diagrams of the supply macro demand forecast. Hereinafter, the supply macro demand forecast will be described on the basis of FIGS. 37A to  37 E.  
         [0477]    [0477]FIG. 37A is a graph of demand forecast of sales area A. FIG. 37B is a graph of demand forecast of sales area B.  
         [0478]    In sales area A and sales area B, if it is supposed that  1000  of the copy machines have been sold in exactly the same way and the demand forecast is carried out by exactly the same parameters, as in the graphs of the supply demand forecast of FIG. 37A and FIG. 37B, both are exactly the same.  
         [0479]    However, in a case in which markets affect one another, the total sales forecast figures correspond to the sales record. However, there are cases in which the sales record of one of the areas exceeds the sales forecast (sales area B in the case of FIGS. 37A to  37 E), and the sales record of the other area is less than the sales forecast (sales area A in the case of FIGS. 37A to  37 E). In other words, because the both affect one another, the demand forecast and the sales forecast are respectively dissociated.  
         [0480]    Thus, forecasting is carried out by adding the main machine sales records, the supply sales records, the forecast parameters, or the like of the above-described sales area A and sales area B. FIG. 37C is the result in which forecasting is carried out by adding the various values of the sales areas A and B.  
         [0481]    After carrying out forecasting by adding, the supply sales forecast are reallocated (divided) on the basis of predetermined ratios of sales area A and sales area B (“predetermined ratio” will be described later).  
         [0482]    [0482]FIG. 37D and FIG. 37E show graphs of the demand forecasts of sales area A and sales area B after reallocating (dividing).  
         [0483]    As is clear by comparing FIGS. 37A, 37B,  37 D, and  37 E, the forecast method, in which dividing is carried out after adding and calculating, can realize an extremely excellent forecast.  
         [0484]    [0484]FIG. 38 shows a module structure for a macro demand forecast.  
         [0485]    [0485]FIG. 39 is a schematic diagram of a flow of the supply macro demand forecast.  
         [0486]    [0486]FIG. 40 is a detailed figure of a flow of the supply macro demand forecast.  
         [0487]    In S 4001 , the CPU  101  calls up a supply macro master (MM) from the supply macro master DB (DB(N)), and writes it into the RAM  106 .  
         [0488]    In S 4002 , the CPU  101  calls up a supply macro parameter (MP) from the supply macro parameter DB (DB(R)), and writes it into the RAM  106 .  
         [0489]    In S 4003 , the CPU  101  calls up a supply sales record (RC) from the supply sales record DB (DB(D)), and writes it into the RAM  106 .  
         [0490]    In S 4004 , the CPU  101  creates, on the RAM  106 , the supply sales record (z) from the supply sales record (RC). By this operation, two or more supply sales records are added (for details, refer to FIG. 41D which will be described later).  
         [0491]    In S 4005 , the supply demand forecast is carried out by the CPU  101 .  
         [0492]    In S 4006 , it is determined whether or not the supply sales record term is equal to or greater than a predetermined term (one year in FIG. 40). When the supply sales record term is equal to or greater than the predetermined term, the routine proceeds to S 4007 , and a macro decomposition ratio (mdr) is created from the supply sales record of the macro object item itself. The macro decomposition ratio will be described hereinafter in detail (three modes).  
         [0493]    (1) Create macro decomposition ratio (mdr) by using cumulative value of sales records  
         [0494]    [0494]FIG. 45 is a table showing the supply sales record up to October of a certain year.  
         [0495]    The cumulative value up to October of the C 2000  cartridge is 370, and the cumulative value up to October of the C 4000  cartridge is 145. Thus, the macro decomposition ratio (mdr) is 370:145.  
         [0496]    (2) Create macro decomposition ratio by adding weight to sales record  
         [0497]    [0497]FIG. 46 is a graph showing weights by which the sales record are to be multiplied. The weights shown in FIG. 46 have been written in advance in the RAM  106  or the like. The weight of FIG. 46 is applied to the sales record of FIG. 45, and it is the macro decomposition ratio (mdr).  
         [0498]    C 2000  cartridge: 100×0.4+70×0.3+50×0.2+20×0.1=73  
         [0499]    C 4000  cartridge: 30×0.4+20×0.3+10×0.2+50×0.1=25  
         [0500]    Therefore, the macro decomposition ratio (mdr) is 73:25. In this way, at the time of creating a macro decomposition ratio, by using weights, a forecast in which the latest data is reflected is possible. Note that it goes without saying that the above-described calculation is realized by the CPU  101 .  
         [0501]    S 4008  is a process which is carried out when the supply sales record term does not satisfy the predetermined term. In this case, the supply macro master DB(N) is referred to, and a supply similar to the supply which is the forecast object is searched for, and the macro decomposition ratio (mdr) corresponding to the similar supply is used.  
         [0502]    In S 4010 , the supply demand forecast result (z) is divided in accordance with the macro decomposition ratio.  
         [0503]    In S 4011 , the macro demand forecast result (FC 6 ) is written into the macro demand forecast result DB (DB(Q)).  
         [0504]    In S 4012 , the macro demand forecast result (FC 6 ) is written into the supply demand forecast result (compensated) DB (DB(B)) as the supply demand forecast result (compensated) (FC 2 ).  
         [0505]    The supply demand forecast result (compensated) is displayed on the output unit  103  by control of the CPU  101 . Concretely, respective demand forecasts such as FIG. 37D and FIG. 37E are displayed in the display formats of FIG. 44 (graph format and/or table format).  
         [0506]    [0506]FIGS. 41A to  41 D are transition diagrams of the DB of the supply macro composition module  3803 .  
         [0507]    [0507]FIGS. 42A to  42 C are transition diagrams of the DB of the supply macro decomposition module  3805 . Note that, in the example of FIGS. 42A to  42 C, the macro decomposition ratio is 80:20.  
         [0508]    (3) Create decomposition ratio by exchange rate effect  
         [0509]    Generally, in trade between countries having different currencies, when the same merchandise has been soled in the both countries, there is a trend in which the products are sold more from a country whose currency is weaker to a country whose currency is stronger. The reason for this will be described in the following example.  
         [0510]    It is supposed that a certain product AA is sold at $100 in US$ area, and at Euro 100 in Euro area at the time of when the exchange rate is EURO/US$=1.0. Thereafter, it is supposed that the exchange rate becomes EURO/US$=1.1. At this time, if a seller in the Euro area sells the product AA at $100 to the US$ area, the seller can receive 110 EUROs without considering the exporting costs. Even if the exporting costs such as shipping costs, customs duties, or the like are considered, when the exchange rate largely fluctuates, a case in which larger profits can be obtained for the seller can be considered, and it can be thought that the sales figures from a seller in the Euro area to sellers or consumers in the US$ area will increase. When the exchange rate inversely fluctuates, it is supposed that cases in which a product is sold from the US$ area to the Euro area will increase. It can be thought that such cases arise when the exchange rate largely fluctuates or the like in the case of the supply as well. Therefore, when a product is sold from a country to another country having a different exchange rate, because the exchange rate effect on the respective countries cannot be considered in the decomposition ratio calculated from the ratio of only the past sales records, there are a cases in which a precise forecast cannot be calculated, and a demand forecast using a decomposition ratio which considers the exchange rate effect is required.  
         [0511]    Hereinafter, one example of computational formulas of the decomposition ratio considering the exchange rate effect will be shown.  
         [0512]    In a case in which  
         [0513]    Decomposition ratio exchange rate correction coefficient (ERC) YY (set (stored) in advance)  
         [0514]    Standard exchange rate (SER) currency AA/currency BB=ZZ (set (stored) in advance)  
         [0515]    Pre-correction decomposition ratio of the supply is currency AA area:currency BB area=mdr 1 :mdr 2 , when the exchange rate fluctuates to currency AA/currency BB=ZZ 1  (the latest actual rate of the exchange or future forecast value acquired from a financial institution such as a bank or the like is used as ZZ 1 ),  
         [0516]    as one example of the corrected decomposition ratio calculation,  
         [0517]    when the exchange which is currency XX area:currency XY area=mdr 1 +(ZZ 1 -ZZ)×YY:mdr 2 −(ZZ 1 -ZZ)×YY (Formula 35) is EURO/US$=1.0, the pre-correction decomposition ratio of the supply is EURO AA area:US$ area=1:2, and the decomposition ratio exchange rate correction coefficient (ERC) is 2.  
         [0518]    Example 1 When the exchange fluctuates to EURO/US$=0.9, the decomposition ratio is EURO:US$=1+(0.9-1)×2:2−(0.9-1)×2=0.8:2.2=4:11  
         [0519]    Example 2 When the exchange fluctuates to EURO/US$=1.1, the decomposition ratio is EURO:US$=1+(1.1-1)×2:2−(1.1-1)×2=1.2:1.8 =2:3  
         [0520]    [0520]FIGS. 43A to  43 E are diagrams showing a list of the databases relating to the supply macro demand forecast.  
         [0521]    As is clear from FIGS. 37A to  37 E through FIGS. 43A to  43 E, in accordance with the present invention, more highly accurate forecasting can be executed on the whole by forecasting by adding mutual effects with respect to markets and sales of products affecting one another. Further, it is possible to implement production, sales, and stock schedules on the basis of the highly accurate forecast. As a result, it is possible to not miss sales opportunities and to maintain appropriate stocks.  
         [0522]    As many apparently widely different embodiments of the present invention can be made without departing from the spirit and scope thereof, it is to be understood that the invention is not limited to the specific embodiments thereof except as defined in the claims.