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

Description

The present invention relates to a shipping plan planning apparatus and method for planning a shipping plan of products or semi-finished products by transportation machines such as ships and trucks.

It is important to formulate a shipping plan in order to efficiently ship the products manufactured in the factory. In Patent Document 1, a shipping plan is made in consideration of the deadline date for shipping the product, the loading amount of the transportation device, and the amount of work of a transportation device (crane or the like) for transporting the product from the warehouse to the transportation device at the time of shipping work. There is disclosed a shipping plan planning device for planning.

JP, 2010-254474, A

Products manufactured at the factory are temporarily stored in a warehouse before shipping. Since there is a limit to the capacity of the warehouse, the product cannot be stored in the warehouse unless the quantity of goods delivered to the warehouse can catch up with the quantity of goods delivered to the warehouse, and the production line at the factory must be stopped. However, the shipping plan planning apparatus described in Patent Document 1 does not consider the load situation of the warehouse in the planning of the shipping plan, and thus cannot deal 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 planning a shipping plan in consideration of the load status of a warehouse.

In order to solve the above-mentioned problems, a shipping planning apparatus according to an aspect of the present invention is directed to an arrival time point when a transporting machine for shipping arrives at a loading place for loading products to be shipped stored in a warehouse, and A shipping plan planning apparatus that creates a shipping plan that defines a departure time point starting from a loading place, and a specifying unit that specifies a stock quantity of products to be shipped in the warehouse, and the specifying unit specified by the specifying unit. The vehicle includes a determining unit that determines the arrival time of the transport aircraft based on the inventory amount, and a generating unit that generates a shipping plan based on the arrival time determined by the determining unit. Products to be shipped include products and semi-finished products. Further, “loading” refers to transferring the products to be shipped from the warehouse to the transportation machine, and “shipping” refers to transferring the products to be shipped to the shipping destination by the transportation machine.

In this aspect, the determining means may be configured to determine the arrival time point based on the inventory amount and the amount of the shipping target item loaded on the transport machine.

Further, in the above aspect, the determining means is configured to determine, as the arrival time, a time point before the inventory quantity reaches an upper limit value of the quantity of the shipping target article loaded on the transportation machine. May be.

Further, in the above aspect, the shipment planning apparatus sets a time point at which the loading amount of the shipping target product in the transportation machine becomes an upper limit value of the amount of the shipping target product loaded in the transportation machine to the transportation machine. The production means further comprises a second decision means for deciding as a departure time, and the production means produces the shipping plan based on the arrival time and the departure time decided by the decision means and the second decision means, respectively. It may be configured as follows.

Further, in the above aspect, the shipping plan planning apparatus determines whether or not the shipping plan generated by the generating means violates a constraint condition regarding the number of the transport aircraft to be simultaneously stopped at the loading place. The determination means and, when the determination means determines that the constraint condition is violated, the arrival time point or the departure time point of at least one of the plurality of transportation machines to be simultaneously detained at the loading place is determined. The changing means for changing may further be provided.

Further, in the above aspect, the changing means is configured to change the arrival time of a later-departing transport aircraft that departs later of the plurality of transportation aircraft after the departure time of a first-departure transportation aircraft that departs first. Good.

Further, in the above aspect, the changing unit is based on an available capacity of the transportation machine based on an upper limit value of the amount of the shipping target article loaded on the transportation machine and a loading amount of the shipping target article on the transportation machine. , It may be configured to change the arrival time or the departure time of at least one of the plurality of transportation machines.

Further, in the above aspect, the changing means sets the at least one of the plurality of transportation machines so that the departure time of the transportation machine having a small empty space is earlier than the departure time of the transportation machine having a large empty space. It may be configured to change the departure time of one transport aircraft.

Further, 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 machines based on a load amount of the products to be shipped in the transport machine. May be configured.

Further, in the above aspect, the changing means may include at least the arrival time of a transport aircraft with a small load capacity among the plurality of transport aircraft with respect to a departure time of a transport aircraft with a high load capacity. It may be configured to change the arrival time of one transport aircraft.

Further, in the above aspect, the shipping plan planning apparatus may further include output means for outputting a shipping plan in which the arrival time or the departure time of the transportation machine is changed by the changing means.

Further, in the above aspect, the shipment plan planning apparatus is capable of shipping at a plurality of time points in a warehouse based on a shipment plan in which the arrival time or the departure time of the transportation machine is changed by the changing unit. A shipment-possible-stock-amount generating unit that generates a stock amount of the product is further provided, and the output unit is configured to further output the stock amount of the shipment-possible product that is generated by the shipment-possible-stock amount generating unit. It may have been done.

Further, in the above aspect, the shipping plan planning apparatus generates a total inventory amount of a warehouse for each of a plurality of time points based on a shipping plan in which the arrival time or the departure time of the transportation machine is changed by the changing unit. Further, the output means may be configured to further output the total inventory amount generated by the total inventory amount generating means.

According to another aspect of the shipping planning method of the present invention, an arrival time at which a transporting machine for shipping arrives at a loading place for loading an item to be shipped stored in a warehouse and a departure time at which the transportation machine departs from the loading place. A method of planning a shipping plan, comprising: a computer specifying a stock quantity of products that can be shipped in the warehouse; and the computer based on the specified stock quantity. Determining the time of arrival of the aircraft, 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 status of the warehouse.

