Abstract:
This invention relates to a production system for retail goods which is intended for timely collection of accurate sales information from retail outlets and flexible production of goods in accordance with the same information, and includes sales information collecting units for collecting sales information at a plurality of sales outlets, a production size determining unit for determining a production quantity to be produced in the future for a plurality of goods based on the sales information received from the plurality of sales information collecting units, and a production unit for flexibly manufacturing the plurality of goods based on the sales information which is collected at the plurality of sales information collecting units. After the production size determining unit determines the production quantity, output data indicative of the production quantity determined by the production size determining unit is transmitted to the production unit so that the production unit manufactures the production quantity of the plurality of goods.

Description:
This application is a Continuation of U.S. patent application Ser. No. 08/650,054 filed on May 16, 1996, now U.S. Pat. No. 5,854,746, which is a Continuation of U.S. patent application Ser. No. 08/422,976, filed Apr. 17, 1995 (abandoned), which is a Continuation of U.S. patent application Ser. No. 07/692,425 filed Apr. 29, 1991 (abandoned). 

   BACKGROUND OF THE INVENTION 
   The present invention relates to a production system for retail goods such as beauty products and more particularly to a production system which receives sales information from retail outlets in a timely and accurate manner and is flexible in manufacturing the goods. 
   The invention relates, in another aspect, to a raw material necessary for the production of products can be placed with flexibility and economically, and thus insures timely procurement of raw materials without the disadvantage of carrying excessive raw material inventories. This raw material ordering system may be employed in conjunction with or independently from the production system. 
   In manufacturing a product for marketing, which is sold over retail counters, the manufacturer generally determines the quantity to be manufactured according to an initial marketing plan and instructs its factory to produce that quantity, and as need arises, they instruct the factory to carry out additional production. 
   However, such a production system is dangerous to the so-called fashion manufacturer which must launch a new product as often as, say, once a year and is specializing in fashion articles with limited market lives. Assuming that such a manufacturer drafted a merchandizing plan, manufactured an article accordingly and introduced it to the market and the articles was accepted by consumers better than expected and sold out soon. Soon, then deficiencies occur at retail outlets and the manufacturer loses many sales opportunities. Assuming, conversely, that the manufacturer mapped out a grandiose campaign but the market was not ready to accept their product. Soon, then too many articles remain unsold and the manufacturer must carry large stocks to be somehow liquidated. 
   To solve these problems, many manufacturers have explored better methods for predicting potential demands. Thus, they try to overcome the problems by predicting demands from the past sales performance of similar products and determining apparently appropriate production scales. However, when the article to be manufactured is an entirely new product, it is extremely difficult for the manufacturer to predict consumer acceptance, ascertain the trend in potential competitors, or predict the effect of a marketing campaign. Moreover, since weather may be a major factor affecting the sale of products, demand prediction has its own limits and every one in the industry today is aware of the great risk of relying on such prediction. 
   Raw Material Ordering System I 
   While different industries have been using somewhat different systems for the procurement of raw materials, the average approach is that which is known as the fixed point-fixed quantity ordering system. 
   According to this fixed point-fixed quantity ordering system, a safe stock level is predetermined for each raw material and when the raw material inventory on hand has decreased to this critical stock level, a signal is given for placing a new order. This system is predicated on the principle that the manufacturer should carry a reasonable stockpile of any raw material that is required to be certainly on the safe side. This is an expedient and optimal system for industries where stable production is the rule rather than the exception. 
   However, the fixed point-fixed quantity ordering system does not work well and entails too large economic losses in industries where many kinds of products are manufactured in small lots and particularly where the dependency of any raw material on the production scale of the product is large. Thus, if a plurality of product items share a plurality of raw materials in common and such product items can be manufactured merely by altering the combination of such raw materials, the fixed point-fixed quantity ordering system can be employed with advantage. However, if, for example, three product items A, B and C have one raw material a in common, the safe stock level of  a , viz. the critical point for this raw material, will then be set at the maximum quantity required for the production of all the three product items, with the result that the safety stock level of that raw material is exaggerated of necessity and, hence, chances are that the manufacturer will have to carry an excessive raw material inventory. 
   To overcome the above disadvantage, a raw material ordering system called MRP (the acronym of Material Requirements Plan) has for some time been in use. This is a system such that an order for any raw material is placed in the quantity just necessary for the production of a given lot size of each product item and is intended to preclude the disadvantage of carrying an excessive raw material inventory. 
   As all the raw materials for each product item are assorted as a package, this system is convenient, indeed, but has the problem of rigidity. Thus, since the raw material a is earmarked for the production of item A only and no diversion of raw material a is made for the production of item B even if an instruction to produce B is entered, then the production of B must begin only after procurement of raw material a for B. Since the raw materials,  a ,  b ,  c  . . . have been packaged in necessary amounts for the production of item A, the diversion of raw material  a  from this package will result in a virtual waste of the other raw materials b , c . . . . 
   Raw Material Ordering System II 
   Furthermore, the raw material ordering system MRP involves particular difficulties and is disadvantageous when the raw materials call for long lead times between placement of an order and actual receipt of the raw materials. An example of such raw materials is bottles of cosmetics. Each manufacturer of cosmetics employs its own bottles with its own shape, configuration, color, and ornamental design. When a manufacturer of cosmetics places an order for bottles of a particular type, a manufacturer of the bottles then molds the bottles, does surface-finishing, and print brands and other characters and designs if any on the surface thereof. Thus, for placing an order for a raw material with a lead time of 3 months, it is of course necessary that the production scale as of 3 months ahead must have been determined but it is very difficult and even dangerous for manufacturers in the fashion and equivalent industries to predetermine a production size as of many months ahead. 
   Therefore, there has been proposed a still another system, viz. a preliminary ordering system in which the necessary quantities of parts, that is to say the amounts of consumption of parts are predicted independently of the production of a finished product and these quantities of parts are arranged to be available beforehand. According to this system, the necessary production activity can be started as soon as a manufacturing instruction is received but the manufacturer must maintain constant inventories of parts at all times and, particularly where the variety of production items is large, must maintain a proportionally increased total inventory of raw materials. 
   Furthermore, raw materials and particularly containers and the like are fed to the production line only after passing through a plurality of processes such as surface and other treatments (factory) and assembling (factory), with the result that various forms of inventories are carried in the respective processes. In such a situation, it is very difficult to keep a constant tab on which process stage is carrying what size of inventory and this was near to impossibility particularly where the container, for one, is procured from a series of container manufacturers and finishers. For this reason, the manufacturer in such cases places orders for raw materials for each production job without a clear picture of the inventory, with the result that they will have to carry a fairly large total inventory of raw materials. 
   SUMMARY OF THE INVENTION 
   The present invention has been developed to overcome the aforementioned disadvantages. 
   It is, therefore, a first object of the present invention to provide an ideal production system, which takes in sales information from retail outlets timely and with accuracy and manufactures products with flexibility in quick response to the sales information, thus making it possible to supply the market with any product when it is needed and in the quantity needed. 
   To accomplish the above object, the production system for retail goods in accordance with the present invention has the following constitution. a retail sales information collecting means, a production quantity setting means for determining a production quantity according to the sales information collected by the first-mentioned means, a directing means for directing the preparation and production of raw materials according to the production quantity determined as above, and a production means for producing the determined production quantity in accordance with the direction. 
   In the above arrangement, as sales information from retail outlets are transmitted by the retail sales information collecting means to the production quantity setting means, the production quantity is set immediately. 
   Then, this production quantity data is fed to the directing means for directing the preparation and production of necessary raw materials and the production means receiving a direction to produce from the directing means performs the production of the determined production quantity. 
   As mentioned above, the production system according to the present invention sets a production quantity in response to sales information from retail outlets, directs the preparation and production of raw materials necessary for production of the set production quantity and performs the production of the same quantity, thus making it possible to produce any product that sells when it is needed and in the quantity that is certain to be sold. 
   Therefore, all the problems encountered in the past, such as deficiencies in stock at retail outlets and the consequent loss of sales opportunities or excessive accumulation of inventories can be obviated and an ideal manufacturing system can be established. 
   Preferably, it is arranged that the retail sales information is collected from a plurality of sample stores or departments and that the production quantity setting means comprises a scale-up estimating routine for scaling-up of the retail sales information and a demand forecast routine for predicting the demand according to the scale-up estimate. Such a construction is conducive to a more accurate setting of production quantity. 
   Furthermore, the production means is preferably provided with an automatic switching function for automatically changing the powers etc. of the components of production equipment in accordance with directions to produce. As the production means is so constructed, it is possible to establish a production system which is quick to respond to directions to produce without requiring switching of parts, for instance. 
   For directing or ordering the preparation and production of raw materials required in the production system for retail goods, one may employ Raw materials ordering systems I and II hereinafter explained. Raw materials ordering system I is to be used in connection with those raw materials which do not require special processings after placement of an order, such as material substances to be mixed to produce hair-lotions. Raw materials ordering system II is to be used for those raw materials which require various processings after placement of an order, such as containers of cosmetics. 
   Raw Material Ordering System I 
   It is a second object of the present invention to provide a raw material ordering system which is flexible enough to timely respond to production needs without carrying an excessive stock of raw materials and, particularly in industries where many items are produced in small lots, enables an economical and effective control and supply of raw materials which are otherwise complicated and time-consuming. In other words, the present invention provides a “raw material mixing system” wherein a raw material prepared for producing one item is diverted for producing an another item when a necessity of producing additional number of products of another item emergently arises. 
   To accomplish the above object, the raw material ordering system of the present invention determines the order size of each raw material according to a production plan for a product, comprising an order quantity determining means which sequentially sets or modifies the required quantities of raw materials for each day in accordance with the daily production plan or changes in the production plan and determines the order size in accordance with the attributes, inventories, order backlogs and in-process quantities of the raw materials and the required quantities of raw materials data input processing means which modifies the inventory quantities in response to raw material acceptance information and modifies the production plan and raw material inventory quantities in response to production data. 
   In the above arrangement, the required quantities of respective raw materials are set in accordance with the day-to-day production plan and the aforesaid required quantities are updated every time a change is made in the production plan. 
   Then, the order size is determined, and an order is placed, with reference to the raw material attributes, such as standard lead time, supply quantity, safe stock level, etc., current inventory, order backlog, in-process quantity and required quantity of the raw material so that the respective raw materials can be made available in amounts just necessary and sufficient for current production needs without the disadvantage of placing an unnecessary order. 
   Furthermore, as the production plan and raw material inventory values are updated automatically in accordance with raw material acceptance data and production data, a flexible raw material ordering system which is self-adapting to the flow of raw materials can be established. 
   Thus, the raw material ordering system of the present invention permits placing orders for raw materials which are commensurate with the daily production plan. The required quantities of raw materials are set in response to every change in the production plan for a given day, and based on the required quantities so set, as well as on the attributes, inventory levels, order backlogs and in-process quantities of respective raw materials, the optimum order sizes are determined so that necessary raw materials can be procured when needed and in appropriate quantities. 
   Since the raw material inventory data and the daily production plans are Automatically updated upon receipt of raw material acceptance data and production data, the correct order sizes can be determined for meeting production needs-without the risk of carrying excessive raw material inventories and, particularly for manufacturers who produce a large variety of products in small lots and, as such, should otherwise go through complicated ordering procedures, can now easily place orders for the necessary raw materials at the right time in just the quantities needed. 
   Furthermore, it is preferable to arrange the data input processing means so that the order backlog data is updated in response to the input of raw material order acknowledgement and acceptance data and that the in-process data be also updated in response to the input of the order acknowledgement data. 
   Raw Material Ordering System II 
   It is a third object of the present invention to provide a raw material ordering system which controls raw material inventories in all forms according to processes and permits placing orders for necessary raw materials when needed and in the quantities needed, or at optimum times, without the disadvantage of carrying excessive inventories in the respective processes. This system is for those raw materials which require processing after placement of an order. 
   To accomplish the above object, the raw material ordering system of the present invention places orders for the necessary raw materials comprises a raw material history memory means which, for any raw material undergoing various processes before it attains its final form, memorizes the relationship of the condition at feeding to each process with the condition at completion of the process, a raw material inventory register means which determines and registers the inventory quantity of each raw material, a product constitution memory means which memorizes the raw materials constituting each product and the required quantities thereof, a raw material demand setting means which, for the necessary raw materials, determines the raw material demand quantities for respective processes retroactively from release to feeding in each process by reference to the raw material history memory means, and a raw material order processing means which issues an order for any raw material to each process in accordance with the raw material demand quantity set by the raw material demand setting means and the raw material inventory quantity registered in the raw material inventory register means. 
   In the above arrangement, the relationship between feeding and release of each raw material undergoing various processes such as working, assembling, etc. are memorized as raw material history information. Therefore, once a scheduled marketing quantity is set for a given product, the required quantities of raw materials at each process level can be determined by tracing the flow back from the finished product to each necessary raw material and thence to the form of the same raw material at feeding to the process for conversion to the form suited for release. 
   Since, in this manner, an order can be issued to each of the processes for any raw material in the corresponding form or condition, the required raw materials can be procured when needed and in the quantities needed without the risk of carrying unnecessary raw material inventories. 
   Thus, in accordance with the raw material ordering system of the present invention, since ordering can be made on a process-by-process basis or in accordance with the form of each raw material at each process level by reference to the history of the raw material, viz. finishing, assembling, etc. (factory) up to the final raw material, the risk of carrying an excessive inventory can be avoided and the required raw materials can be made available when needed and in the quantities needed. 

   
     BRIEF DESCRIPTION OF THE DRAWINGS 
       FIG. 1  is an overall block diagram showing an embodiment of the production system for retail goods in accordance with the present invention; 
       FIG. 2  is a diagram illustrating the data structure of a product characteristics data table; 
       FIG. 3  is a schematic view illustrating an example of product characteristics classification in the table of  FIG. 2 ; 
       FIG. 4A through 4E  each is a diagram showing the data structure of a sampled outlet characteristics data table; 
       FIG. 5A and 5B  each is a diagram showing the data structure of a demand forecast data table; 
       FIG. 6  is a flow chart showing the action of a demand forecast routine; 
       FIG. 7  is a diagram showing the sales course pattern of a product; 
       FIG. 8  is a diagram showing the data structure of an inventory data table; 
       FIG. 9  is a flow chart showing the action of a production quantity determining routine; 
       FIG. 10A through 10D  each is a diagram showing the data structure of a raw material data table; 
       FIG. 11  is a flow chart showing the action of a raw material ordering routine; 
       FIG. 12  is a flow chart showing the action of a production means control routine; 
       FIG. 13  is a diagram showing the data structure of a drive output data table; 
       FIG. 14  is a diagram explaining the production system in a production routine; 
       FIG. 15  is a view-showing the overall construction of a raw material ordering system as an embodiment of the invention; 
       FIGS. 16 through 19  are diagrams showing an inventory data table, a production plan data table, a production plan modification transfer data table and a required quantity data table, respectively; 
       FIG. 20  is a flow chart showing steps in an initial setting routine; 
       FIG. 21  is a flow chart showing steps in a production plan setting routine; 
       FIG. 22  is a flow chart showing a required quantity setting routine; 
       FIG. 23  is a diagram showing a product constitution data table; 
       FIG. 24  is a flow chart showing steps in a production plan modifying routine; 
       FIG. 25  is a flow chart showing steps in a required quantity modifying routine; 
       FIGS. 26(   a ) and ( b ) are flow charts showing steps in an order quantity determining routine; 
       FIGS. 27 through 29  are diagrams showing a raw material attribute data table, an order course data table and an order backlog data table, respectively; 
       FIG. 30  is a flow chart showing steps in an order acknowledgement data input processing routine; 
       FIG. 31  is a flow chart showing steps in a raw material acceptable data input processing routine; 
       FIG. 32  is a flow chart showing steps in a production data input processing routine; 
       FIG. 33  is a view showing the overall construction of another raw material ordering system embodying the invention; 
       FIGS. 34 through 39  are data tables in the same embodiment; 
       FIG. 40  is a flow chart showing steps in a parts inventory calculating routine I; 
       FIG. 41  is a flow chart showing steps in a parts inventory calculating routine II; 
       FIGS. 42 through 46  and  48  are views showing data tables in the same embodiment; 
       FIG. 47  is a flowchart showing processing for setting assured sales quantity. 
       FIGS. 49(   a )–( d ) are explanatory diagrams showing the same data tables substituted by factual values; 
       FIGS. 50 and 51  are views explaining the processing of values applied in  FIG. 49 ; 
       FIG. 52  is a flow chart showing steps in a parts ordering routine; 
       FIG. 53  is a flow chart showing steps in a parts acceptance routine; 
       FIG. 54  is a flow chart showing steps in a parts releasing routine; 
       FIG. 55  is a view showing a production plan data table; and 
       FIG. 56  is a flow chart showing steps in a production planning routine. 
       FIGS. 57 and 58  respectively show examples of production means having drive units and control routines. 
   

   DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS 
     FIGS. 1 through 14  are views illustrating an embodiment of the production system linked to retail sales in accordance with the present invention. As shown, this system comprises a retail sales information collecting means  1 , a production size setting means  2 , a directing means  3  for directing the preparation and production of raw materials, and a production means  4 . 
   The retail sales information collecting means  1  comprises a plurality of point-of-sale (POS) terminal units  1   a ,  1   b ,  1   c  . . . installed at different retail outlets and a public communications line network  11  connecting the POS terminal units  1   a ,  1   b ,  1   c  . . . with a host computer H. These POS terminals  1   a ,  1   b ,  1   c  . . . each stores in memory the product names and the quantity of each product sold and transmits the stored information to the host computer H daily at a fixed hour of the day. 
   These POS terminals  1   a ,  1   b ,  1   c  . . . are not installed at all the retail outlets for any given product but are installed at sample outlets representing a given percentage of the total of such retail outlets. These sample outlets are selected from among the volume-selling outlets so that the system may receive sales information more efficiently. 
   The production size setting means  2  includes a scale-up estimating routine  5 , a demand forecast routine  6  and a production size determining routine  7 . 
   The scale-up estimating routine  5  receives sales information from the plurality of POS terminals  1   a ,  1   b ,  1   c  . . . through the public communications line network  11  from time to time as input data. In this scale-up estimating routine  5 , a scale-up estimate is obtained by means of the following equation (1). Scale-up estimate= 
   
     
       
         
           
             
               
                 
                   [ 
                   
                     
                       
                         
                           Number  of  units  of 
                         
                       
                     
                     
                       
                         
                           
                             product 
                           
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           X 
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           
                             sold 
                           
                         
                       
                     
                     
                       
                         
                           at  sample  outlets 
                         
                       
                     
                   
                   ] 
                 
                 × 
                 
                   
                     [ 
                     
                       
                         
                           
                             Total  number  of 
                           
                         
                       
                       
                         
                           
                             units  purchased  by 
                           
                         
                       
                       
                         
                           
                             all  outlets  during 
                           
                         
                       
                       
                         
                           
                             past  year. 
                           
                         
                       
                     
                     ] 
                   
                   
                     [ 
                     
                       
                         
                           
                             Total  number  of 
                           
                         
                       
                       
                         
                           
                             units  purchased 
                           
                         
                       
                       
                         
                           
                             by  sample  outlets 
                           
                         
                       
                       
                         
                           
                             during  past  year 
                           
                         
                       
                     
                     ] 
                   
                 
                 × 
                 
                   [ 
                   
                     
                       
                         
                           Estimated  deviation 
                         
                       
                     
                     
                       
                         
                           
                             for  product   
                           
                           ⁢ 
                           X 
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           
                             when 
                           
                         
                       
                     
                     
                       
                         
                           all  outlets  are  sub- 
                         
                       
                     
                     
                       
                         
                           stituted  for  sample 
                         
                       
                     
                     
                       
                         
                           outlets 
                         
                       
                     
                   
                   ] 
                 
               
             
             
               
                 ( 
                 1 
                 ) 
               
             
           
         
       
     
   
   The manner of the above estimation is now described using an example. 
     FIG. 2  shows an example of the product characteristics data table  51  connected to the scale-up estimating routine  5 . Here, for each of products A, B, C . . . X, the product classification, price classification, consumer age classification and merchandising classification data are stored. 
     FIG. 3  shows the particulars of each of the above four classifications. The product classification comprises six classes, namely foundation cosmetic, make-up cosmetic, shampoo &amp; rinse, perfume &amp; cologne, cosmetic sundries, and men&#39;s cosmetics as represented by the numerals of  1  through  6 , respectively. The price classification comprises five classes of low, medium-low, medium, medium-high, and high. The consumer age distribution comprises five classes, namely low, intermediate between low and average, average, intermediate between average and high, and high as represented by numerals  1  through  5 , respectively. The merchandising classification comprises five classes, namely display sale, rather display sale, equivocal, rather counseling sale, and counseling sale as represented by numerals of  1  through  5 , respectively. 
   The above product characteristics data are determined at the stage of product planning and as shown by entries in the column of product X in  FIG. 2 , the above-mentioned numerals are entered and stored for respective classes of each classification. Thus, product X corresponds to Product Classification:  1  foundation cosmetic, Price Classification:  2  medium-low, Consumer Age Classification:  5  high, and Merchandising Classification:  2  rather display sale. Stated differently, product X is “a foundation cosmetic for consumers of advanced (high) age who spend in medium-to low-price goods, which is merchandised by a method of sale which is rather close to display sale.” 
     FIGS. 4A through 4E  are views showing examples of sample retail outlet characteristics data table  52 . Here, for each of sample outlets S 1 , S 2  and S 3 , data on the constitution and quantities of purchases during the past year relative to those of all retail outlets are entered and stored. Thus,  FIG. 4A  is a data table  52   a  showing the relative sale for each of sample outlets S 1 , S 2 , S 3 , . . . .  FIGS. 4B through 4E  are data tables  52   b ,  52   c ,  52   d  and  52   e  showing the product characteristic, price characteristic, consumer age characteristic and merchandising characteristic, respectively, for each of sample outlets S 1 , S 2 , S 3  . . . . The aforesaid four characteristics in these data tables  52   b ,  52   c ,  52   d  and  52   e  are represented in index numerals (1 if each is the same as the national average) in correspondence with the four classifications described hereinbefore with reference to  FIG. 3 . Thus, for example, the index for Product Classification: 1 foundation cosmetic is a 1  and the index for Price Classification: 1 low is g 1 , for sample outlet S 1 . 
   Assuming that the quantities of product X sold at sample outlets S 1 , S 2  and S 3  are Y 1 , Y 2  and Y 3 , respectively, the scale-up estimate for product X can be calculated by the following equation using the data from the aforementioned product characteristics data table  51  and the sample outlet data table  52 . Scale-up estimate for product X= 
   
     
       
         
           
             
               
                 
                   ( 
                   
                     
                       y 
                       1 
                     
                     + 
                     
                       y 
                       2 
                     
                     + 
                     
                       y 
                       3 
                     
                   
                   ) 
                 
                 × 
                 
                   1 
                   
                     
                       α 
                       1 
                     
                     + 
                     
                       α 
                       2 
                     
                     + 
                     
                       α 
                       3 
                     
                   
                 
                 × 
                 
                   
                     
                       α 
                       1 
                     
                     + 
                     
                       α 
                       2 
                     
                     + 
                     
                       α 
                       3 
                     
                   
                   
                     ( 
                     
                       
                         
                           α 
                           1 
                         
                         ⁢ 
                         
                           a 
                           1 
                         
                       
                       + 
                       
                         
                           α 
                           2 
                         
                         ⁢ 
                         
                           a 
                           2 
                         
                       
                       + 
                       
                         
                           α 
                           3 
                         
                         ⁢ 
                         
                           a 
                           3 
                         
                       
                     
                     ) 
                   
                 
                 × 
                 
                   
                     
                       α 
                       1 
                     
                     + 
                     
                       α 
                       2 
                     
                     + 
                     
                       α 
                       3 
                     
                   
                   
                     ( 
                     
                       
                         
                           α 
                           1 
                         
                         ⁢ 
                         
                           h 
                           1 
                         
                       
                       + 
                       
                         
                           α 
                           2 
                         
                         ⁢ 
                         
                           h 
                           2 
                         
                       
                       + 
                       
                         
                           α 
                           3 
                         
                         ⁢ 
                         
                           h 
                           3 
                         
                       
                     
                     ) 
                   
                 
                 × 
                 
                   
                     
                       α 
                       1 
                     
                     + 
                     
                       α 
                       2 
                     
                     + 
                     
                       α 
                       3 
                     
                   
                   
                     ( 
                     
                       
                         
                           α 
                           1 
                         
                         ⁢ 
                         
                           p 
                           1 
                         
                       
                       + 
                       
                         
                           α 
                           2 
                         
                         ⁢ 
                         
                           p 
                           2 
                         
                       
                       + 
                       
                         
                           α 
                           3 
                         
                         ⁢ 
                         
                           p 
                           3 
                         
                       
                     
                     ) 
                   
                 
                 × 
                 
                   
                     
                       α 
                       1 
                     
                     + 
                     
                       α 
                       2 
                     
                     + 
                     
                       α 
                       3 
                     
                   
                   
                     ( 
                     
                       
                         
                           α 
                           1 
                         
                         ⁢ 
                         
                           r 
                           1 
                         
                       
                       + 
                       
                         
                           α 
                           2 
                         
                         ⁢ 
                         
                           r 
                           2 
                         
                       
                       + 
                       
                         
                           α 
                           3 
                         
                         ⁢ 
                         
                           r 
                           3 
                         
                       
                     
                     ) 
                   
                 
               
             
             
               
                 ( 
                 2 
                 ) 
               
             
           
         
       
     
   
   Thus, as the set characteristics of product X are Product Classification 1, Price Classification 2, Consumer Age Classification 5 and Merchandising Classification 2 as shown in  FIG. 2 , the indexes for respective characteristics shown in  FIGS. 4B through 4E  correspond to the above classifications, namely a 1 , a 2  and a 3  for Product Characteristic  52   b, h   1 , h 2  and h 3  for Price characteristic  52   c , P 1 , P 2  and P 3  for Consumer Age Characteristic  52   d , and r 1 , r 2  and r 3  for Merchandising Characteristic  52   e.    
   The scale-up estimating routine  5  for calculating scale-up estimates is connected to a demand forecast routine  6  which predicts demands according to the scale-up estimates for respective products which are available from the scale-up estimating routine. 
   This demand forecast routine  6  performs a demand forecast in the steps shown in the flow chart of  FIG. 6  using the data stored in demand forecast data tables  61   a ,  61   b  shown in  FIGS. 5A and 5B . Thus, stored in the demand forecast data table  61   a  of  FIG. 5A  are many sales course patterns (3 patterns {circle around (1)} through {circle around (3)} in the views) during 5 days following the launching of the product and the final sales estimates applicable to the respective patterns {circle around (1)} through {circle around (3)}. Similarly stored in the demand forecast data table  61   b  shown in  FIG. 5B  are the sales course patterns after the 5 days, namely during 6 days after launching, as well as final sales estimates, for the product for which the pattern {circle around (2)} was found in the table  61   a.    
   Then, 
   Step {circle around (1)}: Receiving of daily sales course data after launching of new product X from the scale-up estimating routine  5 ; 
   Step {circle around (2)}: Selecting the relevant demand forecast data table  61  according to the number of days after launching. Thus, if it is 5 days after launching, the above table  61   a  for 5 days is selected and if it is 6 days, table  61   b  is selected. 
   Step {circle around (3)}: Searching through the data table  61  selected in step {circle around (2)} to find a sales course pattern nearest to the pattern of sales course data received. 
   Step {circle around (4)}: Finding the final sales estimate for the product. 
   Step {circle around (5)}: Transferring the above estimate to a production size determining routine  7  which is described hereinafter. 
   Thus, let it be assumed that the sales course pattern during 5 days following the launching of new product X is as shown in  FIG. 7 . Then, the demand forecast data table  61   a  shown in  FIG. 5A  is chosen as the relevant table and this table  61   a  is searched through for pattern matching. As a result, the sales course pattern of new product X is found to approximate the pattern {circle around (2)} stored in the table  61   a  and a forecast is made that at least a 2  units of this product X will be ultimately sold. Then, the production size determining routine  7  is approached accordingly. Since this final sales estimate is the lowest value selected by reference to the past sales performance, the very selection of pattern {circle around (2)} in the table  61   a  guarantees the sale of a 2  units. 
   The final sales estimate thus obtained in the demand forecast routine  6  is fed to the production size determining routine  7  connected to the demand forecast routine, where the production size is determined in the steps shown in the flow chart of  FIG. 9  using an inventory data table  71  shown in  FIG. 8 . Thus, stored in the inventory data table  71  of  FIG. 8  are the inventory quantities and past additional production request quantities for new products X, Y, Z . . . . 
   Thus, 
   Step {circle around (1)}: Retrieving the final sales estimate X for new product X from said demand forecast routine 
   Step {circle around (2)}: Retrieving the inventory quantity z and past additional production request quantity v for product X from said inventory data table  71   
   Step {circle around (3)}: Assuming that the number of days after launching of new product X is n days, calculating the sales volume by scale-up estimation for this period, 
             ∑     i   =   1     n     ⁢   yi         
