The present invention relates to a technique for preparing procurement plans.
It is necessary to prepare a procurement plan of products considering such as the number of required products, supply capacity of manufacturer, or product transportation. Thus a procurement plan has an aspect as an optimization problem where complicated constraints exist. Patent Literatures 1-2 listed below describe techniques for acquiring optimized solutions under given constraints.
Patent Literature 1 listed below describes a technique as “ . . . configures multiple constraints as necessary constraints and as alleviated constraints, simulates a case using the configured constraints, and displays a simulation result. At this time, a correction for the simulation result is received from a skilled person, the configuration of the necessary constraints and of the alleviated constraints is reconfigured according to the corrected portion and to the correction process, and the case is re-simulated.” (refer to Abstract).
Patent Literature 2 listed below describes a technique as “ . . . when assuming that either the secured order is removed from the manufacturing plan or the supply capacity is increased, if the desired delivery date of the unsecured order and the desired amount of the unsecured order are satisfied, the manufacturing plan is re-prepared by at least any one of removing the selected secured order and increasing the supply capacity.” (refer to Abstract)
Patent Literature 1: JP Patent Publication (Kokai) 2006-323784 A
Patent Literature 2: JP Patent Publication (Kokai) 2006-155366 A
In the technique described in Patent Literature 1, it is necessary for an operator to categorize multiple constraints into necessary constraints and into alleviated constraints according to the simulation result. It is also necessary to correct the acceptable value of the alleviated constraints. Therefore, technical capability and know-how of the operator significantly affect the calculated simulation result.
In the technique described in Patent Literature 2, a new manufacturing plan in which prioritized unsecured orders are assigned is re-prepared by removing secured orders and by increasing supply capacity. However, it may be difficult to appropriately re-prepare the manufacturing plan without considering means other than removing secured orders or increasing supply capacity. For example, the manufacturing plan can also be re-prepared by means such as forwarding manufacturing periods, adjusting supply requests, reducing transportation periods, or reconfiguring transportation costs. In other words, it may be necessary to consider means other than merely increasing or decreasing requested amounts or supplied amounts.
The present invention is made in the light of the above-described technical problems. It is an objective of the present invention to provide a technique being capable of preparing, when re-preparing a procurement plan, an appropriate procurement plan according to situations even without skilled operators.
A procurement plan preparation device according to the present invention: previously defines a second constraint in which a constraint for a procurement plan is alleviated; prepares a plurality of second procurement plans by combining the second constraints; and presents the second procurement plan to an operator.
Since the procurement plan preparation device according to the present invention prepares the second procurement plan by combining the second constraints in which the constraint is alleviated, the number of combinations is lower than that of the all combinations. Thus the processing load may be suppressed. In addition, it is possible not only to increase or decrease supplied amounts or requested amounts but also to consider various constraints. Thus it is possible to prepare more appropriate procurement plans.
Technical problems, configurations, and effects other than mentioned above will be understood with reference to the following embodiments.
A procurement plan preparation device according to the present invention is used for correcting a procurement plan to prepare a new procurement plan if a procurement request issued from a buyer of a product toward a supplier cannot be satisfied.
In the present invention, when transporting a procured product, it is assumed that multiple of transportation means is used. For example, there is a transportation means with long transportation time and with low transportation cost such as ship transportation, and there also is a transportation means with short transportation time and with high transportation cost such as air transportation. Hereinafter, for the sake of simplicity of description, ship transportation and air transportation are assumed as transportation means. However, the transportation means may be train transportation or track transportation, or combination thereof. Further, there may be more than two transportation means.
The inputter 11, the controller 12, and each functional unit included therein may be configured using hardware such as circuit devices implementing these functions, or may be configured by a processor executing software implementing these functions. The storage 13 may be configured by storage devices such as hard disk drives. The displayer 14 may be configured by display devices and control functions thereof.
The master information storage 131 stores fundamental information regarding the procurement plan. Each information stored in the master information storage 131 will be described using
The base code 13111 stores IDs that identify suppliers and destinations (hereinafter, referred to as bases) of products regarding the procurement plan. The base name 13112 stores names of the bases. The base functionality 13113 stores types of the bases (shipping base (=supplying base)/arrival base (=destination base)). According to the first record, it is understood that the base with the base code “S1” has a base name of “supplier 1” and its base type is “shipping base”.
The product item 13121 stores names of product items. The base code 13122 stores base codes of bases where the product item is produced. The target week 13123 stores weeks when the product item is produced at the base. The amount 13124 stores amounts of the product item produced at the base within the target week. According to the first record, it is understood that the product item “component A” is produced by amount of “300” at the base code “S1” in the target week “7/16”.
The product item 13131 stores names of product items. The base code 13132 stores base codes of bases where the product item is stored as stocks. The target week 13133 stores weeks when the product item changes from a transferred state into a stocked state at the base. The amount 13134 stores amounts by which the product item newly becomes stocks at the base in the target week. According to the first record, “150” stocks of the product item “component A” are generated at the base code “A1” in the target week “7/16”.
The product item 13141 stores names of product items. The base code 13142 stores base codes of bases where the product item is consumed by such as production processes. The target week 13143 stores weeks when the product item is consumed at the base. The amount 13144 stores amounts by which the product item is consumed at the base in the target week. According to the first record, it is understood that the product item “component A” is consumed by amount of “50” at the base code “A1” in the target week “7/16”.
The product item 13151 stores names of product items. The route code 13152 stores IDs for identifying transportation routes. The From base code 13153 stores base codes indicating shipping bases (=supplier). The To base code 13154 stores base codes indicating arrival bases (=destination). The transportation means 13155 stores transportation means for the product item routed through the route code. The transportation days 13156 stores days to transport the product item routed through the route code. The transportation unit 13157 is a unit amount by which the product item is transported through the route code. The transportation unit cost 13158 stores transportation costs for transporting one of the product through the route code. According to the first record, when transporting the product item “component A” by transportation means “ship” from the base “S1” to the base “A1” through the route code “T1”, the transportation takes “21” days, the product item is transported by unit amount of “50”, and it incurs transportation cost of “1000 JPY” for each of products.
The product item 13161 stores names of product items. The From base code 13162 stores base codes indicating shipping bases (=supplier). The To base code 13163 stores base codes indicating arrival bases (=destinations). The delivery date 13164 stores arrival deadline dates when the product item is transported from the From base code toward the To base code. The amount 13165 stores amounts of request to transport the product item by the delivery date from the From base code toward the To base code. According to the first record, the product item “component A” is requested to be transported by amount of “200” from “S1” toward “A1” by “8/6”.
The alleviated constraint storage 132 stores data that describes alleviated constraints in which constraints for the procurement plan are alleviated. The alleviated constraint mentioned here is a new constraint that is configured so that the ratio of satisfied procurement requests will be increased.
For example, when it becomes hardly likely to satisfy a procurement plan due to such as disasters, it is necessary to re-prepare the procurement plan so that as many as procurement requests will be satisfied. The alleviated constraint defines in advance constraints that can be alleviated at such time. The constraints that can be alleviated depend on environments. Thus the alleviated constraint is previously defined and is stored in the alleviated constraint storage 132.
The product item 13211 stores names of product items. The alleviation No. 13212 stores IDs for identifying alleviated constraints. The procurement plan target 13213 stores contents of alleviated constraints of the alleviation No. 13212. The feasibility 13214 stores quantified probabilities with which the alleviated constraints of the alleviation No. is achieved.
The alleviation No. “1” is a constraint that secures fully satisfying the procurement request, which is the most strict constraint. The alleviation No. “2” is a constraint that secures satisfying the minimum amount of objects put into the production lines or the like, which is an alleviated constraint compared to the alleviation No. “1”. The constraints described in this table are manually configured by such as administrators as procurement targets (alleviated constraints) in which the original targets are alleviated. The procurement target can be described as one of constraints, thus it is described in the same format as that of other constraints described below.
In the example shown in
The product item 13221 stores names of product items. The alleviation No. 13222 stores IDs for identifying alleviated constraints. The upper limit 13223 stores acceptable upper limits of additional transportation costs that are incurred when using emergency transportation means. The feasibility 13224 stores quantified probabilities with which the alleviated constraints of the alleviation No. is achieved.
If the upper limit 13223 is 0M JPY, it means that no emergency transportation is allowed. If the upper limit 13223 is “no upper limit”, it means that no upper limit of cost is provided for emergency transportation means. The alleviated constraints described in this table are all configured by human decisions. Thus the feasibility 13224 is 100%. Since the upper limits of additional transportation cost are different for each of suppliers, it is necessary to provide this table for each of suppliers. If a same supplier has different upper limits of cost for each of destinations, this table may be further separated for each of destinations.
The product item 13231 stores names of product items. The alleviation No. 13232 stores IDs for identifying alleviated constraints. The reduced days 13233 stores transportation days that can be reduced. The feasibility 13234 stores quantified probabilities with which the alleviated constraints of the alleviation No. is achieved.
The feasibility 13234 is configured according to such as statistically processed results based on past records, to hearing information from interested parties, or to know-how of skilled persons. Since the days that can be reduced and the feasibility are different for each of transportation routes, it is necessary to provide this table for each of transportation routes.
The product item 13241 stores names of product items. The alleviation No. 13242 stores IDs for identifying alleviated constraints. The increased production amount 13243 stores increased ratio of supplied products for each of weeks counting from the current week, for example. The feasibility 13244 stores quantified probabilities with which the alleviated constraints of the alleviation No. is achieved.
The alleviation No. “1” is a record that describes the production plan itself provided from the supplier. The increased production amount 13243 thereof is “-” indicating no change and the feasibility 13244 thereof is 100%. The alleviation No. “2” indicates that the production plan provided from the supplier is increased by +10% every week. As the increased production amount 13243 increases, the production capacity is strained. Thus the feasibility 13244 becomes smaller. The feasibility 13244 is configured according to such as statistically processed results based on past records, to hearing information from interested parties, or to know-how of skilled persons. The increased production amount 13243 may be described, other than for each of weeks, for each of days or months. This table may be provided for each of supplying bases.
The product item 13251 stores names of product items. The alleviation No. 13252 stores IDs for identifying alleviated constraints. The forwarded width 13253 describes days by which the production is forwarded, for example using number of forwarded weeks. The forwarded amount 13254 describes amounts of forwarded productions, for example using increased ratios with respect to the production amounts before increased. The feasibility 13255 stores quantified probabilities with which the alleviated constraints of the alleviation No. is achieved.
The alleviation No. “1” is a record that describes the production plan itself provided from the supplier. The forwarded width 13253 and the forwarded amount 13254 are “-” indicating no change and the feasibility 13255 thereof is 100%. The alleviation No. “2” indicates that the production plan of the next week (+1 wk) provided from the supplier is increased by 25% in this week. The feasibility 13255 is configured according to such as statistically processed results based on past records, to hearing information from interested parties, or to know-how of skilled persons. The forwarded width 13253 and the forwarded amount 13254 may be described, other than for each of weeks, for each of days or months. This table may be provided for each of supplying bases.
The master information receiver 111 receives inputs of each master information described in
The alleviated constraint receiver 112 receives inputs of each alleviated constraint information described in
The combination creator 123 creates combinations of alleviated constraints for each of product items using round-robin of the alleviation No. of each alleviation axis. The alleviation No. is selected for each of the bases. Thus the number of combinations of alleviated constraints in one alleviation axis is the number of alleviation No. to the number of bases-th power. The total number of combinations in the embodiment 1 is 22×32×31×41×41=46656. The combination list of alleviated constraints created in this step will be exemplified in
The repetition processor 124 performs step S5 for each of alleviated scenarios (temporal procurement plan to which the alleviated constraints are applied instead of the original constraints) that are enumerated in the combination list of alleviated constraints created by the combination creator 123.
The procurement plan preparator 125: reads out information stored in the master information storage 131 and in the alleviated constraint storage 132; performs optimization simulation for each of alleviated scenarios enumerated in the combination list of alleviated constraints; and stores the simulation result into the procurement plan storage 133. The optimization method used by the procurement plan preparator 125 to perform the simulation may be optimization algorithms such as branch and bound method, dynamic programming, linear programming, heuristics, greedy method, local search, genetic algorithm, simulated annealing, or taboo search, or combinations thereof.
The procurement plan list creator 126 outputs, in a format of list, the simulation results of all alleviated scenarios enumerated in the alleviated constraints combination list. The display controller 127 filters, according to item names and to KPI values, the procurement plan list created by the procurement plan list creator 126. The display controller 127 further sorts the simulation results in descending order of KPI value. The procurement plan list displayer 141 displays the procurement plan list. An example of the display in this step will be described in
The operator selects any one of procurement plans on the screen displayed by the procurement plan list displayer 141. The procurement plan decision receiver 113 receives the selection input and notifies it to the output controller 128.
The output controller 128 outputs output data that describes the procurement plan selected in step S7 and that describes the alleviated constraints. The output data may be outputted, for example, to networks or storage devices in any data format or other output formats may be employed.
The scenario No. 12311 stores IDs for identifying combinations of alleviated constraints. The request achievement 12312—the feasibility 12317 store values of the alleviation No. in each table of
The first record is an example in which an alleviated scenario is created using the alleviation No. “1” in each table of
The product item selection area 14111 is an area to select alleviated scenarios that are to be displayed on the procurement plan list screen 1411. This selection area is provided because multiple of alleviated scenarios may be created for each of product items. Multiple of product items may be selected or a product item may be selected according to some conditions. The procurement plan list displayer 141 only displays alleviated scenarios, among the alleviated constraint combination list 1231, corresponding to product items selected in this selection area.
The feasibility selection area 14112 is an area to select alleviated scenarios that are to be displayed on the procurement plan list screen 1411, as for the product item selection area 14111. The procurement plan list displayer 141 only displays alleviated scenarios, among the alleviated constraint combination list 1231, that have the feasibility 12317 above values selected in this selection area. This selection area may be configured so that a range of values is selected.
The procurement plan summary 14113 is an area that enumerates alleviated scenarios filtered by the product item selection area 14111 and by the feasibility selection area 14112. The procurement plan list displayer 141 sorts each alleviated scenario according to sort conditions of at least any one of descending order of procurement plan fill rate, descending order of the feasibility 12317, and ascending order of transportation cost. The procurement plan list displayer 141 displays the sorted result.
The procurement plan fill rate is a ratio of procurement requests, among all procurement requests, which request is satisfied (the product arrived at or before the specified delivery date). If all procurement requests are satisfied, the fill rate of the alleviated scenario is 100%. The transportation cost is a sum of normal transportation cost and additional transportation cost.
Details of each alleviated scenario may be displayed in the same form of the alleviated constraint combination list 1231, or may be additionally complemented using texts or images of each alleviated scenario contents so that the operator easily understands the scenario. Contents of each alleviated scenario may be displayed in this screen or may be displayed in sub windows.
The product item 12811 stores names of product items. The scenario No. 12812 stores IDs for identifying combinations of alleviated constraints. The From base code 12813 stores base codes of shipping bases. The To base code 12814 stores base codes of arrival bases. The shipping date 12815 and the arrival date 12816 store shipping dates and arrival dates, respectively. The transportation means 12817 stores transportation means from the shipping base to the arrival base. The amount 12818 stores amounts of products that are transported by the transportation means from the shipping base to the arrival base.
According to the first record, the product item “component A” is transported from the base “S11” to the base “A1” according to the alleviated constraint of scenario No. “3” on “7/16” using “ship” by amount of “200”, so that the product item arrives on “8/6”.
As discussed thus far, the procurement plan preparation device 10 according to the embodiment 1 creates the alleviated constraint combination list 1231 that is configured so that the fill rate is increased by alleviating the constraints. The operator selects any one of the alleviated scenarios among the combinations. The alleviated constraints may be created in various terms of such as statistical processing results or hearing results. Thus various alternative procurement plans may be prepared other than merely increasing or decreasing supply amounts or consumption amounts.
In addition, the number of alternative procurement plans prepared by the procurement plan preparation device 10 according to the embodiment 1 is limited to the total number of combinations of alleviated constraints. Thus the alternative procurement plans may be efficiently prepared within limited numbers compared to recreating all constraints.
In addition, the procurement plan preparation device 10 according to the embodiment 1 filters the alleviated constraint combination list 1231 by the product item selection area 14111 and by the feasibility selection area 14112. Accordingly, the operator can more efficiently select the alleviated scenarios. By displaying the result sorted by the fill rate, the transportation cost, and the feasibility 12317, the operator can consider alternative procurement plans limited to effective and feasible ones. Thus the operator can make a decision within short time.
In the embodiment 1, the simulation is performed for all alleviated scenarios (all combinations of alleviated constraints). However, it may be assumed that the simulation may be omitted for alleviated scenarios that would not be selected, thereby reducing computational loads. Thus in an embodiment 2 of the present invention, a configuration example will be described where combinations of alleviated constraints which are not necessary to be further alleviated are excluded from the target of simulation, thereby omitting unnecessary calculations.
An example will be described below using four alleviated scenarios of the scenario No. 12311=“6”-“9” in
Another example will be described below using two alleviated scenarios of the scenario No. 12311=“8” “14” in
The combination updater 129 sorts the alleviated constraint combination list 1231 so that it is in the order of constraints from harder ones to looser ones for each of alleviation axes (five alleviation axes of the request achievement 12312-the forwarded supply 12316). In the examples of alleviated constraints described in
If alleviated scenarios are acquired that achieve the fill rate of 100%, the combination updater 129 skips scenarios with simply further alleviated constraints in accordance with the above-mentioned concept. Specifically, the combination updater 129 deletes the alleviated scenarios to be skipped from the alleviated constraint combination list 1231, and updates the list accordingly.
In this step, it is not always necessary to depend on whether the fill rate of 100% is achieved. For example, when an alleviated scenario achieves the fill rate of 95%, other scenarios with simply further alleviated constraints may be skipped. The fill rate threshold for determining whether the combination is skipped may be defined in advance depending on such as characteristics of the procurement plan.
As discussed thus far, during simulations for each of combinations of alleviated scenarios, the procurement plan preparation device 10 according to the embodiment 2 skips further alleviated scenarios when the fill rate reaches a predetermined threshold. Accordingly, computational load for the simulation is suppressed to improve the operator's working efficiency.
The present invention is not limited to the embodiments, and various modified examples are included. The embodiments are described in detail to describe the present invention in an easily understood manner, and the embodiments are not necessarily limited to the embodiments that include all configurations described above.
The configurations, the functions, the processing units, the processing means, etc., may be realized by hardware such as by designing part or all of the components by an integrated circuit. A processor may interpret and execute programs for realizing the functions to realize the configurations, the functions, etc., by software. Information, such as programs, tables, and files, for realizing the functions can be stored in a recording device, such as a memory, a hard disk, and an SSD (Solid State Drive), or in a recording medium, such as an IC card, an SD card, and a DVD.
Filing Document | Filing Date | Country | Kind |
---|---|---|---|
PCT/JP2012/079101 | 11/9/2012 | WO | 00 |