JP2017187934A - Shipment planning device and shipment planning method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a shipment planning device and a shipment planning method capable of creating a shipment plan which considers a load state of a storehouse.SOLUTION: A shipment planning device creates a shipment plan for regulating an arrival time point when a transport machine for shipment arrives at a loading place where shipment object articles are loaded on the transport machine, and a departure time point when the transport machine departs from the loading place. The shipment planning device identifies a total stock of the shipment object articles which can be delivered, in a storehouse, and determines the arrival time point of the transport machine based on the identified total stock. The shipment planning device creates a shipment plan based on the determined arrival time point of the transport machine.SELECTED DRAWING: Figure 5

Description

  The present invention relates to a shipping plan planning apparatus and method for planning a shipping plan for a product or a semi-finished product by a transport machine such as a ship or a truck.

  In order to efficiently ship products manufactured in factories, it is important to make a shipping plan. In Patent Document 1, a shipping plan is considered in consideration of the product delivery deadline, the load capacity of the transport machine, and the work amount of a transport device (such as a crane) for transporting the product from the warehouse to the transport machine at the time of shipping work. A shipping plan planning device for planning is disclosed.

JP 2010-254474 A

  Products manufactured in the factory are temporarily stored in a warehouse before shipping. Since the capacity of the warehouse is limited, the product cannot be stored in the warehouse unless the amount of goods delivered to the warehouse can catch up, and the production line at the factory must be stopped. However, the shipping plan planning device described in Patent Document 1 does not take into account the load situation of the warehouse in the planning of the shipping plan, and cannot cope with the above problems.

  The present invention has been made in view of such circumstances, and a main object of the present invention is to provide a shipping plan planning device and a shipping plan planning method capable of formulating a shipping plan in consideration of the load situation of a warehouse.

  In order to solve the above-described problems, a shipping plan planning apparatus according to an aspect of the present invention includes an arrival time when a shipping transport machine arrives at a loading place for loading a shipment target product stored in a warehouse, and A shipping plan planning device for planning a shipping plan that defines a departure time point that departs from a loading place, the specifying means for specifying an inventory quantity of a shipment target product that can be shipped in the warehouse, and the specifying means specified by the specifying means A determining unit configured to determine the arrival time of the transport aircraft based on an inventory quantity; and a generating unit configured to generate a shipping plan based on the arrival time determined by the determining unit. The products to be shipped include products and semi-finished products. Further, “loading” means that the goods to be shipped are transferred from the warehouse to the transport machine, and “shipping” means that the goods to be shipped are transferred to the shipping destination by the transport machine.

  In this aspect, the determination means may be configured to determine the arrival time based on the inventory amount and the amount of the shipment target product loaded on the transport aircraft.

  Further, in the above aspect, the determining means is configured to determine a time point before the inventory amount reaches an upper limit value of a quantity to be shipped loaded on the transport aircraft as the arrival time point. May be.

  In addition, in the above aspect, the shipment planning apparatus may determine a point in time when the load amount of the shipment target product in the transport aircraft becomes an upper limit value of the amount of the shipment target product loaded on the transport aircraft. Second determining means for determining as a departure time is further provided, and the generating means generates the shipping plan based on the arrival time and the departure time determined by the determination means and the second determination means, respectively. It may be configured as follows.

  Further, in the above aspect, the shipment plan planning device determines whether or not the shipment plan generated by the generation unit violates a restriction condition regarding the number of the transport aircraft to be simultaneously stopped at the loading site. When the determination means determines that the restriction condition is violated by the determination means, the arrival time or the departure time of at least one of the plurality of transport aircraft to be simultaneously stopped at the loading site is determined. Changing means for changing.

  Further, in the above aspect, the changing means is configured to change an arrival time of a subsequent transport aircraft that starts later among the plurality of transport aircraft after a start time of a previous transport aircraft that starts earlier. Also good.

  Further, in the above aspect, the changing means is based on a free capacity of the transport aircraft based on an upper limit value of the amount of the shipment target product loaded on the transport aircraft and a load amount of the shipment target product on the transport aircraft. The arrival time or the departure time of at least one of the plurality of transport aircraft may be changed.

  Further, in the above aspect, the changing means may include the at least one of the plurality of transport aircraft so that a start time of a transport aircraft having a small free capacity is earlier than a start time of a transport aircraft having a large free capacity. It may be configured to change the departure time of one transport aircraft.

  In the above aspect, the changing unit may change the arrival time or the departure time of at least one of the plurality of transport aircraft based on a load amount of a product to be shipped in the transport aircraft. It may be configured.

  Further, in the above aspect, the changing means may include at least the at least one of the plurality of transport aircraft so that an arrival time of the transport aircraft having a small load capacity is later than a departure time of the transport aircraft having a large load capacity. You may be comprised so that the arrival time of one transport plane may be changed.

  In the above aspect, the shipment plan planning device may further include an output unit that outputs the shipment plan in which the arrival time or the departure time of the transport aircraft is changed by the changing unit.

  Further, in the above aspect, the shipping plan planning device may be a shipping target that can be shipped in a warehouse at a plurality of time points based on a shipping plan in which the arrival time or the departure time of the transport aircraft is changed by the changing unit. Shippable inventory amount generating means for generating a stock quantity of the product is further provided, and the output means is configured to further output the inventory amount of the shipable shipment target item generated by the shippable inventory amount generating means. May be.

  Further, in the above aspect, the shipment plan planning device generates a total inventory amount of the warehouse at each of a plurality of time points based on the shipment plan in which the arrival time or the departure time of the transport aircraft is changed by the changing unit. The total inventory quantity generating means may be further provided, and the output means may be configured to further output the total inventory quantity generated by the total inventory quantity generating means.

  According to another aspect of the present invention, there is provided a shipping plan planning method that defines an arrival point at which a transport aircraft for shipment arrives at a loading place for loading an object to be shipped stored in a warehouse, and a starting point at which departure from the loading place. A shipment plan planning method for creating a shipment plan to be executed, wherein the computer specifies a stock quantity of a shipment target product that can be shipped in the warehouse; and the computer performs the transportation based on the identified stock quantity. Determining the time of arrival of the machine, and the computer generating a shipping plan based on the determined time of arrival.

  According to the present invention, it is possible to make a shipping plan in consideration of the load situation of the warehouse.