(yi is the sales volume by scale-up estimation on day i after launching)
 
   Step {circle around (4)}: Calculating the required size of additional production of new product X by means of the following equation (3): 
                   X   -       ∑     i   =   1     n     ⁢   yi     -   z   -   v     =       required  size  of  additional  production     ⁢           ⁢   S             (   3   )               required size of additional production  S   (3) 
   Step {circle around (5)}: Transferring this required size of additional production S to the raw material ordering routine  8  and the control routine  4   a  for the production means  4 , which are described hereinafter. 
   Step {circle around (6)}: Updating the additional production request quantity data in the inventory data table  71  with the result of the above calculation to provide new data. 
   The required size of additional production thus determined in the production size determining routine  7  is fed to the raw material ordering routine  8  and the control routine  4   a  for the production means  4  simultaneously through the directing means (directing routine)  3  connected to the determining routine  7  for timely production. 
   As the production is completed in the production means  4 , the inventory data and past additional production request quantity data in the inventory data table  71  are updated to provide new data. Thus, the current inventory of new product X is Z units but upon receipt, from the control routine  4   a  of the production means  4 , of the information that the production of additional production request quantity S of product X has just been completed, the inventory data for product X is updated to Z+S. 
   Meanwhile, the past additional production request quantity for this product X is U units as of the present time but upon receipt of the information that the production of the required quantity S has been completed, the additional request quantity data is updated to U−S units. 
   A raw material ordering system will now be briefly explained making reference to  FIGS. 10 and 11 . This system is substantially the same as described in details in the section of Raw material ordering system I below. In this case, a raw material ordering routine  1  I  18  in  FIG. 1  is employed. Instead of this raw material ordering routine, one may utilize the system described in the section of Raw material ordering system II below. In this latter case, a raw material ordering routine II  8 ′ in  FIG. 1  is used. 
   Thus, the raw material ordering routine I  8  using the raw material data table  81  shown in  FIGS. 10A through 10D  calculates the quantities of raw materials to be ordered in the steps shown in  FIG. 11  and places orders to a raw material procurement routine  9 . This raw material data table  81  comprises a product-classified raw material constitution data table  81   a  shown in  FIG. 10A , a raw material-classified required quantity data table  81   b  shown in  FIG. 10B , a raw material-classified inventory data table  81   c  shown in  FIG. 10C , and a raw material-classified acceptance schedule data table  81   d  shown in  FIG. 10D . Entered and stored in the product-classified raw material constitution data table  81   a  are the required quantities, per unit, of constituent raw materials α, β . . . for each of product A, B . . . X. For example, these data indicate that p 1  units of raw material a are required for the production of 1 unit of product X. Similarly entered and stored in the raw material-classified required quantity data table  81   b  are the quantities α 1 , α 2 , . . . α n  an of each raw material required (to be used) on a day-to-day basis (1˜n days). Stored in the raw material-classified inventory data table  81   c  are the inventory data Zα, Zβ . . . for raw materials α, β . . . , while the acceptance schedule quantity data for raw materials α, β . . . on a day-to-day basis (1˜n days) are stored in the raw material-classified acceptance schedule data table  81   d.    
   Thus, 
   Step {circle around (1)}: Receiving required additional production quantity S for new product X from the production size determining routine  7   
   Step {circle around (2)}: Receiving scheduled production day information j, with the current day being taken as 0, from the production means  4   
   Step {circle around (3)}: Searching through the product-classified raw material constitution data table  81   a  to find the constituent raw materials for this product X and the required quantities p 1 , p 2  . . . thereof per unit of product X 
   Step {circle around (4)}: Multiplying the above required quantities p 1 , p 2  . . . of raw materials per unit by the required additional production size data S from the production size determining routine  7  to determine the required additional quantities of raw materials sp 1 , sp 2  . . . . 
   Step {circle around (5)}: Adding the required additional quantities of raw materials sp 1 , sp 2  . . . to the respective required quantities aj, bj . . . for scheduled production day j in the raw material-classified required quantity data table  81   b.    
   Step {circle around (6)}: Searching through the raw material-classified inventory data table  81   c  to find the current raw material-classified inventory volume data as of the current day. 
   Step {circle around (7)}: Calculating the excess or shortage on each of the following and subsequent days for each raw material by means of the following equation (4) and designating the day on which a shortage occurs for the first time, that is to say when the aforesaid excess/shortage becomes negative, as the delivery date. The order size at this time is determined by the following equation (5) and this order size data is fed to the raw material procurement routine  9 . Excess or shortage of raw material a on day k= 
   
     
       
         
           
             
               
                 
                   Z 
                   ⁢ 
                   
                       
                   
                   ⁢ 
                   α 
                 
                 + 
                 
                   
                     ∑ 
                     
                       i 
                       = 
                       1 
                     
                     k 
                   
                   ⁢ 
                   
                     ( 
                     
                       
                         ai 
                         * 
                       
                       - 
                       ai 
                     
                     ) 
                   
                 
               
             
             
               
                 ( 
                 4 
                 ) 
               
             
           
         
       
     
   
   
     
       
         
           
             
               
                 
                   Order  size 
                 
                 = 
                 
                   
                     
                       ∑ 
                       
                         i 
                         = 
                         1 
                       
                       n 
                     
                     ⁢ 
                     
                       ( 
                       
                         ai 
                         - 
                         
                           ai 
                           * 
                         
                       
                       ) 
                     
                   
                   - 
                   
                     Z 
                     ⁢ 
                     
                         
                     
                     ⁢ 
                     α 
                   
                 
               
             
             
               
                 ( 
                 5 
                 ) 
               
             
           
         
       
     
   
   Thus, it is found from the product-classified raw material constitution data table  81   a  that 3 p 1  units of raw material α is required for the production of 3 units of new product X, and in the raw material-classified required quantity data table  81   b , this required quantity  3   p   1 , is added to the initially required (scheduled to use) quantity aj of raw material α for scheduled production day j. In other words, aj+ 3   p   1 , units of raw material α is required on day j. This is set as the new aj. Then, assuming that the current inventory of raw material α is Zα units, it is calculated that 
             Z   ⁢           ⁢   α     +       ∑     i   =   1     k     ⁢     (       ai   *     -   ai     )             