FIG. 3 is a block diagram showing the configuration of a shipping planning apparatus according to the embodiment. 6 is a flowchart showing the procedure of a shipping planning process by the shipping planning device according to the embodiment. The figure which shows an example of production planning data. The figure which shows an example of transportation machine data. The flowchart which shows the procedure of an initial shipping plan generation process. The schematic diagram for demonstrating update of the amount of stocks 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 and arrival schedule when the departure of several ships overlaps. The schematic diagram for demonstrating the change of the departure and arrival schedule when the departure ports of a plurality of ships do not overlap. Flowchart showing the procedure of the shipping plan recorrection process FIG. 6 is a schematic diagram for explaining an example of changing the departure/arrival schedule in the shipping plan re-correction processing. FIG. 6 is a schematic diagram for explaining an example of changing the departure/arrival schedule in the shipping plan re-correction processing. FIG. 6 is a schematic diagram for explaining an example of changing the departure/arrival schedule in the shipping plan re-correction processing. FIG. 8 is a schematic diagram for explaining another example of changing the departure/arrival schedule in the shipping plan re-correction processing. FIG. 8 is a schematic diagram for explaining another example of changing the departure/arrival schedule in the shipping plan re-correction processing. FIG. 8 is a schematic diagram for explaining another example of changing the departure/arrival schedule in the shipping plan re-correction processing. The figure which shows the output example of a shipping plan. The figure which shows the output example of the amount of stock that can be shipped. The figure which shows the output example of the total stock amount of a warehouse.

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

In the present embodiment, a description will be given of drafting a shipping plan when a product (shipping target product) is shipped by a ship. Products manufactured at the factory are temporarily stored in a warehouse before shipping. The products stored in the warehouse are inspected for shipping, and the products that pass the inspection are ready to be shipped. On the other hand, products that fail the inspection and products before the inspection cannot be shipped. In addition, the lower limit and upper limit of the amount of products loaded for each ship for shipping are set, and if the inventory quantity of products that can be shipped in the warehouse exceeds the lower limit, the ship will The ship shall be loaded with products upon arrival at the port. Then, it is assumed that the ship is loaded with products in an amount equal to or less than the upper limit value and shipped.

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

The amount of product loaded on a ship at a certain point of time is called the "actual load", and the lower and upper limits of the amount of product loaded on the ship are called "minimum load" and "maximum load", respectively. .. The information indicating whether or not the product is loaded on the ship at a certain time point is referred to as the "loading state" of the ship. When the "load status" is "0", it means that the product is not loaded on the ship, and when the "load status" is "1", it means that the product is loaded on the ship. ..

In addition, it is assumed that the port has the following restrictions on the arrival of ships. There are two types of sizes, "Large" and "Small", defined for ships, and only two ships can be docked at the same time at the same time in a combination of "Large" and "Small" or "Small" and "Small". That is, two vessels of "Large" and "Large" combination, and three or more vessels cannot dock at the same time.

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

The shipping planning apparatus according to the present embodiment is arranged so that a ship for shipping products arrives at a port for loading products (at the time of entry) and a departure from the port (at the time of departure) for each of a plurality of ships. Make a shipping plan as shown in.

[Configuration of shipping planning device]
The configuration of the shipping planning apparatus according to the present embodiment will be described. FIG. 1 is a block diagram showing the configuration of the shipping plan planning apparatus according to the present embodiment. The shipping planning apparatus 1 is realized by the 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, a ROM 112, a RAM 113, a reading device 114, a hard disk 115, an input/output interface 116, and an image output interface 117. The CPU 111, the ROM 112, the RAM 113, the reading device 114, the hard disk 115, the input/output interface 116, The image output interface 117 and the image output interface 117 are connected by a bus.

The CPU 111 can execute the computer program loaded in the RAM 113. Then, the CPU 111 executes the shipping plan planning program 110, which is a computer program for planning a shipping plan, so that the computer 10 functions as the shipping plan planning apparatus 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 this, and the like.

The RAM 113 is configured by SRAM, DRAM or the like. The RAM 113 is used to read the shipping planning program 110 recorded in the hard disk 115. Further, when the CPU 111 executes the computer program, it is used as a work area of 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. The shipping planning program 110 is also installed in the hard disk 115.

The input/output interface 116 includes, 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, or the like. It is configured. An input unit 12 including a keyboard and a mouse is connected to the input/output interface 116, and a 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 configured by an LCD, a CRT or the like, and outputs a video signal according 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 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 flow chart showing the procedure of the shipping planning process by the shipping planning device 1 according to the present embodiment.

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

The input data includes production plan data indicating the cumulative amount of shipment at each time point for each shipping destination, and transport aircraft data regarding a ship that is a transport aircraft.