The block diagram which shows the structure of the shipping plan planning apparatus which concerns on embodiment. The flowchart which shows the procedure of the shipping plan planning process by the shipping plan planning apparatus which concerns on embodiment. The figure which shows an example of production plan data. The figure which shows an example of transport aircraft data. The flowchart which shows the procedure of an initial shipment plan production | generation process. The schematic diagram for demonstrating the update of the stock quantity which can be shipped. The flowchart which shows the procedure of a shipping plan correction process. The schematic diagram for demonstrating the change of the departure / arrival schedule in case the departure of several ships overlaps. The schematic diagram for demonstrating the change of the departure / arrival schedule in case the departure of several ships does not overlap. Flow chart showing the procedure of the shipping plan recorrection process The schematic diagram for demonstrating an example of the change of the departure / arrival schedule in a shipping plan recorrection process. The schematic diagram for demonstrating an example of the change of the departure / arrival schedule in a shipping plan recorrection process. The schematic diagram for demonstrating an example of the change of the departure / arrival schedule in a shipping plan recorrection process. The schematic diagram for demonstrating the other example of the change of the departure / arrival schedule in a shipping plan recorrection process. The schematic diagram for demonstrating the other example of the change of the departure / arrival schedule in a shipping plan recorrection process. The schematic diagram for demonstrating the other example of the change of the departure / arrival schedule in a shipping plan recorrection process. The figure which shows the example of an output of a shipping plan. The figure which shows the output example of the stock quantity which can be shipped. The figure which shows the output example of the total inventory quantity of a warehouse.

  Hereinafter, preferred embodiments of the present invention will be described with reference to the drawings.

  In this embodiment, a description will be given of a shipping plan when a product (a product to be shipped) is shipped by a ship. Products manufactured in the factory are temporarily stored in a warehouse before shipping. An inspection for shipping is performed on the product stored in the warehouse, and a product that has passed the inspection can be shipped. On the other hand, products that fail the inspection and products before the inspection cannot be shipped. In addition, a lower limit and an upper limit are set for the amount of product loaded for each ship to be shipped, and when the quantity of products that can be shipped in the warehouse exceeds the lower limit, Enter the port and load the product on the ship. The ship is loaded with a quantity of product equal to or less than the upper limit value and shipped.

  Further, among products stored in the warehouse at a certain point in time, the quantity of products that can be shipped is called “shippable inventory quantity”, and the quantity of products that cannot be shipped is called “non-shipable inventory quantity”. In addition, the total amount of stock in the warehouse at a certain point in time, that is, the sum of the shippable stock amount and the unshippable stock amount is referred to as “total stock amount”. The cumulative total of products that can be shipped up to a certain point in time is called the “total amount that can be shipped”.

  The amount of products loaded on a ship at a certain point in time is called “actual loading capacity”, and the lower and upper limits of the quantity of products loaded on the ship are called “minimum loading capacity” and “maximum loading capacity”, respectively. . Information indicating whether or not a product is loaded on a ship at a certain point of time is referred to as a “loading state” of the ship. When the “loading state” is “0”, it indicates that the product is not loaded on the ship, and when the “loading state” is “1”, it indicates that the product is loaded on the ship. .

  In addition, it is assumed that there are the following restrictions on the docking of ships at the port. There are two types of size "Large" and "Small" for ships, and only two ships can dock at the port at the same time in combination of "Large" and "Small" or "Small" and "Small". In other words, two ships with a combination of “Large” and “Large”, and three or more ships cannot dock at the same time.

  Further, it is assumed that there is one ship for each shipping destination, that is, one ship for one shipping destination.

  The shipping plan planning apparatus according to the present embodiment has an arrival time (port entry time) when a product shipping ship arrives at a port for loading products and a departure time point (departure time) departing from the port for each of a plurality of ships. Develop a shipping plan shown in.

[Configuration of shipping planning device]
The configuration of the shipping plan planning apparatus according to this embodiment will be described. FIG. 1 is a block diagram showing a configuration of a shipping plan planning apparatus according to the present embodiment. The shipping plan planning device 1 is realized by a computer 10. As shown in FIG. 1, the computer 10 includes a main body 11, an input unit 12, and a display unit 13. The main body 11 includes a CPU 111, ROM 112, RAM 113, reading device 114, hard disk 115, input / output interface 116, and image output interface 117. The CPU 111, ROM 112, RAM 113, reading device 114, hard disk 115, input / output interface 116, The image output interface 117 is connected by a bus.

  The CPU 111 can execute a computer program loaded in the RAM 113. Then, when the CPU 111 executes a shipping plan planning program 110 that is a computer program for shipping plan planning, the computer 10 functions as the shipping plan planning device 1.

  The ROM 112 is configured by a mask ROM, PROM, EPROM, EEPROM, or the like, and stores a computer program executed by the CPU 111, data used for the same, and the like.

  The RAM 113 is configured by SRAM, DRAM, or the like. The RAM 113 is used for reading the shipping plan planning program 110 recorded on the hard disk 115. Further, when the CPU 111 executes a computer program, it is used as a work area for the CPU 111.

  The hard disk 115 is installed with various computer programs to be executed by the CPU 111 such as an operating system and application programs, and data used for executing the computer programs. A shipping planning program 110 is also installed on the hard disk 115.

  The input / output interface 116 is, for example, a serial interface such as USB, IEEE1394, or RS-232C, a parallel interface such as SCSI, IDE, or IEEE1284, and an analog interface including a D / A converter, an A / D converter, and the like. It is configured. An input unit 12 including a keyboard and a mouse is connected to the input / output interface 116, and the user can input data to the computer 10 by using the input unit 12.

  The image output interface 117 is connected to the display unit 13 constituted by an LCD, a CRT, or the like, and outputs a video signal corresponding to the image data given from the CPU 111 to the display unit 13. The display unit 13 displays an image (screen) according to the input video signal.

[Operation of shipping planning device]
Hereinafter, the operation of the shipping plan planning apparatus 1 according to the present embodiment will be described. The shipping plan planning device 1 executes a shipping plan planning process described below.

  FIG. 2 is a flowchart showing the procedure of the shipping plan planning process by the shipping plan planning apparatus 1 according to the present embodiment.

  First, the CPU 111 of the shipping plan planning apparatus 1 receives input data for shipping plan planning (step S101).

  The input data includes production plan data indicating the total amount available for shipment at each point of time for each ship-to party, and transport aircraft data relating to a ship that is a transport aircraft.

  FIG. 3 is a diagram illustrating an example of production plan data. As shown in FIG. 3, the production plan data indicates the total amount that can be shipped for each of a plurality of time points, that is, the total number of products that can be shipped up to that time point and the shipping destination. Although omitted in FIG. 3, the production plan data includes a non-shipable inventory amount at each time point. In FIG. 3, each row corresponds to a shipping destination, and each column corresponds to a time point. Here, when the production plan data indicates a daily production plan, the “time point” is a date. In addition, when the production plan data indicates a production plan twice a day in the morning and in the afternoon, the “time point” is the date and the morning or afternoon, such as “Year, month, day, and morning”. When the production plan data indicates an hourly production plan, the “time point” is the date and time (○ year ○ month ○ day ○ hour). As described above, the “time point” may be various information, but as illustrated in FIG. 3, the present embodiment will be described using an example in which “time point” is a date.

  In FIG. 3, the number in each square is the shipping plan cumulative amount. For example, the quantity of products that can be shipped for the shipping destination A is “0” on January 10, but as a result of manufacturing the product, there is a product that can be shipped “100” on January 11. . Furthermore, as a result of manufacturing “400” products, the cumulative amount that can be shipped on January 12 is “500” (100 + 400).

  FIG. 4 is a diagram showing an example of transport aircraft data. The transport aircraft data is data that defines the ship destination, the size (large or small) of the ship, and the minimum and maximum load capacity of the ship for each ship.

  Next, the CPU 111 executes initial shipment plan generation processing (step S102). This initial shipment plan generation process is a process of generating a shipment plan when there is no restriction condition based on input data.