units of raw material α will remain on day k. Assuming that this value becomes negative for the first time on day k, this day k is regarded as the delivery date for raw material α.
 
   The production means  4 , which receives a direction to produce from the directing routine  3  and performs the directed production, comprises a production unit  4   b , which is a hardware component and a control routine  4   a  which controls the production unit  4   b  according to the direction. 
   The production unit  4   b  has drive units  4   c  for setting and outputting action ranges, speeds and powers for respective machine units and these drive units  4   c  are controlled by the control routine  4   a . And as shown by the flow chart of  FIG. 12 , a drive unit output data table  41  shown in  FIG. 13  is searched through on receipt of a direction to produce for automatic switching of respective drive units  4   c . Entered and stored in this drive unit output data table  41  are the output values of drive units  1 ,  2  . . . for each of products A, B . . . Z. 
   Thus, 
   Step {circle around (1)}: Receiving a direction to produce product X from the directing means  3   
   Step {circle around (2)}: Clearing the output values memorized by respective drive units  4   c    
   Step {circle around (3)}: Searching through the drive unit output data table  41  for this product X to determine output values for the respective drive units  4   c    
   Step {circle around (4)}: Transmitting the output values to the respective drive units for temporary memorization and start of the production of product X. 
   Furthermore, this production means  4  is constituted so as to immediately respond to a direction to produce from said directing means  3 . Thus, it is so arranged, as shown in  FIG. 14 , that the production line (production unit)  4   b  to which a direction for additional production of new product X will be issued is normally used for the production of staple products A, B and C (products such that if produced in anticipation, there is no risk of carrying large inventories) which are comparatively long in delivery term and that when a direction for additional production of new product X arrives from said directing means  3 , the production of staple-products A, B and C is deferred in the order mentioned to give priority to the production of this product X. Thus, for product X, the action from step {circle around (2)} explained with reference to  FIG. 12  can be immediately commenced. 
   An example of the production means  4  is shown in  FIG. 57 , which is used for producing, for example, bottled lotions. The reference characters A 1  to A 10  and A 11  denote drive units and a control routine respectively. 
   Bottles are taken out from a box at the unit A 1 , examined at the unit A 2 , and conveyed by the unit A 3 . Cosmetic materials (lotions) are bottled by the unit A 4 . And inner caps and outer caps are fastened by the units A 4  and A 5  respectively. The outer appearance of the bottles are then examined by the unit A 7 . A few bottles are packed in a box at the unit A 81  a certain number of such boxes are packed in a larger box at the unit A 9 , and furthermore a certain number of the larger boxes are packed in a still larger box at the unit A 10 . These drive units are controlled by a control routine A 11 . 
     FIG. 58  shows another example of the production means  4  which is used for producing other products. The reference characters B 1 , to B 6  denote drive units and B 7  denotes a control routine. Containers are filled at B 1  and are processed at B 2  and further packaged at B 3 . An exterior of the packaged product is treated at B 4  and B 5  and then put into a final larger package at B 6 . Products are processed in drive units B 1 , to B 6  and the drive units B 1  to B 6  are controlled by the control routine B 7  as in  FIG. 57 . 
   Raw Material Ordering System I 
     FIGS. 15 through 32  show a raw material ordering system embodying the present invention. In this system, a raw material ordering routine I  8  in  FIG. 1  is used. 
     FIG. 15  is a view showing the overall construction of the raw material ordering system of the embodiment. As shown, this system comprises an order size determining means A and a data input processing means B. 
   The order size determining means A comprises an initial setting routine  101 , a production plan setting routine  102 , a required quantity setting routine  103 , a production plan modifying routine  104 , a required quantity modifying routine  105  and a order size determining routine  106 . 
   Connected to the initial setting routine  101  are an inventory data table  107  shown in  FIG. 16 , a production plan data table  108  shown in  FIG. 17 , a production plan modification transfer data table  109  shown in  FIG. 18  and a required quantity data table  110  shown in  FIG. 19 , so that for the data stored in these respective tables  107 ,  108 ,  109  and  110 , initial setting may be performed in the steps shown in a flow chart of  FIG. 20 . Thus, in the inventory data table  107  shown in  FIG. 16 , inventory quantity data for respective raw materials are stored, while daily production plan data for respective raw materials are stored in the production plan data table  108 . The production plan modification transfer data table  109  is designed for effecting the transfer of data when a modification of data in the required quantity data table  110  shown in  FIG. 19  is made in response to modification of data in said production data table  108  and its details are described hereinafter. 
   Stored in the required quantity data table  110  are the data representing the required quantities of respective raw materials respective days. 
   Step {circle around (1)}: Receiving an input of the current actual inventory quantity W of raw material Ri 
   Step {circle around (2)}: Replacing the inventory quantity Zi for Ri in said inventory data table  107  with W to provide a new value of Zi 
   Step {circle around (3)}: Confirming that all of the above procedures have been completed for all raw materials. If the answer is affirmative, the sequence proceeds: 
   Step {circle around (4)}: Resetting all the production plan data Xij in the production plan data  108  to zero. 
   Step {circle around (5)}: Resetting all the transfer data ΔXij in the production plan modification transfer data table  109  to zero. 
   Step {circle around (6)}: Resetting all the required quantity data Yig in the required quantity data table  110  (made zero) to complete the initial setting. 
   Thus, the actual current inventory may not necessarily be in agreement with the difference found by subtracting the used quantity from the initial inventory data but some error due to breakage or the like is more or less inevitable. Therefore, it is necessary to first correct all the inventory data at the beginning processing. For the production plan data, production plan modification transfer data and required quantity data, too, all the initial values are reset starting from zero. 
   After such initial setting, production plan setting is carried out in the production plan setting routine  102 . This production plan setting routine  102  is connected to the production plan data table  108  so that production plan setting can be made in accordance with the flow chart of  FIG. 21 . Thus, 
   Step {circle around (1)}: Receiving a production plan input X for day d for product Pi 
   Step {circle around (2)}: Substituting X for the production plan data which has been initialized to zero by initial setting to provide a new Xid value 
   Step {circle around (3)}: Confirming that production plan setting has been completed for all products to complete the processing. 
   Then, the required quantities of respective raw materials in an initial stage are calculated in a required quantity setting routine  103 . Connected to this required quantity setting routine  103  are the production plan data table  108 , required quantity data table  110  and product constitution data table  111  and the initial required quantities are calculated in the steps shown in the flow chart of  FIG. 22 . Stored in the product constitution data table  111  are the quantities of respective raw materials necessary for the production of one unit of each product. 
   Step {circle around (1)}: Retrieving the production plan size Xid for day d for product Pi from the production plan data table  108   
   Step {circle around (2)}: Retrieving the required quantities Ci 1 , Ci 2  . . . and Cin of raw materials for the production of one unit of product Pi from the product constitution data table  111   
   Step {circle around (3)}: Multiplying Cij (j=1, 2 . . . , n) by the Xid to prepare Yid (j=1, 2 . . . , n) in the required quantity data table  110   
   Step {circle around (4)}: Confirming that the above procedure has been completed. The required quantity setting is thus completed. 
   The flow from initial setting from required quantity setting has been described so far. Now, the flow for modifying the required quantity data in response to modification of production plan data is explained below. 
   Modification of production plan data is carried out in the production plan modifying routine  104  in the steps shown in the flow chart of  FIG. 24 . Connected to this production plan modifying routine  104  is not only the production plan data table  108  but also the production plan modification transfer data table  109  shown in  FIG. 18 . Thus, 
   Step {circle around (1)}: Receiving a production plan input X for day d for product Pi 
   Step {circle around (2)}: Retrieving the production plan data Xid for day d for product Pi from the production plan data table  108   
   Step {circle around (3)}: Calculating the difference ΔX between X and Xid 
   Step {circle around (4)}: Replacing the Xid value with X to provide a new Xid value 
   Step {circle around (5)}: Retrieving the production plan modification amount ΔXid for day d for product Pi from the production plan modification transfer data table  109   
   Step {circle around (6)}: Adding the ΔX to this ΔXid to provide a new ΔXid value 
   Step {circle around (7)}: Confirming that there is no change in the other production plan data. The modification of production plan data is thus completed. 
   As the production plan data are thus modified, modification of required quantity data is automatically carried out in the required quantity modifying routine  105 . Connected to this required quantity modifying routine  105  are the production plan modification transfer data table  109 , product constitution data table  111  and required quantity data table  110  and the modification of required quantity data is performed in the steps shown in the flow chart of  FIG. 25 . Thus, 
   Step {circle around (1)}: Retrieving the production plan modification amount ΔXid for day d for product Pi from the production plan modification transfer data table. 
   Step {circle around (2)}: Retrieving the required quantities Ci 1 , Ci 2  . . . Cin of raw materials for the production of one unit of product Pi from the product constitution data table  111   
   Step {circle around (3)}: Retrieving the required quantities Y 1 d, Y 2 d . . . and Ynd of respective raw materials for day d from the required quantity data table  110   
   Step {circle around (4)}: Adding the product of Cij (j=1, 2 . . . , n) multiplied by ΔXid to the Yjd (j=1, 2 . . . and n) to provide a new Yid value 
   Step {circle around (5)}: Resetting ΔXid to zero in the production plan modification transfer data table  109   
   Step {circle around (6)}: Confirming that all the above procedure has been completed. The modification of required quantities is thus completed. 
   Thus, if a change is made in the production plan, modification of the required quantity data table  110  is made through the production plan modification transfer data table  109  from the production plan data table  108 . For this reason, even if changes in the production plan take place in close sequence for one given product, the modification of required quantities can be easily carried out. 
   After the above setting or modification of required quantities of raw materials for each day, calculation of quantities to be ordered is carried out in the order size determining routine  106 . 
   Connected to this order size determining routine  106  are not only the inventory data table  107  and required quantity data table  110  but also the raw material attribute data table  112 , the in-process order data table  113  and the order backlog data table  114 , and the calculation of the order size is performed in the steps shown in the flow chart of  FIG. 26 . 
     FIG. 27  shows an example of the raw material attribute data table  112 . As shown, stored in this raw material attribute data table  112  are the names of suppliers of respective raw materials, standard lead times, daily supply quantities and safe inventory levels as data representing attributes of the respective raw materials. Furthermore, the in-process order data table  113  shown in  FIG. 28  and the order backlog data table  114  shown in  FIG. 29  contains daily in-process order data and order backlog data, respectively, for respective raw materials. 
   Step {circle around (1)}: Retrieving the standard lead time Ti, daily supply quantity Qi and safe inventory level Si for raw material Ri from the raw material attribute data table  112   
   Step {circle around (2)}: Adding the standard lead time Ti to the current relative date d and setting the result as the designated delivery date T*. Thus, in initial setting, the standard lead time as such becomes the designated delivery date. 
   Step {circle around (3)}: Retrieving the inventory data Zi of raw material Ri from the inventory data table  107   
   Step {circle around (4)}: Retrieving the daily required quantities Yi 1 , Yi 2  . . . and Yir of raw material Ri from the required quantity data table  110   
   Step {circle around (5)}: Copying said Yi 1 , Yi 2  . . . and Yir to provide Y 1 *, Y 2 * . . . and Yr* 
   Step {circle around (6)}: Calculating the minimum k (k=T*, T*+1, . . . , r) that satisfies the following inequality (1) . . . using the above values 
   
     
       
         
           
             
               
                 
                   
                     ∑ 
                     
                       j 
                       = 
                       1 
                     
                     k 
                   
                   ⁢ 
                   
                     Yj 
                     * 
                   
                 
                 ≦ 
                 
                   Zi 
                   + 
                   
                     
                       ( 
                       
                         k 
                         - 
                         
                           T 
                           * 
                         
                         + 
                         1 
                       
                       ) 
                     
                     × 
                     Qij 
                   
                   - 
                   Si 
                 
               
             
             
               
                 ( 
                 1 
                 ) 
               
             
           
         
       
     
   
   Step {circle around (7)}: Designating the smallest of the calculated k values as K and altering the Yk* value using the following equation (3)
 
 Yk*=Yk*+Si  
 
   Step {circle around (8)}: Determining k 1  and k 2  (k 1 =1, 2 . . . and r−1; k 2 =r, . . . , k 1 +2, k 1 +1) which satisfy the following inequality (4) 
   
     
       
         
           
             
               
                 
                   
                     ( 
                     
                       
                         k 
                         2 
                       
                       - 
                       
                         k 
                         1 
                       
                     
                     ) 
                   
                   × 
                   Qi 
                 
                 &lt; 
                 
                   
                     ∑ 
                     
                       j 
                       = 
                       
                         k 
                         1 
                       
                     
                     
                       k 
                       2 
                     
                   
                   ⁢ 
                   
                     Yi 
                     * 
                   
                 
                 ≦ 
                 
                   
                     ( 
                     
                       
                         k 
                         2 
                       
                       - 
                       
                         k 
                         1 
                       
                       + 
                       1 
                     
                     ) 
                   
                   × 
                   Qi 
                 
               
             
             
               
                 ( 
                 4 
                 ) 
               
             
           
         
       
     
   
   Step {circle around (9)}: Calculating D by the following equation (5) using the k 1  and k 2  values determined as above 
   
     
       
         
           
             
               
                 D 
                 = 
                 
                   
                     
                       ∑ 
                       
                         j 
                         = 
                         
                           k 
                           1 
                         
                       
                       
                         k 
                         2 
                       
                     
                     ⁢ 
                     
                       Yi 
                       * 
                     
                   
                   - 
                   
                     
                       ( 
                       
                         
                           k 
                           2 
                         
                         - 
                         
                           k 
                           1 
                         
                       
                       ) 
                     
                     × 
                     Qi 
                   
                 
               
             
             
               
                 ( 
                 5 
                 ) 
               
             
           
         
       
     
   
   Step {circle around (10)}: Provided that D&lt;Yk 1 *, adding  1  to k 1 . The sequence then returns to step {circle around (9)}. Provided that D≧Yk 1 *, effecting the following changes
 
 Yk   1   *=D   (i)
 
 Yj*=Qi   (ii)
 