FIG. 3 is a diagram showing an example of production planning data. As shown in FIG. 3, the production plan data shows the cumulative amount of shipments possible at each of a plurality of time points, that is, the cumulative total of the products that can be shipped up to that time point and the shipping destination. Although not shown in FIG. 3, the production plan data also includes the non-shippable 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 production plan for each day, the "time point" is a date. Further, when the production plan data indicates the production plan twice a day in the morning and in the afternoon, the “point of time” is the date and the morning or the afternoon, such as “A year XX month A morning”. When the production plan data indicates an hourly production plan, the "time point" is the date and time (○ year xx month xx day 0:00). 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 the “time point” is a date.

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

FIG. 4 is a diagram illustrating an example of transport plane data. The transport machine data is data defining a shipping destination, a ship size (large or small), and a minimum load capacity and a maximum load capacity of the ship for each ship.

Next, the CPU 111 executes an initial shipping plan generation process (step S102). This initial shipping plan generation process is a process of generating a shipping plan based on the input data when the above constraint conditions are not satisfied.

In the initial shipping plan generation process, a shipping plan is generated according to the following rules.
<Rule>
a. When the shippable inventory (the inventory of products that can be shipped in the warehouse) reaches the minimum load, the ship will enter the port.
b. The ship will remain 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 will leave.
d. No restrictions are imposed (there is no limit to the size and number of ships that can be docked at the same time).

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

In the initial shipment schedule generation processing, firstly CPU111 sets the time _{t i} to be processed in the current time (step S201).

Here, the actual loading amount 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 loading capacity of the ship is "0".

Further, the hard disk 115 stores a loading state for each shipping destination (for each ship). The loading state indicates whether or not products are loaded on the ship. The loading state is information that can take two values of “0” and “1”. If the loading state is "0", it means that the product is not loaded on the ship. If the loading state is "1", it indicates that the product is loaded on the ship. If the ship has not entered the port, the loading status is "0". When the ship is stopped at the port, the product is loaded on the ship, so the loading state is "1". That is, the loading state indicates the state related to the entry of a ship as follows.

The CPU 111 selects one of the shipping destinations as the processing destination 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 stock amount data is the same data as the production planning data. As will be described later, the inventory amount data is updated as the process progresses.

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 shipmentable inventory 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, the CPU 111 determines that the ship to be processed does not enter the port at time t _i, and sets the loading state of the ship to be processed at time t _i to “0” indicating that no product is loaded on the ship. Then (step S205), the process proceeds to step S211.

In step S211, the CPU 111 determines whether all the shipping destinations have been selected as the processing target shipping destinations (step S211). When there remains a shipping destination that has not been selected as a processing target shipping destination (NO in step S211), the CPU 111 shifts the processing to step S202, and selects one of the shipping destinations that have not been selected as a processing target shipping destination. Then (step S202), the processes after step S203 are executed.

Further, in step S211, when all the shipping destinations have been selected as the 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). S212). The final point of the planning period is given to the shipping planning apparatus 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 processing target time point t _i to the next time point (step S213), and moves the process to step S202.

On the other hand, in step S204, when the shippable inventory amount is equal to or more than the minimum load amount (YES in step S204), the CPU 111 determines that the ship to be processed enters the port or _stays in the port at the time ti, and the ship The actual loading amount of is updated (step S206). In the process of step S206, when shipping stock amount at the time t _i to be processed shipping destination is equal to or less than the maximum load capacity, the actual loading capacity is updated to the same value as its shipping available inventory. If the shipmentable inventory amount is larger than the maximum load amount, the actual load amount is updated to the same value as the maximum load amount.