In the initial shipment plan generation process, a shipment plan is generated according to the following rules.
<Rule>
a. When the shipable stock quantity (stock quantity of products that can be shipped in the warehouse) reaches the minimum loading capacity, the ship enters the port.
b. The ship stops at the port until the actual load (the amount of product loaded on the ship) reaches the maximum load of the ship.
c. When the actual load reaches the maximum load of the ship, the ship leaves the port.
d. No restrictions are imposed (there is no limit on the size and number of ships berthing at the same time).

  The initial shipment plan generation process will be described in more detail. FIG. 5 is a flowchart showing the procedure of the initial shipment plan generation process.

In the initial shipment plan generation process, first, the CPU 111 sets the time point t _i to be processed to the current time point (step S201).

  Here, the actual loading capacity of the ship is stored in the hard disk 115 for each shipping destination (for each ship). The actual load amount indicates the amount of products loaded on the ship. The initial value of the actual load capacity of the ship is “0”.

The hard disk 115 also stores the loading state for each shipping destination (each ship). The loading state indicates whether or not a product is loaded on the ship. The loading state is information that can take two values “0” and “1”. If the loading state is “0”, it indicates that no product is loaded on the ship. If the loading state is “1”, it indicates that a product is loaded on the ship. When the ship has not entered the port, the loading state is “0”. When the ship is stopped at the port, since the product is loaded on the ship, the loaded state is set to “1”. In other words, the loading state indicates the state relating to the port entry of the ship as follows.

The CPU 111 selects one of the shipping destinations as a processing target shipping destination (step S202). Further, CPU 111 identifies the shipping inventory amount of processed shipment destination at time _{t i} (step S203). In the process of step S203, CPU 111 is, by reading the shippable inventory of processed shipment destination at time t _i from inventory data stored in the hard disk 115, for identifying the shipment inventory quantity. The initial inventory data is the same data as the production plan data. As will be described later, the inventory data is updated as processing proceeds.

Further CPU111 is, at time _{t i,} shipping stock amount of processed shipment destination is equal to or larger than the minimum load capacity (step S204). In step S204, when the shippable stock amount is less than the minimum load amount (NO in step S204), the minimum amount of products required for loading on the ship is not stored in the warehouse. In this case, CPU 111 is processed shipping destination ship decides not sailed at time t _i, the loading state of the process target shipping destination at time t _i, indicating that the product has not been loaded on the ship "0" (Step S205), and the process proceeds to Step S211.

  In step S211, the CPU 111 determines whether or not all shipping destinations have been selected as processing target shipping destinations (step S211). If there remains a shipping destination that is not selected as the processing target shipping destination (NO in step S211), the CPU 111 moves the process to step S202, and selects one shipping destination that has not yet been selected as the processing target shipping destination. (Step S202), and the processing after Step S203 is executed.

In step S211, when all the shipping destinations have been selected as processing target shipping destinations (YES in step S211), the CPU 111 determines whether or not the time point t _i is the final time point of the planning period (step S211). S212). The final point of the planning period is given to the shipping planning device 1 in advance. When the time point t _i is not the final time point of the planning period (NO in step S212), the CPU 111 changes the time point t _i to be processed to the next time point (step S213), and moves the process to step S202.

On the other hand, (YES at step S204) In the case the amount of shipping stock is equal to or greater than the minimum load capacity step S204, CPU 111 determines a processing target shipping destination of the ship is stationary in port entry or harbor at time _{t i,} the ship The actual load amount is updated (step S206). In the process of step S206, if the shipable stock quantity at the time t _i to the processing target shipping destination is equal to or less than the maximum load capacity, the actual load quantity is updated to the same value as the shipable stock quantity. When the shipable stock quantity is larger than the maximum load capacity, the actual load quantity is updated to the same value as the maximum load quantity.

Next, the CPU 111 sets the loading state of the processing target shipping destination at time t _i to “1” indicating that the product is loaded on the ship (step S207). Further, CPU 111 updates the shipping inventory amount at the time _{t i} to be processed shipping destination (step S208). In the process of step S208, in the inventory data, if stock quantity shipped at time t _i to be processed shipping destination is equal to or less than the maximum load capacity, the shipping stock amount is "0". Further, when the shippable stock quantity is larger than the maximum load capacity, the difference between the shippable stock quantity and the maximum load quantity is set as a new shipable stock quantity.

  The processing in steps S203 to S208 will be described with an example. FIG. 6 is a schematic diagram for explaining the update of the available stock quantity. In the example illustrated in FIG. 6, the shipable stock quantity of the shipping destination A from “January 10” to “January 12” is less than 600. Here, assuming that the minimum loading capacity of the ship of shipping destination A is “600” and the maximum loading capacity is “1000”, the shipable inventory of shipping destination A from “January 10” to “January 12”. The amount will be less than the minimum loading capacity. For this reason, it is assumed that the ship of the shipping destination A does not enter the port from “January 10” to “January 12”, the actual load amount during this period remains “0”, and the shipable stock amount is not updated. Further, the loading state from “January 10” to “January 12” is set to “0”. On the other hand, on “January 13”, the shipping available stock quantity of the shipping destination A before the update is “600”, which is not less than the minimum loading capacity and less than the maximum loading capacity. Therefore, the time of arrival of the ship of the shipping destination A is determined as “January 13”, the actual loading amount is changed from “0” to “600”, and the loading state of the shipping destination A at “January 13” is changed. “1”. In addition, in the inventory amount data, the inventory amount that can be shipped to the shipping destination A on “January 13” is set to “0”.