( j=k   1 +1 , k   2  +2  , . . . , k   2 )
 
   Step {circle around (11)}: Checking to see whether the k 1  has reached r. If not, substituting k 2  for k 1  and repeating the sequence from step {circle around (8)}. 
   The modification of required quantity data is complete when k 1  has reached r and this means a completion of the required quantity data table  110 . 
   Prior to proceeding to the next step, the above flow is explained using specific values for ease of understanding. 
   Step {circle around (1)}: Let it be assumed that the data on raw material R 1  in the raw material attribute data table  112  are as follows. 
   Standard lead time T 1 =4 days 
   Daily supply quantity Q 1 =8 units 
   Safe inventory level S 1 =2 units 
   Step {circle around (2)}: Designated delivery day T*=T 1 =4 
   Step {circle around (3)}: In the inventory data table  107 , the inventory quantity Z 1  of raw material R 1 =23 units. 
   Step {circle around (4)}: From the required quantity data table  110 , the current daily requirements of raw material R 1  are retrieved as shown in the following table. 
   
     
       
             
             
           
             
             
             
             
             
             
             
             
             
             
             
           
         
             
                 
                 
             
             
                 
               Day 
             
           
        
         
             
               Raw material 
               1 
               2 
               3 
               4 
               5 
               6 
               7 
               8 
               9 
               10 
             
             
                 
             
             
               R1 
               5 
               8 
               6 
               10  
               4 
               7 
               9 
               4 
               2 
               6 
             
             
                 
             
           
        
       
     
   
   step {circle around (5)}: Y 1 *=5, Y 2 *=8, Y 3 *=6, . . . , Y 10 *=6. 
   Step {circle around (6)}: Among k=T*, T*+1, . . . , 10, i.e. k=4, 5, . . . , 10, k=4 does not satisfy the inequalities because 
               ∑     j   =   1     4     ⁢     Yj   *       =   29           Z   1 +( k−T*+ 1)× Q−S   1 =25 