Then CPU111 is the loading state of the process target shipping destination at time _{t i,} indicating that the product is loaded on the ship to "1" (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". When the shipmentable inventory amount is larger than the maximum loadable amount, the difference between the shipmentable inventory amount and the maximum loadable amount is set as the new shipmentable inventory amount.

The processing of steps S203 to S208 will be described with an example. FIG. 6 is a schematic diagram for explaining the update of the shipmentable inventory amount. In the example shown in FIG. 6, the shippable inventory 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 the shipping destination A is “600” and the maximum loading capacity of the shipping destination is “1000”, the shipment available inventory of the shipping destination A in “January 10th” to “January 12th” The amount will be less than the minimum load. For this reason, it is assumed that the ship of the shipping destination A does not enter the port from "January 10th" to "January 12th", the actual load capacity during this period remains "0", and the available inventory quantity is not updated. Further, the loading state from “January 10th” to “January 12th” is set to “0”. On the other hand, on "January 13", the shipmentable inventory amount of the shipping destination A before the update is "600", which is equal to or more than the minimum loading amount and less than the maximum loading amount. Therefore, the arrival time of the ship of the shipping destination A is determined to be “January 13”, the actual loading amount is changed from “0” to “600”, and the loading state of the shipping destination A on “January 13” is changed. It is set to "1". Further, in the inventory quantity data, the available inventory quantity 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 loading amount of the processing destination ship is the maximum loading 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 of the processed ship-ship is the maximum loading capacity (YES in step S209), CPU 111 determines the departure time of the ship at time _{t i.} In this case, the CPU 111 subtracts the maximum load amount of the ship of the shipping destination from each of the available stock amount of the shipping target shipping destination after the time ti ₊₁ in the stock amount data (step S210).

The processing of steps S203 to S210 when the shipmentable inventory amount is equal to or larger than the maximum load amount will be described using the example of FIG. In the example shown in FIG. 6, the shippable inventory quantity of the shipping destination A on “January 14” is “1000”. Therefore, since the shippable inventory amount is equal to or greater than the minimum load amount, it is determined that the ship will stop at the port on “January 14”, and the actual load amount on “January 14” is updated. Here, since the shipmentable 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 available stock amount of inventory is updated to “0”.

As described above, the actual loading amount of the shipping destination A on “January 14” is set to “1000”. This is the same as the maximum loading capacity "1000" of the ship of the shipping destination A. Therefore, the departure time of the ship is determined to be “January 14”, and in step S210, the available shipment stock amount at all points after “January 15” is reduced by 1000, and the available shipment stock amount is reduced. The included inventory amount data is stored in the hard disk 111.

After finishing the process of step S210, the CPU 111 shifts the process to step S211. In step S211, all the shipping destination is selected as a process target shipping destination (YES in step S211), in step S212, the case when _{t i} is the last point of the planning period (YES in step S212), CPU 111 is A shipping plan is generated based on the entry time and 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” at a certain time point, the value at the time of the second destination at the time point is set to “0” indicating the non-arrival in the shipping plan. Further, when the loading state of a ship at a certain destination at a certain time point is “1”, the value at the time point at the second destination in the shipping plan is the maximum shipping amount of the ship. Here, the maximum load capacity in the shipping plan indicates that the ship is stopped at the port (see FIG. 10).

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

By the above initial shipping plan generation processing, it is possible to generate a shipping plan in consideration of the load status of the warehouse. In addition, this shipping plan is a shipping plan when there are no constraint conditions regarding the arrival of the ship on the shore.

The shipping planning process will be described with reference to FIG. 2 again. After the initial shipping plan generation processing, the CPU 111 executes shipping plan correction processing (step S103). The shipping plan correction process is a process of correcting the shipping plan generated by the initial shipping plan generation process so as to satisfy the constraint condition regarding the docking 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.

In the shipping plan correction process, it is decided to go back from the final point of the planning period, judge whether or not the constraint condition is violated at each time point, and if the constraint condition is violated, the departure and arrival of the ship to eliminate the violation of the constraint condition. Fix the appointment.

In the shipping plan correction processing, the CPU 111 first reads the shipping plan (step S301). In step S301, when the correction target is the shipping plan generated by the initial shipping plan generation processing, the CPU 111 reads this shipping plan from the hard disk 115. Further, when the correction target is the shipping plan designated by the user, the designated shipping plan is read from the recording medium (the hard disk 115 or another recording medium) in which the shipping plan is recorded.

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

Then CPU111, at time _{t i,} and determines whether the shipment schedule violates the constraint (step S303). In step S303, CPU 111 refers to the delivery schedule determines whether a combination of the two ship's "large" and "large" at time t _i, or three or more boats are stationary in harbor. If two vessels of "Large" and "Large" combination, or more than two vessels stop at the port, the constraint is violated. No constraint is violated if no ship is parked at time t _i , only one ship is parked, two ships of "large" and "small" or "small" and "small" are parked ..

When the constraint condition is not violated at the time point t _i (NO in step S303), the CPU 111 determines whether or not the time point t _i is the current time point (start time point 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 processing target time point t _i 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 the time point t _i (YES in step S303), the CPU 111 determines whether or not the departure ports of a plurality of ships overlap at the time point t _i (step S304). When the departure ports of a plurality of ships overlap 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 processing of step S305, CPU 111 compares the free space at time _{t i-1} of the plurality of vessels are overlapped departure time, to change the departure time of the free space is smaller ship time _{t i-1.} Here, the empty capacity is a value obtained by subtracting the actual load capacity at the time point ti _-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 ti _-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 having the smallest free capacity at the time ti _-1 and changes the departure times of the other ships. In addition, when the empty capacity at the time point ti _-1 is the same among a plurality of ships, the departure time point of either one of the ships is changed.

FIG. 8 is a schematic diagram for explaining the change of departure and arrival schedule when the departures of a plurality of ships overlap. In FIG. 8, the mark ○ indicates that the ship is stopped at the port. In the example shown in FIG. 8, the ship of the shipping destination A is in the port at the time (date) “January 20” to “January 25”, and the time (date) “January 23” to “January 23”. On January 25th, the ship with ship-to party B is stopped at the port. That is, the last stop time of both ships A and B is “January 25”, and this “January 25” is the time of departure. Further, in this example, it is assumed that the sizes of both the shipping destinations A and B are “large”. In other words, the constraint conditions are violated on "January 25th" and the departure ports of the ships of the shipping destinations A and B overlap, so the departure time of one of these ships is changed.

Here, it is assumed that the actual loading capacity of the ship of the shipping destination A on “January 24th” is “800”, and the maximum loading 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 24th" is "200", and the maximum loading capacity of this ship is "600". In this case, the shipping capacity of the ship of the shipping destination A is "200", and the empty capacity of the ship of the shipping destination B is "400". Therefore, the departure time of the ship of the shipping destination A having a small free space is changed from "January 25" to "January 24". This makes it possible to modify shipping plans so that the departure times do 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 if the violation proceeds, the processing proceeds. Will be resolved. The resolution of this violation will be described later.

As described above, by allowing the ship of the shipping destination A with a small free space to leave the port first, the cargo room of the ship of the shipping destination B with a large free space can be used as a warehouse, and the load on the warehouse can be reduced. Further, if the departure time of the ship of the shipping destination B is changed to "January 24", the free capacity at the departure time of the ship becomes "400", and the departure time of the ship of the shipping destination A is "January 24". The free capacity increases compared to the free capacity “200” of the ship in the case of changing to. In other words, by causing the ship of the shipping destination A having a small free space to leave the port first, an increase in the free space of the ship at the time of departure can be suppressed.

After finishing the process of step S305, the CPU 111 shifts the process to step S307.

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

In the process of step S306, when three or more ships are in the port at the time t _i , the CPU 111 confirms the size of each ship and at the time t _i so as not to violate the constraint condition at the time t _i . Change the entry time of one or more of the ships at the port. Here, of the plurality of ships stopped at the port at time t _i , the time of arrival of the last ship leaving the port may be changed after the time of departure of the other ship, or 2 or more of which is the latest The point of entry of a ship may be changed after the point of departure of another ship.

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

As described above, by changing the arrival time of the late departure ship after the departure time of the early departure ship, the stop time of the early departure ship is not shortened and the free capacity at the departure time of the early departure ship does not change. On the other hand, with respect to late departure vessels, the free capacity at the time of departure does not change because the time of arrival is not changed at the time of departure. Therefore, it is possible to prevent the vacant capacity from increasing in the starter ship and the latter ship.

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

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

By the above shipping plan modification processing, the shipping plan is modified so as not to violate the constraint conditions regarding the docking of the ship.

Next, the CPU 111 executes a shipping plan re-correction process for re-correcting the corrected shipping plan (step S104). In the shipping plan modified by the shipping plan modification process, if there is a point in time when the departure of multiple ships overlaps, going back from the final point of the planning period, the departure time of the ship with the smallest free capacity among those ships Changed to the previous time point. Therefore, at the start of the planning period, that is, when the departures of a plurality of ships overlap at the current time point, there is no time point before that time point, so the violation of the constraint conditions cannot be resolved. The shipping plan re-correction process is a process for eliminating the violation of the constraint condition that remains even after 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 due to the shipping plan correction process.

The details of the shipping plan re-correction 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 processing target time point t _i to the current time point (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 the time point t _i (NO in step S402), the CPU 111 determines whether or not the time point t _i is the final point 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 processing target time point t _i to the next time point (step S408), and moves the process to step S402. Thus, as a result of the shipping plan correction processing, if no constraint condition remains in the shipping plan, the shipping plan is not re-corrected.

On the other hand, when the constraint condition is violated at the time point t _i (YES in step S402), the CPU 111 determines whether or not the departure ports of a plurality of ships overlap at the time point t _i (step S403). In the case of the constraint violation, a plurality of ships violating the constraint stay at the port at time t _i . Violations of such constraint conditions include a case where a plurality of ships depart at the time t _i (hereinafter, referred to as “departure duplication”) and a plurality of ships stay at the port at a time t _i . Some time points do not overlap (hereinafter referred to as "duplication overlap"). In step S403, it is determined whether or not the departure violation is included in the constraint violation. That is, when it is determined in step S403 that the departure departure overlap is not included, the constraint condition violation is the stopover overlap.

If it contains depart duplicate constraint violation at time t _i (YES in step S403), CPU 111 may point the port entry point and departure time of some of the ship of the ship sailing overlap (and out port time) Change to t _i+1 (step S404).

In the process of step S404, the departure/arrival schedule is corrected so that the increase in the load (stock amount) of the warehouse is minimized in the future (t _i+1 ). Specifically, CPU 111 compares the actual load weight at the time t _i of a plurality of vessels are overlapped departure time, the actual loading capacity is to change the input departure time of a minimum of ship time t _{i + 1.} Thus, the load of the warehouse at only the time t _{i + 1} actual load of the ship and out port when is changed increases, but the actual payload of the ship, all ship are overlapped depart at time t _i the real Since the load is the smallest, the increase in the load on the warehouse 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 port departure times of three or more ships overlap, the CPU 111 changes the port entry/departure times of the ships with the smallest actual load at time t _i, and does not change the port entry/departure times of other ships. In addition, when the actual load capacity at the time point t _i is the same among a plurality of ships and is the same, the time point at which the ship having the larger shippable inventory amount at the next time point t _i+1 enters or leaves the port is changed.

11A to 11C are schematic diagrams for explaining an example of changing the departure/arrival schedule in the shipping plan re-correction processing. In FIGS. 11A to 11C, each number indicates the actual load capacity of the ship. In addition, the bold line frame indicates that the ship stops at the port. In other words, in the example shown in FIG. 11A, ships of shipping destinations A, C, and G will enter and depart on "August 18", and ships of shipping destinations B and E will enter and depart on "August 19". 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 ports of shipping destinations A, C, and G overlap at “August 18”, which violates the constraint condition. Therefore, of these, the time of arrival and departure of the ship of the shipping destination G having the smallest actual load is changed to "August 19". As a result, the violation of the constraint condition on “August 18” is resolved.

When the shipping destination G's arrival/departure time is changed as described above, the state shown in FIG. 11B is obtained. In FIG. 11B, at “August 19th”, the arrival and departure ports of ships B, E, and G overlap, which violates the constraint condition. Therefore, 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 of the shipping destinations E and G is smaller than the actual loading capacity of the shipping destination B, but is 400. Therefore, in this case, for each of the ships of the shipping destinations E and G, the available stock quantity of shipment on “August 20” when the port entry/departure time is changed to “August 20” is compared. When the arrival/departure time 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 ship arrival/departure time of the ship of the shipping destination G is changed to “August 20”, the available stock quantity of the shipping destination G on the “August 20” is “500”. Therefore, the time of arrival/departure of the ship of the ship-to party G having a large shipmentable inventory amount on “August 20” is changed to “August 20” (see FIG. 11C). As a result, the violation of the constraint condition on “August 19” is resolved. In addition, the constraint condition is satisfied even on “August 20”.

Referring back to FIG. In step S403, when the departures of a plurality of ships do not overlap at time t _i , that is, when the violation of constraints does not include overlapping departures (NO in step S403), a plurality of ships with different departure times stop at the port. It is in the state of doing. In this case, the CPU 111 changes the entry time of some of these ships to time t _i+1 (step S405). Specifically, CPU 111 compares the actual load weight at the time t _i of a plurality of vessels are staying in the harbor at the same time, the actual loading capacity is to change the Arrivals point of minimum of the ship at time t _{i + 1.} Here, when the departure time of the target ship whose port entry time is changed is the time point t _i , the departure time point is also changed to the time point t _i+1 together with the port entry time point. After the processing of step S405, the CPU 111 shifts the processing to step S407.

12A to 12C are schematic diagrams for explaining another example of changing the departure/arrival schedule in the shipping plan re-correction process. In the example shown in FIG. 12A, ships of shipping destinations A, C, and G are scheduled to enter and leave at “August 18”, and ships of shipping destination B are scheduled to enter and leave at “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 ships of shipping destinations A, C, and G overlap at “August 18”, which violates the constraint condition. Therefore, by the process of step S404, the time of arrival and departure of the ship of the shipping destination G having the smallest actual load is changed to "August 19". As a result, the violation of the constraint condition on “August 18” is resolved.

When the shipping destination G's arrival/departure time is changed as described above, the state shown in FIG. 12B is obtained. In FIG. 12B, the shipping destinations B, E, and G have overlapping port arrivals at “August 19”, but at the time of departure, shipping destinations B and G (“August 19”) and shipping destination E ( "August 20th"). Therefore, the CPU 111 changes the port entry time of the ship of the shipping destination E having the smallest actual load at the processing target time point "August 19th" to "August 20th" by the processing of step S405 (see FIG. 12C). .. As a result, the violation of the constraint condition on “August 19” is resolved. In addition, the constraint condition is satisfied even on “August 20”.

Referring back to FIG. By performing the processing of step S404 described above, the departure departure overlap of a plurality of ships is resolved. However, the violation of the constraint condition at the time point t _i may include both the overlapping departure port and the overlapping stop port. In such a case, even if the overlapping departure port at the time point t _i is eliminated, the overlapping stop port is not resolved. As a result, the violation of the constraint condition may not be resolved. Therefore, after the processing of step S404, the CPU 111 determines whether or not the constraint condition violation at time point t _i has been resolved, that is, whether or not there is an overlap of stays (step S406). If there is a duplicated stay (YES in step S406), the CPU 111 shifts the processing to step S405. This eliminates the duplicated stay.

When there is no overlapping retention at step S406 (NO at step S406), the CPU 111 shifts the processing to step S407. In step S407, when the time point t _i is the final point of the planning period (YES in step S407), CPU 111 ends the shipping plan re-correction process, and returns the process to the main routine of the shipping plan planning process. By executing the above shipping plan re-correction processing, the constraint condition violation remaining in the shipping plan correction processing can be resolved. In addition, by changing the departure and arrival schedule of ships that have a small actual loading capacity among ships that violate the constraint conditions, we will suppress the increase in warehouse load as much as possible, reduce the empty capacity of the ship, and satisfy the constraint conditions as well. It can be a shipping plan.

The shipping planning process will be described with reference to FIG. 2 again. After the shipping plan re-correction processing, the CPU 111 generates a shipmentable inventory quantity of the product for each time point based on the obtained shipping plan (step S105).

Next, the CPU 111 generates the total inventory quantity of the warehouse for each time point (step S106). In this process, the total inventory quantity in the warehouse is generated by adding the shipmentable inventory quantity and the unshippable inventory quantity at each time point.

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

Further, as shown in FIG. 14, the shipmentable inventory amount for each time point is output. The user can draw up or modify the production plan of the product by referring to the shipmentable inventory amount. In addition, there are cases where 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 modified.

Further, as shown in FIG. 15, the total inventory amount of the warehouse for each time point is output in a graph format. The vertical axis of the graph shows the accommodation rate of the warehouse, and the horizontal axis shows the time point. In this way, by outputting the total stock amount of the warehouse in chronological order, the user can confirm the transition of the total stock amount. In addition, if there is a point when the accommodation rate of the warehouse exceeds 100%, the product cannot be accommodated 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 available shipment inventory quantity, and the total inventory 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, available-for-shipment stock amount, and total stock amount, and determines whether or not there is a problem with the shipping plan. If there is a problem, the user manually corrects the shipping plan. When the correction is performed, the user gives the shipping plan planning apparatus 1 an instruction to execute the shipping plan correction process again. In this case, the user instructs the shipping plan planning apparatus 1 to modify the shipping plan by designating the 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 an instruction to end the shipping planning process to the shipping planning device 1.

The CPU 111 determines whether an instruction to modify the shipping plan or an instruction to end the shipping planning process has been received from the user (step S108). When the instruction to modify the shipping plan is received ("instruction to modify shipping plan" in step S108), the CPU 111 shifts the processing to step S103, and executes the shipping plan modification process for the designated shipping plan.

On the other hand, when the instruction to end the shipping planning process is received from the user ("end instruction" in step S108), the CPU 111 ends the shipping planning process.

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

(Other embodiments)
In the above-described embodiment, the configuration for planning the shipping plan by ship has been described, but the present invention is not limited to this. It may be a transport plane other than a ship, for example, one that formulates a shipping plan by a lorry, railroad, or aircraft.

Further, in the above-described embodiment, the configuration for planning the shipping plan of the product has been described, but the present invention is not limited to this. The “shipment target product” may be a semi-finished product at an intermediate stage of manufacturing, instead of a product that has been manufactured. A semi-finished product that has been processed halfway through the manufacturing process at one factory may be temporarily stored in a warehouse and then transported to another factory, where the remaining manufacturing process is carried out at the other factory to complete the product. .. In such cases, it is useful to make a shipping plan for semi-finished products.

Further, in the above-described embodiment, the configuration has been described in which, in the shipping plan correction process, the shipping plan generated in the initial shipping plan generation process is corrected so as not to violate the constraint condition, and the corrected shipping plan is output. However, it is not limited to this. You may output the produced|generated shipping plan, without considering a constraint condition. Even in this case, the obtained shipping plan is useful because the load situation of the warehouse is taken into consideration.

Further, in the above-described embodiment, the shippable inventory amount at the time point t _i is compared with the minimum load amount, and if the shippable inventory amount is equal to or more than the minimum load amount, the ship arrives at the time point t _i. However, the present invention is not limited to this. The comparison target of the shipmentable inventory amount may be other than the minimum loading amount as long as it is the amount of products loaded on the ship. For example, the shippable inventory amount may be compared with the maximum load amount, and the time point at which the shippable inventory amount reaches the maximum load amount may be set as the port entry time of the ship. In this way, by using the shippable inventory amount and the amount of products loaded on the ship, it is possible to determine the arrival time point according to the shippable inventory amount. However, for example, the time when the shippable inventory amount reaches the maximum load amount less than the predetermined load amount is set as the arrival time of the ship, and the arrival time is determined before the shippable inventory amount reaches the maximum load amount. Preferably. As a result, the ship can enter the port before the time when the maximum load of products can be loaded on the ship, and the ship can be held for a long period. Therefore, it is possible to reduce the load on the warehouse by using the stopped ship as a part of the warehouse.

Further, the shipping inventory amount at the time t _i, may not be compared to the amount of product loaded on the ship. For example, the time when the shippable inventory amount is other than 0 may be the time when the ship enters the port. The available inventory quantity is information that reflects the load status of the warehouse. Therefore, also in this case, it is possible to make a shipping plan in consideration of the load condition of the warehouse.

Further, in the above-described embodiment, when the constraint conditions are violated, it is determined whether or not the departure times of a plurality of ships overlap, and the different processing is executed depending on the determination result. , But is not limited to this. If the constraint conditions are violated, regardless of whether the departure times of multiple ships overlap, at the same time, at least one of the multiple ships staying at the port at the same time is detained by the same process. Alternatively, the time of departure may be changed. For example, when the constraint conditions are violated, some ships may be randomly selected, and the time of entry or departure of the selected ships may be changed. The free capacities may be compared and the departure time of a ship with a small free capacity may be advanced.

Further, in the above-described embodiment, in the shipping plan correction process, when the constraint conditions are violated and the departure times of a plurality of ships do not overlap, the number of ships that are stopped at the port at the same time is Among them, the configuration in which the departure time of the late departure ship is changed after the departure time of the early departure ship has been described, but the invention is not limited to this. The departure time of the starting ship may be changed before the departure time of the latter ship.

Further, in the above-described embodiment, when the constraint conditions are violated in the shipping plan correction process and the departure times of a plurality of ships overlap, the departure time of a ship with a small free capacity is The configuration to be changed before the departure of a large-capacity ship has been described, but the present invention is not limited to this. The departure and arrival schedule of ships may be changed so that the departure time of a ship with a small free space is later than the departure time of a ship with a large free space. In this case, the departure time of a ship with a large free capacity may not be changed, but the departure time of a ship with a small 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. The departure time of a ship with a large free capacity may be changed before the departure time of a ship with a small free capacity without changing the time.

Further, it is also possible that the departure time of a ship with a small free capacity is not changed and the departure time of a ship with a large free capacity is changed after the departure time of a ship with 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 the time t _i has not been resolved. Therefore, in order to eliminate the violation of the constraint condition at the time point t _i, it is necessary to separately change the departure and arrival schedule.

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

Further, in the embodiment described above, in the shipping plan re-correction process, when the departure times of a plurality of ships overlap, the departure and arrival of a ship with a small actual load capacity among the ships whose departure times overlap. Although it has been described that the time is delayed, the present invention is not limited to this. Even if the departure times do not overlap, if the constraint conditions are violated, the entry and departure times of the ships with a small actual load among the multiple ships staying at the port at the same time are changed after the departure times of other ships It may be configured to.

INDUSTRIAL APPLICABILITY The shipping schedule planning apparatus and shipping schedule planning method of the present invention are useful as a shipping schedule planning apparatus and method for planning a shipping schedule of products or semi-finished products by transportation machines such as ships and trucks.

DESCRIPTION OF SYMBOLS 1 Shipment planning device 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 (11)

A shipping plan planning device for preparing a shipping plan that defines an arrival time at which a transporting machine for shipping arrives at a loading place for loading an item to be shipped stored in a warehouse, and a departure time at which the shipping machine departs from the loading place. ,
A specifying unit that specifies the inventory amount of each of the shipping target products that can be shipped in the warehouse and the loading amount of the shipping target products that are loaded on the transport machine at a certain time point ,
The inventory amount specified by the specifying unit, a determination unit that determines a time point before reaching the upper limit value of the amount of the shipping target product loaded on the transport machine, as the arrival time point,
The time point, which is specified by the specifying means, is the upper limit value of the amount of the shipping target product loaded on the transport machine after the arrival time, A second determining means for determining the departure time;
And a generating unit that generates a shipping plan based on the arrival time and the departure time determined by the determining unit and the second determining unit, respectively . Determination means for determining whether or not the shipping plan generated by the generation means violates a constraint condition regarding the number of the transport aircraft to be simultaneously stopped at the loading place;
Change means for changing the arrival time point or the departure time point of at least one of the plurality of transportation machines to be simultaneously stopped at the loading place when the determination means determines that the constraint condition is violated. And further,
The shipment planning apparatus according to claim 1 . The changing means is configured to change the arrival time of a later-departing transport aircraft that departs later from among the plurality of transportation aircraft after the departure time of a first-departure transportation aircraft that departs first.
The shipment planning apparatus according to claim 2 . The changing unit may include a plurality of transportation machines based on an upper limit of an amount of products to be shipped loaded on the transportation machine and an empty capacity of the transportation machine based on a loading amount of products to be shipped on the transportation machine. Is configured to change the arrival time or the departure time of at least one of the transport aircraft,
The shipment planning apparatus according to claim 2 . Among the plurality of transportation machines, the changing means sets the departure time of the at least one transportation machine such that the departure time of the transportation machine having the small free space is earlier than the departure time of the transportation machine having the large empty space. Is configured to change,
The shipping planning apparatus according to claim 4 . The changing unit is configured to change the arrival time point or the departure time point of at least one of the plurality of transportation machines based on a load amount of the item to be shipped in the transportation machine.
The shipment planning apparatus according to claim 2 . Among the plurality of transportation machines, the changing unit arrives at the at least one transportation machine such that the arrival time of the transportation machine having the small loading capacity is later than the departure time of the transportation machine having the large loading capacity. Configured to change the time point,
The shipping planning apparatus according to claim 6 . Further comprising 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.
The shipping planning apparatus according to any one of claims 2 to 7 . A shippable inventory quantity generation means for generating a stock quantity of a product to be shipped in a warehouse at each of a plurality of time points based on a shipping plan in which the arrival time point or the departure time point of the transportation machine is changed by the changing means. Further equipped with,
The output means is configured to further output the inventory quantity of the shipment-possible products generated by the shipment possible inventory quantity generation means.
The shipping planning apparatus according to claim 8 . Further comprising a total inventory quantity generation means for generating a total inventory quantity of the warehouse for each of a plurality of time points based on the shipping plan in which the arrival time point or the departure time point of the transportation machine is changed by the changing means,
The output unit is configured to further output the total inventory amount generated by the total inventory amount generation unit.
Shipment planning apparatus according to claim 8 or 9, wherein. A shipping plan drafting method for preparing a shipping plan that defines an arrival time at which a transporting machine for shipping arrives at a loading place for loading an item to be shipped stored in a warehouse and a departure time at which the transporting machine departs from the loading place. ,
A step in which the computer specifies the inventory amount of each of the shipping target products that can be shipped in the warehouse and the loading amount of the shipping target products loaded on the transport machine at a certain time point ;
The computer determines the time point before the identified inventory amount reaches the upper limit value of the amount of the shipping target item loaded on the transportation machine as the arrival time point,
The computer determines the specified time point when the load amount of the shipping target product loaded on the transport machine after the arrival time is the upper limit value of the shipping target product load on the transport machine. The step of determining the departure time,
The computer generates a shipping plan based on the determined arrival time and departure time .

Images