When the process of step S208 is completed, the CPU 111 determines whether or not the actual load amount of the ship to be processed is the maximum load amount (step S209). Here, when the actual load capacity of the ship to be processed is not the maximum load capacity (NO in step S209), the CPU 111 determines that the ship does not leave the port at time t _i and moves the process to step S211.

On the other hand, in step S209, if the actual load capacity of the ship to be processed is the maximum load capacity (YES in step S209), the CPU 111 determines the ship departure time as time t _i . In this case, the CPU 111 subtracts the maximum load capacity of the ship at the ship destination from each of the shipable stock quantities after the time point t _{i + 1} to the processing target ship destination in the stock quantity data (step S210).

  With reference to the example of FIG. 6, processing in steps S <b> 203 to S <b> 210 will be described in the case where the shipable stock quantity is equal to or greater than the maximum load capacity. In the example illustrated in FIG. 6, the shipable stock quantity of the shipping destination A on “January 14” is “1000”. Accordingly, since the shippable inventory amount is equal to or greater than the minimum load amount, the ship is determined to stop at the port on “January 14”, and the actual load amount on “January 14” is updated. Here, since the shippable inventory amount is “1000” which is the same as the maximum load amount, the actual load amount is updated to “1000”. Further, the loading state on “January 14” is set to “1”, and the shippable stock quantity is updated to “0”.

  As described above, the actual load amount of the shipping destination A on “January 14” is “1000”. This is the same as the maximum load capacity “1000” of the ship of shipping destination A. Accordingly, the departure time of the ship is determined to be “January 14”, and in step S210, the shipable inventory quantity at all times after “January 15” is reduced by 1000, and the shipable inventory quantity is reduced. The included inventory data is stored in the hard disk 111.

When the process of step S210 is completed, the CPU 111 moves the process to step S211. If all the shipping destinations have been selected as processing target shipping destinations in step S211 (YES in step S211), and in step S212, time t _i is the final time of the planning period (YES in step S212), CPU 111 A shipping plan is generated based on the port entry time and the port departure time determined as described above (step S214). In the process of step S214, a shipping plan is generated using the loading state at each time point. When the loading state of a ship at a certain destination is “0”, the value at that point of the destination is “0” indicating that the ship has not entered the port in the shipping plan. Further, when the loading state at a certain time of a ship of a certain destination is “1”, the value at that time of the destination is the maximum shipment amount of that ship in the shipping plan. Here, the maximum loading capacity in the shipping plan indicates that the ship is stopped at the port (see FIG. 10).

  When the process of step S214 is completed, the CPU 111 ends the initial shipment plan generation process and returns the process to the main routine of the shipment plan planning process.

  With the above initial shipment plan generation process, a shipment plan considering the load situation of the warehouse can be generated. In addition, this shipping plan is a shipping plan when there is no restriction on ship berthing.

  With reference to FIG. 2 again, the shipping plan planning process will be described. After the initial shipment plan generation process, the CPU 111 executes a shipment plan correction process (step S103). This shipping plan correction process is a process for correcting the shipping plan generated by the initial shipping plan generation process so as to satisfy the constraint condition regarding the berthing of the ship.

  The shipping plan correction process will be described in more detail. FIG. 7 is a flowchart showing the procedure of the shipping plan correction process.

  The shipping plan correction process goes back from the final point of the planning period, determines whether or not the constraint conditions are violated at each time point, and if the constraint condition is violated, the ship arrives and departs so that the constraint condition violation is resolved. Modify the schedule.

  In the shipping plan correction process, first, the CPU 111 reads the shipping plan (step S301). In step S <b> 301, when the target to be corrected is the shipping plan generated by the initial shipping plan generation process, the CPU 111 reads this shipping plan from the hard disk 115. If the target to be corrected is a shipment plan designated by the user, the designated shipment plan is read from the recording medium (hard disk 115 or other recording medium) on which the shipment plan is recorded.

Next, the CPU 111 sets the time t _i to be processed as the final time of the planning period (step S302).

Next, the CPU 111 determines whether or not the shipping plan violates the constraint condition at the time point t _i (step S303). In step S303, the CPU 111 refers to the shipment plan and determines whether two ships of a combination of “Large” and “Large”, or three or more ships are stopped at the port at time t _i . If two ships with a combination of “Large” and “Large”, or more than two ships, stop at the port, the constraint is violated. If there is no ship that stops at time t _i , only one ship stops, and two ships of “Large” and “Small” or a combination of “Small” and “Small” do not violate the constraints .

When the constraint condition is not violated at time t _i (NO in step S303), the CPU 111 determines whether or not the time t _i is the current time (starting time of the planning period) (step S307). When the time point t _i is not the current time point (NO in step S307), the CPU 111 changes the time point t _i to be processed to the previous time point (step S308), and moves the process to step S303.

On the other hand, when the constraint condition is violated at time t _i (YES in step S303), CPU 111 determines whether or not a plurality of ships have departed at time t _i (step S304). When the departure of a plurality of ships overlaps at time t _i (YES in step S304), CPU 111 changes the departure time of some of these ships to time t _i-1 (step S305). .

In the process of step S305, the CPU 111 compares the free capacity at the time point t _i-1 of the plurality of ships having the same departure time point, and changes the departure time point of the ship having a small free capacity to the time point t _i-1 . Here, the free capacity is a value obtained by subtracting the actual load capacity at the time point t _i-1 from the maximum load capacity. When the departure times of the two ships overlap, the CPU 111 changes the departure time of the ship with the smaller free capacity at the time t _i−1 and does not change the departure time of the ship with the larger free capacity. When the departure times of three or more ships overlap, the CPU 111 does not change the departure time of the ship with the smallest available capacity at the time t _i−1, and changes the departure times of other ships. Moreover, when the vacant capacity in time t _i-1 is the same among a plurality of ships, the departure time of either ship is changed.

  FIG. 8 is a schematic diagram for explaining a change of a departure / arrival schedule when a plurality of ships depart from each other. In FIG. 8, a circle indicates that the ship is stopped at the port. In the example illustrated in FIG. 8, the ship of the shipping destination A is stopped at the port at the time (date) “January 20” to “January 25”, and the time (date) “January 23” to “ On January 25th, ship B of ship-to party B is stopped at the port. That is, in both ships A and B, the last stop time is “January 25”, and this “January 25” is the departure time. In this example, it is assumed that the ship sizes of the shipping destinations A and B are both “large”. That is, since the restriction condition is violated on “January 25” and the departures of the ships of shipping destinations A and B overlap, the departure time of one of these ships is changed.

  Here, it is assumed that the actual load capacity of the ship of shipping destination A on “January 24” is “800”, and the maximum load capacity of this ship is “1000”. Further, it is assumed that the actual loading capacity of the ship of the shipping destination B on “January 24” is “200”, and the maximum loading capacity of this ship is “600”. In this case, the free capacity of the ship of shipping destination A is “200”, and the free capacity of the ship of shipping destination B is “400”. Therefore, the departure time of the ship of the shipping destination A with a small free space is changed from “January 25” to “January 24”. Thereby, a shipping plan can be corrected so that the departure time may not overlap.

  In the example of FIG. 8, even if the departure time of the shipping destination A is changed, the violation of the constraint conditions on “January 23” and “January 24” is not resolved, but the violation proceeds as the processing proceeds. It will be resolved. The resolution of this violation will be described later.

  As described above, by leaving the ship of the shipping destination A having a small available capacity first, the cargo room of the ship of the shipping destination B having a large available capacity can be used as a warehouse, and the load on the warehouse can be reduced. In addition, if the ship-to-ship destination ship B's departure time is changed to “January 24”, the free space at the time of departure of the ship will be “400”, and the ship-out time of the ship-to ship A will be “January 24”. The free space increases compared to the free space “200” of the ship in the case of changing to That is, it is possible to suppress an increase in the free capacity of the ship at the time of departure by leaving the ship of the shipping destination A having a small free capacity first.

  When the process of step S305 is completed, the CPU 111 moves the process to step S307.