However, k=5 satisfies the inequalities, thus
 
               ∑     j   =   1     5     ⁢     Yj   *       =   33           Z   1 +( k−T*+ 1)× Q−S   1 =33 
   Step {circle around (7)}: k=5, and Y 5 *=Y 5 *+S 1 =4+2=6. Therefore, the current setting Y 5 *=4 is altered to Y 5 *=6. 
   Step {circle around (8)}: Search to find that k 1  and k 2  which satisfy the following equality 
               (       k   2     -     k   1       )     ×   Qi     &lt;       ∑     j   =     k   1         k   2       ⁢     Yi   *       ≦       (       k   2     -     k   1     +   1     )     ×   Qi           
are k 1 =3 and k 2 =4.
 
   
     
       
         
           
             
               ( 
               
                 4 
                 - 
                 3 
               
               ) 
             
             × 
             8 
           
           = 
           
             
               8 
               &lt; 
               
                 
                   ∑ 
                   
                     j 
                     = 
                     3 
                   
                   4 
                 
                 ⁢ 
                 
                   Yj 
                   * 
                 
               
             
             = 
             
               
                 16 
                 ≦ 
                 
                   
                     ( 
                     
                       4 
                       - 
                       3 
                       + 
                       1 
                     
                     ) 
                   
                   × 
                 
               
               = 
               16 
             
           
         
       
     
   
   Step {circle around (9)}: 
   
     
       
         
           D 
           = 
           
             
               
                 
                   ∑ 
                   
                     j 
                     = 
                     3 
                   
                   4 
                 
                 ⁢ 
                 
                   Yj 
                   * 
                 
               
               - 
               
                 
                   ( 
                   
                     4 
                     - 
                     3 
                   
                   ) 
                 
                 × 
                 8 
               
             
             = 
             8 
           
         
       
     
   
   Step {circle around (10)}: Since D=8≧Yk 1 *=6, set
 
Y 3 *=8  (i)
 
Y 4 *=8  (ii)
 
Thus, the settings Y 3 *=6 and Y 4 *=10 are respectively changed to 8.
 
   Step {circle around (11)}: Since k 1 =3 and has not reached r=10, select k 1 =4 and repeat the sequence from step {circle around (8)}. 
   Then, k 1 =6 and k 2 =7 are found and, as a result, the following changes are made in step {circle around (10)}.
 
Y 6 *=8  (i)
 
Y 7 *=8.  (ii)
 
   After the above modification, the required quantity data table  110  is as follows. 
   
     
       
             
             
           
             
             
             
             
             
             
             
             
             
             
             
           
         
             
                 
                 
             
             
                 
               Day 
             
           
        
         
             
               Raw material 
               1 
               2 
               3 
               4 
               5 
               6 
               7 
               8 
               9 
               10 
             
             
                 
             
             
               R 1   
               5 
               8 
               8 
               8 
               6 
               8 
               8 
               4 
               2 
               6 
             
             
                 
             
           
        
       
     
   
   Comparison of the above table with the pre-modification table shows that the quantity of 4 units on day 5 has been changed to the quantity of 6 units, and the required quantity of 10 units on day 4 and that of 9 units on day 7 have been advanced to day 3 and day 6, respectively, indicating that the data have been made compatible with the daily supply quantity of raw material R 1 , which data supplements the safe inventory level at a suitable timing. 
   Now, referring back to the flow chart of  FIG. 26 , the sequence from step {circle around (12)} is explained. 
   Step {circle around (12)}: From the in-process order data table  113 , the daily in-process quantities fi 1 , fi 2 , . . . and fir of raw material R 1  are retrieved. 
   Stored in this in-process order data table  113  are the quantities of raw materials for which orders have already been placed but are yet to be included in the inventory quantities Zi. 
   Step {circle around (13)}: From the order backlog data table  114 , the daily order backlog quantities gi 1 , gi 2 , . . . and gir of raw material R 1  are retrieved. 
   Step {circle around (14)}: The following equation (6) is calculated. 
   
     
       
         
           
             
               
                 F 
                 = 
                 
                   zi 
                   + 
                   
                     
                       ∑ 
                       
                         j 
                         = 
                         i 
                       
                       r 
                     
                     ⁢ 
                     fij 
                   
                   + 
                   
                     
                       ∑ 
                       
                         j 
                         = 
                         1 
                       
                       r 
                     
                     ⁢ 
                     gij 
                   
                   - 
                   
                     
                       ∑ 
                       
                         j 
                         = 
                         1 
                       
                       r 
                     
                     ⁢ 
                     
                       Yj 
                       * 
                     
                   
                 
               
             
             
               
                 ( 
                 6 
                 ) 
               
             
           
         
       
     
   
   Step {circle around (15)}: Provided that F&gt;0 and 
                 ∑     j   =   1     r     ⁢   fij     &gt;   0     ,         