On the other hand, when a plurality of ships do not overlap at time t _i (NO in step S304), the CPU 111 selects a ship that will leave later among the plurality of ships stopped at the port at time t _i (hereinafter, “ The time of entry of the “last ship” is changed after the time of departure of the ship that departs first (hereinafter referred to as “first ship”) (step S306).

In the process of step S306, when three or more ships are stopped at the port at time t _i , the CPU 111 checks the size of each ship and at time t _i so as not to violate the constraint condition at time t _i . Change the time of entry of one or more of the ships at the port. Here, among the plurality of ships that are stopped at the port at time t _i , the last time to depart from the port may be changed after the time at which the other ship departs. You may change the time of arrival of your ship after the time of departure of other ships.

  FIG. 9 is a schematic diagram for explaining a change in the departure / arrival schedule when the departures and departures of a plurality of ships do not overlap. In the example shown in FIG. 9, the ship of the shipping destination A is stopped at the port at the time (date) “February 6” to “February 9”, and “February 8” to “February 12”. The ship of the shipping destination B is stopped at the port. In this example, it is assumed that the ship sizes of the shipping destinations A and B are both “large”. That is, the constraint conditions are violated from “February 8” to “February 9”. In this example, the ship of the shipping destination A departs first (the time of departure “February 9”), and the ship of the shipping destination B departs later (the time of departure “February 12”). Therefore, the port of arrival of the ship of the shipping destination B is changed to “February 10” after “February 9” of the departure of the ship of the shipping destination A.

  As described above, by changing the time of entry of the next ship to be after the time of departure of the first ship, the stopping time of the first ship is not shortened, and the free capacity at the time of departure of the first ship does not change. On the other hand, since the departure time of the newer ships is changed but the departure time is not changed, the vacant capacity at the time of departure does not change. Therefore, it is possible to prevent an increase in free space in the first ship and the subsequent ship.

Further, as in the example of FIG. 8 described above, when the violation of the constraint condition has not been eliminated in the process of step S305, the violation of the constraint condition is eliminated in step S306 after the time t _i is updated.

When the process of step S306 is completed, the CPU 111 moves the process to step S307. In step S307, when the time point t _i is the current time point (YES in step S307), the CPU 111 ends the shipping plan correction process and returns the process to the main routine of the shipping plan planning process.

  Through the above-described shipping plan correction process, the shipping plan is corrected so as not to violate the constraint conditions related to ship berthing.

  Next, the CPU 111 executes a shipping plan recorrection process for recorrecting the corrected shipping plan (step S104). In the shipping plan modified by the shipping plan correction process, if there is a point in time when the departure of multiple ships overlaps from the final point of the planning period, the departure point of the ship with the smallest available capacity among the plurality of ships is indicated. Changed to the previous time. For this reason, when a plurality of ships depart from each other at the start of the planning period, that is, at the present time, there is no time before that time, so the violation of the constraint cannot be resolved. The shipping plan re-correction process is a process for eliminating the violation of the constraint condition remaining in the shipping plan correction process. For the sake of convenience, the description will be continued assuming that the shipping plan re-correction process is executed even when no constraint condition remains after the shipping plan correction process.

The contents of the shipping plan recorrection process will be described in detail. FIG. 10 is a flowchart showing the procedure of the shipping plan recorrection process. First, the CPU 111 sets the time t _i to be processed as the current time (step S401).

Then CPU111, at time _{t i,} and determines whether the shipment schedule violates the constraint (step S402). When the constraint condition is not violated at time t _i (NO in step S402), the CPU 111 determines whether or not the time t _i is the final time of the planning period (step S407). When the time point t _i is not the final time point of the planning period (NO in step S407), the CPU 111 changes the time point t _i to be processed to the next time point (step S408), and moves the process to step S402. As a result, when no constraint condition violation remains in the shipping plan as a result of the shipping plan correction process, the shipping plan is not re-corrected.

On the other hand, if the constraint condition is violated at time t _i (YES in step S402), CPU 111 determines whether or not a plurality of ships have departed at time t _i (step S403). If the constraint condition is violated, a plurality of ships that violate the constraint condition are stopped at the port at time t _i . Such constraints violation, that departure of several ships are duplicated at the time t _i (hereinafter referred to as "departure overlapping") and, a plurality of the ship is staying in the harbor at the time t _i, departure There are some points that do not overlap (hereinafter referred to as “duplicate stops”). In step S403, it is determined whether or not port departure duplication is included in the constraint condition violation. That is, when it is determined in step S403 that the departure port overlap is not included, the constraint condition violation is a stop overlap.

When the departure from port overlap is included in the constraint condition violation at time t _i (YES in step S403), the CPU 111 determines the time of entry and departure (port entry / exit) of some of the ships that are leaving the port. Change to ti _{+ 1} (step S404).

In the process of step S404, the arrival / departure schedule is corrected so that the increase in warehouse load (inventory amount) is minimized in the future (t _{i + 1} ). Specifically, the CPU 111 compares the actual loading capacity at the time point t _i of a plurality of ships that overlap at the departure time, and changes the arrival / departure time point of the ship having the smallest actual loading capacity to the time point t _{i + 1} . As a result, the load on the warehouse at time t _{i + 1} increases by the actual loading capacity of the ship whose entry and departure time has been changed, but the actual loading capacity of the ship is the actual load of all the ships that have departed at time t _i . Since it is the smallest of the loading capacity, the increase in warehouse load will be minimal. For example, if the departure point of the two boats are overlapped, CPU 111 changes the input departure time of the actual loading capacity is smaller ship at time t _i, the input departure point towards the ship the actual loading capacity is large Not going to change. When the departure times of three or more ships overlap, the CPU 111 changes the entry / exit time of the ship with the smallest actual load at time t _i and does not change the entry / exit times of other ships. In addition, when the actual load amount at the time point t _i is the smallest and the same among the plurality of ships, the entry / exit point of the ship with the larger shipping available stock amount at the next time point t _{i + 1} is changed.

  FIG. 11A to FIG. 11C are schematic diagrams for explaining an example of a change in the departure / arrival schedule in the shipping plan recorrection process. In FIGS. 11A to 11C, each number indicates the actual load capacity of the ship. In addition, the bold frame indicates the stop of the ship at the port. In other words, in the example shown in FIG. 11A, the ships of shipping destinations A, C, and G enter and leave the port on “August 18”, and the ships of shipping destinations B and E enter and exit on “August 19”. It is. Here, it is assumed that the ship sizes of the shipping destinations A and B are “large”, and the ship sizes of the shipping destinations C, E, and G are “small”. In the example shown in FIG. 11A, the ships of shipping destinations A, C, and G overlap at “August 18”, which violates the constraint conditions. Therefore, among these, the time of arrival and departure of the ship of the shipping destination G having the smallest actual load capacity is changed to “August 19”. Thereby, the violation of the constraint condition on “August 18” is resolved.

  When the entry / exit time of the shipping destination G is changed as described above, the state shown in FIG. 11B is obtained. In FIG. 11B, on August 19th, the shipping ports of shipping destinations B, E, and G overlap, and the constraint conditions are violated. Accordingly, it is determined in step S402 that the constraint condition is violated, and the process of step S403 is executed. In the example shown in FIG. 11B, the actual loading capacity of the ships at shipping destinations E and G is smaller than the actual loading capacity of the shipping ship at shipping destination B, but 400 is the same. Therefore, in this case, the shipable stock quantities of “August 20” when the time of entering and leaving the port is changed to “August 20” for each of the shipping destinations E and G are compared. When the arrival / departure point of the ship of the shipping destination E is changed to “August 20”, the available stock quantity of the shipping destination E at “August 20” is “400”. On the other hand, when the arrival / departure point of the ship of the shipping destination G is changed to “August 20”, the shipable inventory amount of the shipping destination G on “August 20” is “500”. Therefore, the arrival / departure time of the ship of the shipping destination G having a large shipmentable inventory amount on “August 20” is changed to “August 20” (see FIG. 11C). Thereby, the violation of the constraint condition on “August 19” is resolved. Further, the restriction condition is also satisfied on “August 20”.

Refer to FIG. 10 again. In step S403, when the departures of a plurality of ships do not overlap at time t _i , that is, when the duplication of departure is not included in the constraint violation (NO in step S403), a plurality of ships with different departure times stops at the port. Is in a state of being. In this case, the CPU 111 changes the time of entry of some of these ships to time t _{i + 1} (step S405). Specifically, the CPU 111 compares the actual loading capacity at the time point t _i of a plurality of ships simultaneously stopped at the port, and changes the arrival time point of the ship having the smallest actual loading capacity to the time point t _{i + 1} . Here, departure time of the target ship to change the Arrivals time be a time t _i, departure time with port entry point is also changed to point t _{i + 1.} After the process of step S405, the CPU 111 moves the process to step S407.

  FIG. 12A to FIG. 12C are schematic diagrams for explaining another example of the change of the departure / arrival schedule in the shipping plan recorrection process. In the example shown in FIG. 12A, ships of shipping destinations A, C, and G enter and exit on “August 18”, and ships of shipping destination B enter and exit on “August 19”. In addition, the ship of the shipping destination E is scheduled to enter the port on “August 19” and leave the port on “August 20”. In this example, the arrival and departure of ships of shipping destinations A, C, and G overlap on “August 18”, which violates the constraint conditions. Therefore, the time of entry / exit of the ship of the shipping destination G having the smallest actual load capacity is changed to “August 19” by the process of step S404. Thereby, the violation of the constraint condition on “August 18” is resolved.

  When the entry / exit time of the shipping destination G is changed as described above, the state shown in FIG. 12B is obtained. In FIG. 12B, the ships of shipping destinations B, E, and G overlap at “August 19”, but the shipping destinations B and G (“August 19”) and shipping destination E ( “August 20”). Accordingly, the CPU 111 changes the port entry time of the ship of the shipping destination E with the smallest actual load capacity at the processing target time point “August 19” to “August 20” by the process of step S405 (see FIG. 12C). . Thereby, the violation of the constraint condition on “August 19” is resolved. Further, the restriction condition is also satisfied on “August 20”.

Refer to FIG. 10 again. When the process of step S404 described above is performed, the overlap of departures of a plurality of ships is eliminated. However, in some cases, the constraint violation at time t _i includes both port departure overlap and stop overlap. In such a case, even if port departure overlap at time t _i is resolved, the stop overlap is not resolved. As a result, the violation of the constraint condition may not be resolved. Therefore, after the process of step S404, the CPU 111 determines whether or not the constraint condition violation at the time point t _i has been eliminated, that is, whether or not there is a duplicated stop (step S406). If there is a stationary overlap (YES in step S406), CPU 111 moves the process to step S405 described above. Thereby, the stop overlap is eliminated.

If there is no stationary overlap in step S406 (NO in step S406), CPU 111 moves the process to step S407. In step S407, when the time point t _i is the final time point of the planning period (YES in step S407), the CPU 111 ends the shipping plan recorrection process and returns the process to the main routine of the shipping plan planning process. By executing the above-described shipping plan re-correction processing, it is possible to eliminate the constraint condition violation remaining in the shipping plan correction processing. In addition, by changing the scheduled arrival and departure of ships with small actual loading capacity among ships that violate the constraint conditions, the increase in warehouse load is suppressed as much as possible while reducing the free space of the ship and satisfying the constraint conditions. It can be a shipping plan.

  With reference to FIG. 2 again, the shipping plan planning process will be described. After the shipping plan recorrection process, the CPU 111 generates a product available stock quantity for each time point based on the obtained shipping plan (step S105).

  Next, CPU111 produces | generates the total stock quantity of the warehouse for every time (step S106). In this process, the total stock quantity of the warehouse is generated by adding the shipable stock quantity and the non-shipable stock quantity for each time point.

  Next, the CPU 111 outputs (1) the corrected shipping plan, (2) the time-series shipping available inventory quantity, and (3) the total inventory quantity of the warehouse (step S107). FIG. 13 is a diagram illustrating an output example of a shipping plan, FIG. 14 is a diagram illustrating an output example of a shippable inventory amount, and FIG. 15 is a diagram illustrating an output example of a total inventory amount in a warehouse. As shown in FIG. 13, the shipment plan indicates which ship to ship to is stopped at the port at each time point. A shipment plan that does not violate the constraint conditions may not be executed due to reasons such as warehouse load conditions and factory production capacity. The user can determine whether or not there is a problem in the shipping plan by checking the output shipping plan.

  Further, as shown in FIG. 14, the available stock quantity at each time point is output. The user can make a production plan for the product or modify it with reference to the available stock quantity. In some cases, the output available stock quantity cannot be realized due to factors such as the production capacity of the factory. In such a case, the user can determine that the shipping plan should be corrected.

  Further, as shown in FIG. 15, the total inventory amount of the warehouse at each time point is output in a graph format. The vertical axis of the graph indicates the storage rate of the warehouse, and the horizontal axis indicates the time. In this way, by outputting the total stock quantity of the warehouse in time series, the user can check the transition of the total stock quantity. Also, if there is a point in time when the storage rate of the warehouse exceeds 100%, the product cannot be stored in the warehouse. Therefore, in such a case, the user can determine that there is a problem with the shipping plan.

  Here, the shipping plan, the shipping available stock quantity, and the total stock quantity may be displayed on the display unit 13 or may be printed by a printer connected to the shipping plan planning apparatus 1.

  The user confirms the output shipping plan, shipable stock amount and total stock amount, and determines whether there is a problem in the shipping plan. If there is a problem, the user manually corrects the shipping plan. When the correction is performed, the user gives an instruction to execute the shipping plan correction process to the shipping plan planning apparatus 1 again. In this case, the user instructs the shipping plan planning apparatus 1 to correct the shipping plan by designating a storage location in the hard disk 115 or the like of the shipping plan to be processed. If the shipping plan is not corrected, the user gives the shipping plan planning apparatus 1 an instruction to end the shipping plan planning process.

  The CPU 111 determines whether an instruction to modify the shipping plan has been received from the user or an instruction to end the shipping plan planning process has been received (step S108). If a shipping plan correction instruction has been received (“shipment plan correction instruction” in step S108), the CPU 111 moves the process to step S103, and executes a shipping plan correction process for the designated shipping plan.

  On the other hand, when an end instruction for the shipping plan planning process is received from the user (“end instruction” in step S108), the CPU 111 ends the shipping plan planning process.

  With the above configuration, a shipping plan can be made in consideration of the load situation of the warehouse. In addition, it is possible to devise a shipping plan that defines the arrival and departure schedule of each ship without exceeding the limit on the number of ships that can be received simultaneously at the port.

(Other embodiments)
In the above-described embodiment, the configuration for preparing a shipping plan by ship has been described, but the present invention is not limited to this. A shipment plan by a transport aircraft other than a ship, for example, a truck, a railroad, or an aircraft may be drafted.

  In the above-described embodiment, the configuration for creating a product shipment plan has been described. However, the present invention is not limited to this. The “product to be shipped” may not be a product that has been manufactured, but a semi-finished product that is in the middle of manufacturing. A semi-finished product that has been processed halfway through the manufacturing process in one factory may be temporarily stored in a warehouse, then transported to another factory, and the remaining manufacturing process may be performed in the other factory to complete the product. . In such a case, it is useful to make a shipping plan for semi-finished products.

  In the above-described embodiment, the configuration has been described in which the shipping plan generated in the initial shipping plan generation process is corrected so as not to violate the constraint conditions in the shipping plan correction process, and the corrected shipping plan is output. However, the present invention is not limited to this. A shipping plan generated without considering the constraint condition may be output. Even in this case, the obtained shipping plan is useful in consideration of the load situation of the warehouse.

Further, in the above-described embodiment, the shipable stock quantity at the time point t _i is compared with the minimum load capacity, and if the shipable stock quantity is equal to or greater than the minimum load quantity, the ship enters the port at the time point t _i. However, the present invention is not limited to this. As long as the comparison target of the shipable stock quantity is the quantity of the product loaded on the ship, it may be other than the minimum load quantity. For example, when the shipable stock quantity reaches the maximum load capacity by comparing the shippable stock quantity with the maximum load capacity, it is also possible to set the ship arrival time. In this manner, by using the shippable stock quantity and the quantity of products loaded on the ship, it is possible to determine the port entry time according to the shippable stock quantity. However, for example, when the shipable inventory quantity reaches the maximum loading capacity, the time when the shipable inventory quantity reaches the maximum loading capacity is determined, for example, the time when the shipable inventory quantity reaches a predetermined amount less than the maximum loading capacity. It is preferable to do. As a result, the ship can enter the port before the time when the product with the maximum load capacity can be loaded on the ship, and a long stoppage period can be secured. For this reason, it is possible to reduce the load on the warehouse by using a parked ship as a part of the warehouse.

In addition, the available stock quantity at time t _i may not be compared with the quantity of products loaded on the ship. For example, the time when the available stock quantity is other than 0 can be set as the time when the ship enters the port. Shipable stock quantity is information reflecting the load situation of the warehouse. Therefore, in this case as well, a shipping plan that takes into consideration the load situation of the warehouse can be made.

  In the above-described embodiment, when the constraint condition is violated, it is determined whether or not the departure times of a plurality of ships overlap each other, and a different process is executed depending on the determination result. However, the present invention is not limited to this. If the constraint conditions are violated, regardless of whether or not the departure times of multiple ships overlap, the time of arrival of at least one of the multiple ships to be stopped at the same port by the same process Or it is good also as a structure which changes a port departure time. For example, if the constraint conditions are violated, some ships may be selected at random, and the time of entry or departure of the selected ships may be changed, or at a point in time between the ships. The available capacity may be compared to expedite the departure of a ship with a smaller available capacity.

  In the above-described embodiment, in the shipping plan correction process, when a constraint condition is violated and the departure times of a plurality of ships do not overlap, a plurality of ships stopped at the port at the same time. Of these, the configuration has been described in which the time of entry of the next vessel is changed after the departure of the first vessel, but the present invention is not limited to this. It is also possible to adopt a configuration in which the departure time of the first ship is changed before the arrival time of the next ship.

  In the above-described embodiment, in the shipping plan correction process, when a constraint condition is violated and the departure times of a plurality of ships overlap, the departure time of a ship having a small available capacity is Although the configuration of changing before the departure time of a ship with a large capacity has been described, it is not limited to this. The departure and arrival schedule of a ship may be changed so that the departure time of a ship with a small available capacity is later than the departure time of a ship with a large available capacity. In this case, the departure time of a ship with a large free capacity may be changed after the departure time of a ship with a large free capacity, or the departure time of a ship with a small free capacity may be changed. You may change the departure time of a ship with a large free capacity before the departure time of a ship with a small free capacity without changing the time.

Further, it is possible to change the departure time of a ship having a large free capacity after the departure time of a ship having a small free capacity without changing the departure time of a ship having a small free capacity. In this case, when the sail and the available capacity of the free space is larger ship is a small ship sailing overlap at time t _i, departure time of the free space is larger ship is changed from the time t _i to the next point in time t _{i + 1} Will be. Therefore, the violation of the constraint condition at time t _i has not been resolved. For this reason, in order to eliminate the violation of the constraint condition at the time point t _i, it is necessary to change the departure / arrival schedule separately.

  In the embodiment described above, the configuration for executing the shipping plan re-correction processing after the shipping plan correction processing has been described. However, the present invention is not limited to this. The configuration may be such that the shipping plan correction process is executed and the shipping plan recorrection process is not executed. Moreover, it is good also as a structure which performs the process similar to a shipping plan recorrection process, without performing a shipping plan correction process. In other words, it is determined whether there is a violation of the constraint condition at each point in time for the shipment plan generated by the initial shipment plan generation process. It is also possible to compare the actual load capacity and delay the entry / exit point of a ship with a small actual load capacity.

  In the above-described embodiment, when a plurality of ships depart at the time of departure in the shipping plan re-correction process, a ship having a small actual loading capacity among a plurality of ships at which the departure times overlap Although it has been described that the time is delayed, the present invention is not limited to this. Even if there is no overlap at the time of departure, if the restrictions are violated, the time of entry / exit of a ship with a small actual load among several ships that are stopped at the same time will be changed after the departure of other ships It is good also as composition to do.

  INDUSTRIAL APPLICABILITY The shipping plan planning device and the shipping plan planning method of the present invention are useful as a shipping plan planning device and method for planning a shipping plan for products or semi-finished products by a transport machine such as a ship or a truck.

DESCRIPTION OF SYMBOLS 1 Shipment planning apparatus 10 Computer 11 Main body 12 Input part 13 Display part 110 Shipment planning process program 111 CPU
115 Hard Disk 116 Input / Output Interface 117 Image Output Interface

Claims (14)

A shipping plan drafting device for drafting a shipping plan that defines an arrival time when a transport machine for shipment arrives at a loading place for loading an object to be shipped stored in a warehouse and a departure time from the loading place. ,
A specifying means for specifying a stock quantity of a shipment target product that can be shipped in the warehouse;
Determining means for determining the arrival time of the transport aircraft based on the inventory quantity specified by the specifying means;
A shipping plan planning device comprising: generating means for generating a shipping plan based on the arrival time determined by the determining means. The determining means is configured to determine the arrival time based on the inventory amount and the amount of a shipment target product loaded on the transport aircraft.
The shipment planning apparatus according to claim 1. The determining means is configured to determine a time point before the inventory amount reaches the upper limit value of the quantity of products to be loaded loaded on the transport aircraft as the arrival time point.
The shipment planning apparatus according to claim 1. A second determining means for determining, as the departure time of the transport aircraft, a time point when a load amount of the product to be shipped in the transport aircraft is an upper limit value of the amount of the product to be shipped loaded on the transport aircraft;
The generation means is configured to generate the shipping plan based on the arrival time and the departure time determined by the determination means and the second determination means, respectively.
The shipping plan planning device according to claim 3. In the shipping plan generated by the generating means, a determining means for determining whether or not a constraint condition regarding the number of transport aircraft to be simultaneously stopped at the loading site is violated,
Changing means for changing the arrival time or the departure time of at least one transport aircraft out of a plurality of transport aircraft to be simultaneously stopped at the loading site when the determination means determines that the constraint condition is violated. And further comprising
The shipping schedule planning device according to claim 4. The changing means is configured to change an arrival time of a subsequent transport aircraft that starts later among the plurality of transport aircraft after a start time of a previous transport aircraft that starts earlier.
The shipping plan planning device according to claim 5. The changing means includes the plurality of transport aircraft based on a free capacity of the transport aircraft based on an upper limit value of the amount of the shipment target products loaded on the transport aircraft and a load amount of the shipment target products on the transport aircraft. Configured to change the arrival time or the departure time of at least one of the transport planes,
The shipping plan planning device according to claim 5. The changing means includes a starting time point of the at least one transporting machine such that a starting time point of the transporting machine having a small free capacity among the plurality of transporting machines is earlier than a starting time point of a transporting machine having a large free capacity. Is configured to change,
The shipping plan planning device according to claim 7. The changing unit is configured to change the arrival time or the departure time of at least one of the plurality of transport aircraft based on a load amount of a shipment target item in the transport aircraft.
The shipping plan planning device according to claim 5. The changing means may arrive at the at least one transport aircraft such that an arrival time of the transport device having the small load capacity is later than a start time of the transport aircraft having the large load capacity among the plurality of transport aircraft. Configured to change the time,
The shipping plan planning device according to claim 9. An output means for outputting a shipping plan in which the arrival time or the departure time of the transport aircraft has been changed by the changing means;
11. A shipping plan planning device according to claim 5. Shipable inventory amount generating means for generating an inventory amount of a shipment target product that can be shipped in a warehouse at each of a plurality of time points based on a shipment plan in which the arrival time or the departure time of the transport aircraft is changed by the changing means. Further comprising
The output means is configured to further output an inventory quantity of the shipment target product generated by the shipable inventory quantity generating means.
The shipping schedule planning device according to claim 11. Based on a shipment plan in which the arrival time or the departure time of the transport aircraft has been changed by the changing means, further comprising: a total inventory quantity generating means for generating a total inventory quantity of a warehouse at each of a plurality of time points;
The output means is configured to further output the total inventory quantity generated by the total inventory quantity generation means.
The shipment planning apparatus according to claim 11 or 12. A shipping plan planning method for formulating a shipping plan that defines an arrival time when a transport aircraft for shipment arrives at a loading site for loading an object to be shipped stored in a warehouse and a departure time from the loading site. ,
A computer specifying a stock quantity of a shipment target product that can be shipped in the warehouse;
The computer determining the arrival time of the transport aircraft based on the identified inventory quantity;
And a step of generating a shipping plan based on the determined arrival time.

Images