a negative order sheet is executed for fij&gt;0 and the particular fij is reset to 0. Here, the order of fij data to be thus processed begins with the one in which j is closest to r, that is to say the last one.
 
   Step {circle around (16)}: The following equation is calculated. 
                   F   *     =         ∑     j   =   1       T   *       ⁢     Yj   *       -   Zi   -       ∑     j   =   1       T   *       ⁢   fij     -       ∑     j   =   1       T   *       ⁢   gij               (   7   )               
Provided that F*&gt;0, the order size is set to F* and an order sheet is printed. Then, fiT*+F* is calculated to set fiT*.
 
   Step {circle around (17)}: Finally, it is confirmed that all the above processing has been completed for all the raw materials. 
   Now, the sequence beginning with step {circle around (12)} following the aforesaid step {circle around (11)} is described in further detail. 
   Steps {circle around (12)}, {circle around (13)}: From the in-process order data table  113  and order backlog data table  114 , the daily in-process quantity and daily order backlog quantity data for raw material R 1  are retrieved as shown in the following table. It should be noticed that the figures in the top row represent the daily requirements of raw material R 1  as determined up to step {circle around (11)}. 
   
     
       
             
             
             
             
             
             
             
           
             
             
             
             
             
             
             
           
             
             
             
             
             
             
             
           
         
             
                 
                 
             
           
           
             
                 
               Day 
               1 
               2 
               3 
               4 
               5 
             
             
                 
                 
             
             
                 
               Yj* 
               5 
               8 
               8 
               8 
               6 
             
           
        
         
             
                 
               f 1 j 
               7 
               0 
               3 
               Omitted 
                 
             
             
                 
               g 1 i 
               5 
               4 
               0 
               Omitted 
             
             
                 
                 
             
           
        
         
             
                 
               Day 
               6 
               7 
               8 
               9 
               10 
             
             
                 
                 
             
             
                 
               Yi* 
               8 
               8 
               4 
               2 
                6 
             
             
                 
               f 1 j 
               — 
               — 
               — 
               — 
               — 
             
             
                 
               f 1 j 
               — 
               — 
               — 
               — 
               — 
             
             
                 
                 
             
           
        
       
     
   
   Step {circle around (14)}: The following equation is calculated 
   
     
       
         
           F 
           = 
           
             
               Z 
               1 
             
             + 
             
               
                 ∑ 
                 
                   j 
                   = 
                   1 
                 
                 10 
               
               ⁢ 
               
                 
                   f 
                   1 
                 
                 ⁢ 
                 i 
               
             
             + 
             
               
                 ∑ 
                 
                   j 
                   = 
                   1 
                 
                 10 
               
               ⁢ 
               gij 
             
             - 
             
               
                 ∑ 
                 
                   j 
                   = 
                   1 
                 
                 10 
               
               ⁢ 
               
                 Yj 
                 * 
               
             
           
         
       
     
   
   Step {circle around (15)}: Provided that F&gt;0 and 
                 ∑     j   =   1     10     ⁢       f   1     ⁢   j       &gt;   0     ,         
it means that the order size is excessive. Therefore, the f 1 j settings are changed to zero from the back, i.e. starting with day 10.
 
   The result is assumed to be as follows. 
   
     
       
             
             
           
             
             
             
             
             
             
             
             
             
             
             
           
             
             
             
             
             
             
             
             
             
             
             
           
         
             
                 
                 
             
             
                 
               Day 
             
           
        
         
             
                 
               1 
               2 
               3 
               4 
               5 
               6 
               7 
               8 
               9 
               10 
             
             
                 
                 
             
           
        
         
             
               Yj* 
               5 
               8 
               8 
               8 
               6 
               8 
               8 
               4 
               2 
               6 
             
             
               f 1 j 
               0 
               0 
               0 
               0 
               0 
               0 
               0 
               0 
               0 
               0 
             
             
               g 1 j 
               5 
               0 
               0 
               0 
               0 
               0 
               0 
               0 
               0 
               0 
             
             
                 
             
           
        
       
     
   
   Step  16 : Since 
             F   *     =           ∑     j   =   1     4     ⁢     Y   1   *       -   23   -       ∑     j   =   1     4     ⁢       f   1     ⁢   j       -       ∑     j   =   1     4     ⁢       g   1     ⁢   i         =   1           
and F*&gt;0, the order size is set to 1, an order sheet is printed, And f 14  is set to 1.
 
   After the order size has thus been determined in the order size determining routine A, the order sheet is issued and the data processing is carried out in the data input processing means B. This data input processing means B comprises an order acceptance data input processing routine  115 , a raw material acceptance data input processing routine  116  and a production data input processing routine  117 . 
   Connected to the order acceptance data input processing routine  115  are the order backlog data table  114  and in-process order data table  113  and the data processing is performed in the steps shown in the flow chart of  FIG. 30 . 
   Thus, 
   Step {circle around (1)}: Retrieving the data on the order quantity L and scheduled delivery day d for raw material Ri from the order acknowledgement from the supplier of the raw material 
   Step {circle around (2)}: Retrieving the order backlog quantity gid for day d for raw material Ri from the order backlog data table  114   
   Step {circle around (3)}: Adding the order quantity L to the order backlog quantity gid to set a new gid value 
   Step {circle around (4)}: Retrieving the in-process order quantities fi 1 , fi 2 , . . . and fir for raw material Ri from the in-process order data table  113 . 
   Step {circle around (5)}: Searching for k which satisfies the following inequality (8) (provided, however, that fi 0 =0) 
   
     
       
         
           
             
               
                 
                   
                     ∑ 
                     
                       j 
                       = 
                       1 
                     
                     
                       k 
                       - 
                       1 
                     
                   
                   ⁢ 
                   fig 
                 
                 ≤ 
                 L 
                 &lt; 
                 
                   
                     ∑ 
                     
                       j 
                       = 
                       1 
                     
                     k 
                   
                   ⁢ 
                   fij 
                 
               
             
             
               
                 ( 
                 8 
                 ) 
               
             
           
         
       
     
   
   Step {circle around (6)}- 1 : If there exists one, 
   (i) The fi 1 , fi 2 , . . . and fir values retrieved in step {circle around (4)} are made 0, and 
   
     
       
         
           
             
               ( 
               ii 
               ) 
             
             ⁢ 
             
                 
             
             ⁢ 
             
               
                 ∑ 
                 
                   j 
                   = 
                   i 
                 
                 k 
               
               ⁢ 
               fij 
             
           
           - 
           L 
         
       
     
   
   L is calculated and the result is set as a new fik value. 
   Step {circle around (6)}: If there is none, the initial order backlog quantity gid is reinstated and it is judged that there was an error in the input data. 
   Step {circle around (7)}: Confirming that there is no other order acknowledgement-data. The input processing of order acknowledgement data is now complete. 
   Connected to the raw material acceptance data input processing routine  116  are the inventory data table  107  and order backlog data table  114  and the data processing is performed in the steps shown in the flow chart of  FIG. 31 . Thus, 
   Step {circle around (1)}: Receiving an acceptance quantity input U for raw material Ri 
   Step {circle around (2)}: Retrieving the inventory quantity Zi for raw material Ri from the inventory data table  107   
   Step {circle around (3)}: Adding the acceptance quantity U to the inventory quantity Zi to provide a new Zi value 
   Step {circle around (4)}: Retrieving the order backlog quantities gi 1 , gi 2 , . . . and gir of raw material Ri from the order backlog data table  114 . 
   Step {circle around (5)}: Searching for k which satisfies the following inequality (9) (provided, however, that gi 0 =0) 
   
     
       
         
           
             
               
                 
                   
                     ∑ 
                     
                       j 
                       = 
                       i 
                     
                     
                       k 
                       - 
                       1 
                     
                   
                   ⁢ 
                   gij 
                 
                 ≤ 
                 U 
                 &lt; 
                 
                   
                     ∑ 
                     
                       j 
                       = 
                       1 
                     
                     K 
                   
                   ⁢ 
                   gij 
                 
               
             
             
               
                 ( 
                 9 
                 ) 
               
             
           
         
       
     
   
   Step {circle around (6)}- 1 : If there exists one, 
   (i) gi 1 , gi 2 , . . . and gi (k−1) are set to 0, and 
   
     
       
         
           
             
               ( 
               ii 
               ) 
             
             ⁢ 
             
                 
             
             ⁢ 
             
               
                 ∑ 
                 
                   j 
                   = 
                   1 
                 
                 k 
               
               ⁢ 
               gij 
             
           
           - 
           U 
         
       
     
   
   U is calculated 
   and the result is set as a gik value. 
   Step {circle around (6)}- 2 : If there is one, 
   the initial inventory quantity value Zi is reinstated and it is judged that an error occurred in input data. 
   Step {circle around (7)}: Confirming that there are no other raw material acceptance data. The input processing of raw material acceptance data is now complete. 
   And in the production data input processing routine  117 , using the data stored in the production plan data table  108 , production data modification transfer data table  109 , inventory data table  107  and product constitution data table  111 , which are connected thereto, the input processing of production data is carried out in the steps shown in the flow chart of  FIG. 32 . 
   Thus, 
   Step {circle around (1)}: Receiving a production data input V for product Pi 
   Step {circle around (2)}: Retrieving the production plan data Xi 1 , Xi 2 , . . . and Xir for product Pi from the production plan data table  108   
   Step {circle around (3)}: Comparing the production data V with 
   
     
       
         
           
             ∑ 
             
               j 
               = 
               1 
             
             r 
           
           ⁢ 
           Xij 
         
       
     
   
   If V is larger, V* is set to 
   
     
       
         
           
             ∑ 
             
               j 
               = 
               1 
             
             r 
           
           ⁢ 
           
             Xij 
             . 
           
         
       
     
   
   If V is smaller, V* is set to V. 
   Step {circle around (4)}: Searching for K which satisfies the following inequality (10) (provided, however, that 
   
     
       
         
           
             
               
                 
                   
                     
                       
                         
                           Xi 
                           0 
                         
                         = 
                           
                         ⁢ 
                         0 
                       
                       ) 
                     
                   
                 
                 
                   
                     
                         
                       ⁢ 
                       
                         
                           
                             ∑ 
                             
                               j 
                               = 
                               1 
                             
                             
                               k 
                               - 
                               1 
                             
                           
                           ⁢ 
                           Xij 
                         
                         ≦ 
                         
                           V 
                           * 
                         
                         ≦ 
                         
                           
                             ∑ 
                             
                               j 
                               = 
                               1 
                             
                             k 
                           
                           ⁢ 
                           Xij 
                         
                       
                     
                   
                 
               
             
             
               
                 ( 
                 10 
                 ) 
               
             
           
         
       
     
   
   Step {circle around (5)}: Retrieving the daily increase/decrease value ΔXi 1 , ΔXi 2 , . . . and ΔXir for product Pi from the production plan modification transfer data table (9) 
   Step {circle around (6)}: Calculating ΔXij−Xij to provide a new ΔXij value (j=1, 2, . . . , k−1) 
   Step {circle around (7)}: Set Xij to 0 
   Step {circle around (8)}: Calculating 
   
     
       
         
           ΔXik 
           - 
           
             [ 
             
               
                 V 
                 * 
               
               - 
               
                 
                   ∑ 
                   
                     j 
                     = 
                     1 
                   
                   
                     k 
                     - 
                     1 
                   
                 
                 ⁢ 
                 Xij 
               
             
             ] 
           
         
       
     
   
   to provide ΔXik 
   Step {circle around (9)}: Calculating 
   
     
       
         
           
             
               ∑ 
               
                 j 
                 = 
                 1 
               
               k 
             
             ⁢ 
             Xij 
           
           - 
           
             V 
             * 
           
         
       
     
   
   to provide a new Xik value. 
   Step {circle around (10)}: Retrieving the inventory quantity Zi of product Pi from the inventory data table  107   
   Step {circle around (11)}: Retrieving the required quantities Ci 1 , Ci 2 , . . . and Cin of raw material Ri for the production of one unit of product Pi from the product constitution data table  111   
   Step {circle around (12)}: Calculating the used quantity Cij×V of raw material Ri (j=1, 2, . . . and n) and subtract the result to provide a new Zj value. 
   Step {circle around (13)}: Confirming that there is no other production data to be input. The input processing of production data is now complete. 
   Thus, in the data input processing means B, updating of data is automatically carried out according to the order acknowledgement data, raw material acceptance data and production data incoming in sequence. Therefore, the data in the tables such as the inventory data table  107 , production plan data table  108  and required quantity data table  110  are always reflecting flexibly the changes in the flow of raw materials and so on, thus eliminating the risk of placing orders without true needs. 
   Furthermore, since the required quantity of each raw material can be ordered with certainty on a day-to-day basis, the risk of delay in production due to delays in receipt of raw materials can also be obviated. 
   Raw Material Ordering System II 
     FIGS. 33 through 56  show another embodiment of the raw material ordering system according to the present invention. In this case, a raw material ordering routine II  8 ′ is used. 
     FIG. 33  shows the overall construction of the raw material ordering system of this embodiment as applied to the ordering of parts. 
   As shown, this system comprises a data register means XA, a parts demand setting means XB, and a parts control means XC. 
   The data register means XA comprises a parts inventory register routine  201 , an in-process inventory register routine  202 , a parts inventory calculating routine  1203 , a parts inventory calculating routine II  204 , a parts release data table initializing routine  205 , a parts order data table initializing routine  206  and a data table register routine  207 . 
   The parts inventory register routine  201  is connected to a parts inventory data table  208  shown in  FIG. 34  and the current actual parts inventory quantities are registered in this routine  201 . Thus, since, the true inventory quantity does not necessarily agree with the difference determined by subtracting the used quantity from the initial inventory quantity data but contains some error due to breakage etc., it is necessary to correct for the error, for example at the end of each month. And when the current inventory quantity data of, for example, part code P is P units, this number is registered as R (real) inventory of part code P in the parts inventory data table  208 . 
   The in-process inventory register routine  202  is connected to an in-process inventory data table  209  shown in  FIG. 35  and the in-process inventory quantity is registered in this routine  202 . Thus, when the in-process inventory quantity of product A in process i is a units, the inventory quantity of A in process i in the in-process inventory data table  209  is registered as a units. 
   After the registration of R inventory (real stock) in the parts inventory data table  208  and the in-process inventory quantity of each product item in each process in the in-process inventory table  209 , the V inventory (the stock at a given stage in the manufacturing process, such as surface treatment, assembling, etc.) and S inventory (cumulative stock) quantities are calculated in the parts inventory calculating routine I 203  and the parts inventory calculating routine II 204 , respectively. 
   The above parts inventory calculating routine I 203  is connected to the parts inventory data table  208 , a parts constitution data table  210  and a parts processing data table  211 , which store parts history information, a parts order data table  212  and a parts release data table  213 , and the V inventory of the parts is calculated in the steps shown in  FIG. 40 . 
     FIG. 36  shows the above parts constitution data table  210 . Stored in this table are the constitution data of the parts. The constitution data are the data showing the relationship between the daughter part before assembling and the mother part after assembling as expressed in the number of daughter parts required for the constitution of each mother part after assembling. Thus, referring to  FIG. 36 , the mother part X consists of ψ 1  units of daughter part U, ψ 2  units of daughter part V and ψ 3  units of daughter part W. Stored in the parts processing data table  211  are the processing data of respective parts as shown in  FIG. 37 . The processing data mentioned above represent the relationship between the before-part prior to processing and the after-part after processing such as a surface treatment. Thus,  FIG. 37  indicates that the processing of before-part P gives after-part Q and that the processing of this part Q as a before-part gives after-part T or U. 
   Stored in the parts order data table  212  are the order numbers and suppliers, delivery terms, order quantities and acceptance quantities of parts as shown in  FIG. 38 , while the parts release slip numbers, relevant manufacturers and release quantities of parts are stored in the parts release data table  213  as shown in  FIG. 39 . 
   Thus, 
   Step {circle around (1)}: Retrieving the current V inventory data P′ for part code P from the parts inventory data table  208   
   Step {circle around (2)}: Determining the total release quantity Σh of part code P from the parts release data table  213   
   Step {circle around (3)}: Retrieving the mother part code of part code P from the parts constitution data table  210   
   Step {circle around (4)}: Searching through the parts order data table  212  to find the quantity P 1  (acceptance quantity) of part code P delivered under the mother part code assigned by conversion of the part code P to the mother part code 
   Step {circle around (5)}: Retrieving the after-part code of part code P from the parts processing data table  211   
   Step {circle around (6)}: Searching through the parts order data table  212  to find the quantity P 2  (acceptance quantity) of part code P delivered under the after-part code assigned by conversion of the part code P to the after-part code. 
   Step {circle around (7)}: Calculating P′+Σh−P 1 −P 2  and setting the result as a new V inventory P′ of part code P in the parts inventory data table  208   
   Thus, at the time-point of delivery of parts of part code P as mother parts or after-parts, the corresponding quantity is not treated as the inventory of parts of part code P but dealt with as the inventory of mother parts or after-parts so that only the data of parts which have been released as parts of part code P but not yet to be delivered as mother parts or after-parts is dealt with as the V inventory data of part code P. Thus, assuming that 100 units of part code P have been released for processing and 50 units of after-part code Q of part code P have already been received by an assembly line downstreams of the processing stage, the inventory quantity of part code P in the processing stage is registered as 50 units. In this manner, the quantity of parts currently remaining in the form of part code P as an inventory can be clearly grasped. And as the 100 units of part P released for processing are sequentially subjected to processing and assembling, they change form smoothly in the data along the line of flow, for example 50 units of part P and  50  units of after-part Q at the moment, so that an accurate and constant tab can be maintained on what forms (conditions) of inventory are existing in what quantities in respective stages of production. Connected to the parts inventory calculating routine II 204  are parts inventory data table  208 , parts constitution data table  210 , parts processing data table  211  and in-process inventory data table  209 , as well as a product constitution data table  214 , and the S inventory (cumulative inventory) of the parts is calculated in the steps shown in  FIG. 41 . Stored in the product constitution data table  214  are the part codes, process codes and constituent numbers of parts necessary for respective products as shown in  FIG. 42 . 
   Thus, 
   Step {circle around (1)}: Retrieving the R inventory P and V inventory P′ of part code P from the parts inventory data table  208   
   Step {circle around (2)}: Searching through the parts inventory data table  208  and the parts constitution data table  210  or the parts processing data table  211  to count all the quantities of part code P and setting the total count as P 1    
   Step {circle around (3)}: Searching through the in-process inventory data table  209 , the product constitution data table  214  and the parts constitution data table  210  or the parts processing data table  211  to count all the quantities of part code P and setting the total as P 2    
   Step {circle around (4)}: Calculating P*=P+P′+P 1 +P 2  and setting the result as the S inventory P in the parts inventory data table  208 . 
   Thus, the parts bearing the part code P and those bearing various derivative forms of the original part code P are all counted retrogradely to arrive at the cumulative inventory (S inventory) of part code P. 
   Then, in the parts inventory calculating routine I 203 , the released quantity registered in the parts release data table  213  is counted as V inventory, and in the parts release data table initializing routine  205 , all the data in the parts release data table  213  are erased. 
   In the parts order data table initializing routine  206 , the difference between order quantity and acceptance quantity in the parts order data table  212  is set as the new order quantity, while the acceptance quantity is set as zero. The data registration processing up to the current time is thus complete. 
   Then, in the data table register routines  207  and  207   a  through  207   e , the registration and modification of the product attribute data table  215 , product constitution data table  214 , parts constitution data table  210 , parts processing data table  211  and parts attribute data table  216  are carried out. 
   Stored in the product attribute data table  215  are the product classification, launching dates of competitive brands, periods of concurrent sale with the competitive brands and the scheduled drop (discontinuation) data of each product as shown in  FIG. 43 . Thus, the product name A is entered and the aforesaid attribute data are respectively registered or modified. The product classification is the distinction of whether the sales of a product is to continue for more than a predetermined time period after launching. 
   In the product constitution data table  214  shown in  FIG. 42 , too, the product name A is entered and the registration or modification of the part codes constituting this product A, relevant process codes and the numbers of constituent parts are effected. 
   In the product constitution data table  210  and parts processing data table  211  shown in  FIGS. 36  and  37 , respectively, the mother part code X or before-part code P/Q is entered and the registration or modification of the daughter part code constituting the mother part code X and the number of constituting daughter parts or the after-part code of the before-part code P/Q are carried out. 
   Furthermore, in the parts attribute data table  216  shown in  FIG. 44 , the part code P is entered and the name of the supplier-manufacturer and the name of the parts manufacturer are registered or altered. 
   In this manner, the registration processing of all the basic data is completed in the data register means XA. Then, parts demand quantity setting in the parts demand setting means XB is carried out. 
   This parts demand setting means XB comprises an assured sales quantity setting routine  217  and a parts demand calculating routine  218 . 
   Connected to this assured sales quantity setting routine  217  are a product sales data table  219  shown in  FIG. 45 , the product attribute data table  215  and an assured sales quantity data table  220  shown in  FIG. 46 . 
   Stored in the product sales data table  219  are the sales data for each month (36 months in  FIG. 45 ) for each product and the assured sales quantity of the particular product is set using the above data in the steps shown in the flow chart of  FIG. 47 . 
   Thus, 
   Step {circle around (1)}: Finding the past course of sales data of product A from the product sales data table  219   
   Step {circle around (2)}: Estimating the sales drop time t 0  of product A from the above course of sales data 
   Step {circle around (3)}: Comparing the time t 0  with the scheduled drop time t 3  of product A stored in the product attribute data table  215  to take whichever is earlier as t 0 . 
   Step {circle around (4)}: Evaluating globally the past course of sales data of product A in the product sales data table  219  and the product classification u of product A, the launching time t 1  of a competitive product, the period of concurrent sale t 2  in the product attribute table  215 , and the drop time t 0  and setting the assured sales quantity, e.g. the number of units g which can certainly be sold, for a predetermined time period including the current month 
   Step {circle around (5)}: Registering the assured sales quantity g so set as the assured sales quantity data of product A in the assured sales quantity data table  220 . 
   Thus, from the product attributes and the past sales performance of the product, the minimum assured sales quantity of the product is estimated and set and, then, the parts demand quantity is calculated in a parts demand size calculating routine  218 . 
   Connected to this parts demand size calculating routine  218  are the assured sales quantity data table  220 , product constitution data table  214 , parts constitution data table  210 , and parts processing data table  211 , as well as a parts demand data table  221  shown in  FIG. 48 . Therefore, the assured sales quantity data table  220  is first searched through to count the total quantities of parts bearing part code P in the assured sales quantities of all products and the above product constitution data table  214 , parts constitution data table  210  and parts processing data table  211  are sequentially searched through to obtain the desired parts demand data. 
     FIG. 49  shows the above data tables substituted by factual values. With reference to the figure, the method of calculating the parts demand quantity is specifically explained below. 
   Step {circle around (1)}: The assured sales quantity data table  220  shown in  FIG. 49(   a ) is searched to find that the assured sales quantity of product A is 10 units. 
   Step {circle around (2)}: The product constitution data table  214  shown in  FIG. 49(   b ) indicates that product A consists of 2 units of part code q 1 , 3 units of q 2  and 1 unit of q 3 . It is, therefore, calculated that the production of 10 units of product A requires 20, 30 and 10 units of q 1 , q 2  and q 3  parts, respectively. 
   Step {circle around (3)}- 1 : The parts constitution data table  210  shown in  FIG. 49(   c ) indicates that part code q 1  consists of 1 unit of daughter part code q 7  and one unit of q 8  and that part code q 2  consists of 2 units of daughter part code q 8  and 1 unit of q 10 . It is, therefore, calculated that the production of 20 units of part code q 1  requires 20 units of part code q and 20 units of q 8  and that the production of 30 units of part code q 2  requires 60 units of part code q 8  and 30 units of q 10 . 
   Step {circle around (3)}- 2 : It is also found that part code q 10  consists of 1 unit of daughter part code q 12  and 3 units of q 13 . Therefore, it is calculated that the production of 30 units of part code q 10  requires 30 units of part code q 12  and 90 units of q 13 . 
   Step {circle around (4)}- 1 : The parts processing data table  211  shown in  FIG. 49(   d ) indicates that part code q 7  is processed from before-part q 11  and, therefore, that the production of 20 units of part code q 7  requires 20 units of part code q 11 . 
   Step {circle around (4)}- 2 : It is also seen that part code q 12  is processed from before-part q 11  and, therefore, that the production of 30 units of part code q 12  requires 30 units of part code q 11    
     FIG. 50  shows the results obtained by searching through the assured sales quantity data table  220 , product constitution data table  214 , parts constitution data table  210  and parts processing data table  211  in the steps {circle around (1)} through {circle around (4)} in the above manner. The sum of the required numbers of units of each part code necessary for meeting the assured sales quantities of products A, B and C is the demand quantity shown in  FIG. 51 . 
   The processing for parts control in the parts control means XC is now described. 
   The parts control means XC comprises a parts order routine  222 , a parts acceptance routine  223 , a parts release routine  224  and a product planning routine  225 . 
   Connected to the parts order routine  222  are the parts inventory data table  208 , parts order data table  212 , parts demand data table  211 , parts constitution data table  210 , parts processing data table  211  and parts attribute data table  216 , and the control of parts order is performed in the steps shown in the flow chart of  FIG. 52 . 
   Thus, 
   Step {circle around (1)}: Determining and inputting the order size a of part code P 
   Step {circle around (2)}: Confirming that P*+Σm+α, i.e. the sum of the S inventory P* of part code P stored in the parts inventory data table  208 , the total order quantity Σm of part code P stored in the parts order data table  212  and the order quantity a newly entered in step {circle around (1)}, does not exceed the parts demand quantity u of part code P in the product demand data table  221 . If it exceeds, i.e. P*+Σm+α&gt;u, the input in step {circle around (1)} is invalidated and the processing is completed. Thus, in this case, there was an excessive order for part code P. 
   Step {circle around (3)}: Searching through the parts constitution data table  210  and, if it is found that part code P represents the mother part, confirming that all the daughter parts for them can be supplied. In the event of even one daughter part is not available for supply, the input in step {circle around (1)} is invalidated and the processing is completed. The above confirmation is performed as follows. The R inventory and V inventory of the corresponding daughter part are investigated in the parts inventory data table  208  and, then, the delivery term data and order data in the parts order data table  212  are investigated. Then, the delivery term data and order data for all the mother parts employing the corresponding daughter part are investigated in the parts order data table  212  the liquidation schedule of the corresponding daughter part is calculated. 
   Step {circle around (4)}: Searching through the parts processing data table  211 . When the part code P represents after-parts, it is confirmed that the corresponding before-parts can be supplied. If the supply is infeasible, the input in step {circle around (1)} is invalidated to terminate the processing. The above confirmation is carried out by investigating the R inventory and V inventory in the parts inventory data table  208 , the delivery term and order size data in the parts order data table  212  and the delivery term and order quantity data of all the after-parts employing the corresponding before-part in the parts order data table  212 . 
   Step {circle around (5)}: Searching through the parts attribute data table  216  and, where there are more than one supplier-manufacturers of part code P, requesting designation of a supplier-manufacturer 
   Step {circle around (6)}: Inputting that supplier-manufacturer 
   Step {circle around (7)}: Printing an order sheet 
   Step {circle around (8)}: Registering the part code, supplier-manufacturer, delivery term and order quantity in the parts order data table  212  to complete the processing. 
   Thus, in the parts order routine  222 , an order is placed only after confirming that the set order quantity does not cause an excess order or an overstock and that daughter parts or before-parts can be supplied when they exist. 
   Furthermore, the parts acceptance routine  223  is connected to the parts order data table  212 , parts inventory data table  208 , parts release data table  213 , parts constitution data table  210  and parts processing data table  211  and the parts acceptance processing is performed in the steps shown in the flow chart of  FIG. 53 . 
   Thus, 
   Step {circle around (1)}: Inputting order no. K and acceptance quantity β, 
   Step {circle around (2)}: Retrieving order quantity m and past acceptance quantity n of order no. K from the parts order data table  212 . If m&lt;n+β, it is judged that there was an error and the input in step {circle around (1)} is invalidated to terminate the processing. 
   Step {circle around (3)}: Searching through the parts constitution data table  210 . If the part code P stored is the mother part, the V inventory P′ of the constituent daughter part is retrieved from the parts inventory data table  208  and the total release data Σh is retrieved from the parts release data table  213 . Then, the total difference between order quantity and acceptance quantity, that is to say the number of parts already ordered but not delivered as yet, is retrieved and set as g 1 . 
   Furthermore, the acceptance quantity of all the mother parts employing the corresponding daughter part is retrieved from the parts order data table  212  and the total acceptance quantity of the corresponding daughter part is calculated and set as g 2 . Thus, if the mother parts have been accepted, it is deemed that the daughter parts have of course been accepted. 
   Step {circle around (4)}: If P′+Σh+g 1 &lt;g 2 +β×θ (where θ means the number of the corresponding daughter parts contained in one unit of the mother part), invalidating the input in step {circle around (1)} as an error and terminating the processing. 
   Step {circle around (5)}: If P′+Σh&lt;g 2 +β×θ&lt;P′+Σh+g 1 , calculating g 2 +β×θ−(P′+Σh) and having the result reflected in the acceptance data of the corresponding daughter part in the parts order data table  212  and similarly in the release data of the corresponding daughter part in the parts release data table  213 . In other words, it is treated so that the corresponding daughter part is accepted once and, then, released. 
   Step {circle around (6)}: Increasing the acceptance data of order no. K in the parts order data table  212  by β to complete the processing. 
   Connected to the parts release routine  224  are the parts order data table  212 , parts inventory data table  208 , parts release data table  213 , parts constitution data table  210  and parts attribute data table  216 , and parts release processing is performed in the steps shown in the flow chart of  FIG. 54 . 
   Thus, 
   Step {circle around (1)}: Entering part code P and its release quantity γ 
   Step {circle around (2)}: Finding the current inventory of part code P in the following steps (i) through (iii) 
   (i) Retrieving the R inventory of part code P from (i) the parts inventory data table  208   
   (ii) Retrieving the total acceptance quantity Σn of part code P from the parts order data table  212   
   (iii) Retrieving the total release quantity Σh of part code P from the parts release data table  213   
   Step {circle around (3)}: If the release quantity y is larger than the current inventory (P+Σn−Σh), the input in step {circle around (1)} is invalidated as an error to terminate the processing. 
   Step {circle around (4)}: Searching through the parts attribute data table  216  and, if there are more than one supplier-manufacturers of part code P, requesting designation of the relevant manufacturer 
   Step {circle around (5)}: Entering the manufacturer&#39;s name 
   Step {circle around (6)}: Assigning a slip number and registering the part code, manufacturer&#39;s name, and release quantity in the parts release data table  213  to terminate the processing. 
   Connected to the production plan routine  225  are the product constitution data table  214 , parts inventory data table  208  and parts order data table  212  as well as a production plan data table  226  shown in  FIG. 55 , and the registration of the production plan is performed in the steps shown in the flow chart of  FIG. 56 . 
   Stored in the production plan data table  226  are the production schedule and production quantity data for respective product items. 
   Thus, 
   Step {circle around (1)}: Entering the production schedule d and production quantity w for product A in the production plan data table  226   
   Step {circle around (2)}: Searching through the product constitution data table  214  to extract all the constituent parts of product A and checking to see whether these parts can be supplied. If any of the parts is unavailable, the input in step {circle around (1)} is invalidated to terminate the processing. The above checking is done as follows. The R inventory of the particular part is checked in the parts inventory data table  208  and the delivery term and order quantity data in the parts order data table  212  are also checked. Then, with regard to other product items which employ the corresponding constituent part, the production schedule and quantity are checked in the production plan data table  226  and the liquidation schedule for the corresponding part is calculated. Thus, it is checked here whether this constituent part will be available in a sufficient quantity for the production of product A. 
   Step {circle around (3)}: Registering product name A, production schedule d and production quantity w in the production plan data table  226  to complete the processing.