JPH08101864A - Dispatch plan forming system - Google Patents

Abstract

PURPOSE: To provide the dispatch plan forming system which automatically schedules the time of forwarding from a factory to each store. CONSTITUTION: This system is equipped with a 1st processing means 10 which calculates the temporary forwarding time to each store from the store arrival tie that the store requires and the required time of transportation between the factor and store and sorts the time in time order and a 2nd processing means 11 which selects stores as processing objects in the order of the temporary forwarding time, and calculates production end time in case of production in a specified production line and sorts the time in time order while specifying the fastest production line for the number of articles that the store, the processing object, requires by using the production informaition on the articles produced by the use of production lines of the factory; and the shipment time corresponding to the processing result of the 2nd processing means 11 is outputted as a scheduling result.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a shipping planning system for automatically scheduling the shipping time from a factory to each store.

In sending newspapers to newspaper stores, it is required that the required number of copies be delivered from the printing factory to each store by the required arrival time. In addition, even in the grocery shipment to a convenience store, it is required that the required number of products be delivered to each store from the production factory by the required arrival time.

In order to meet such a shipping request, it is necessary to construct a shipping planning system which can automatically schedule the shipping time from the factory to each store.

[0004]

2. Description of the Related Art Conventionally, a method of manually scheduling the shipping time from the factory to each store has been adopted.

[0005] In other words, in the case of sending newspapers as an example, a specialized worker calculates time series data of the newspaper production amount from the print start time and the rotary press speed, and the time series data of the newspaper production amount is calculated. Based on the required time from the factory to each retailer, the number of copies and the arrival time required by each retailer, it is possible to decide what kind of retailer, in what order, at what shipping time. It was a method of scheduling with work.

[0006]

However, according to such a manual work, it is necessary to prepare a newspaper delivery plan once.
A short one takes a week, and a long one takes a month.

However, in shipping newspapers, when emergency news occurs, it is necessary to delay the print start time, increase the number of copies, or increase the number of editions. In such a case, if the conventional technique is followed, it is not possible to know, on the spot, how late the print start time can be, or which store can print the new version. , There was a problem that we could not tell the reader the latest news.

When roads become congested due to bad weather such as typhoons and snow, it is necessary to increase the number of trucks and deliver them individually. There was also a problem in that it was not possible to know how much to increase.

That is, if the method of manually scheduling the shipping time from the factory to each store as in the prior art is adopted, when the situation changes,
There was a problem that it could not be dealt with.

The present invention has been made in view of the above circumstances, and an object of the present invention is to provide a new shipping planning system for automatically scheduling the shipping time from a factory to each store.

[0011]

FIG. 1 shows the principle configuration of the present invention. In the figure, reference numeral 1 denotes a shipping planning system configured according to the present invention, which includes production information of products for sale on each production line at a factory, arrival time required by each store and the number of items for sale, and a factory. When the required time between each store and each store is given, the shipping time of the product for sale to each store is scheduled.

In order to implement the present invention, this dispatch planning system 1 includes a first processing means 10, a second processing means 11, a third processing means 12, a scheduling output means 13 and a detection means. Means 14 and.

The first processing means 10 calculates a temporary shipping time to each store from the store arrival time required by each store and the time required between the factory and each store. The second processing means 11 calculates the production completion time when the product for sale of each store is produced on the production line while specifying the production line. The third processing means 12 calculates the production completion time when the products sold by each store are manufactured on all the production lines.

The scheduling output means 13 outputs the scheduled shipping time to each store. The detection unit 14 determines whether or not there is a store to which a scheduled shipping time that is not in time for the arrival at the store is assigned based on the scheduled shipping time to each retailer and the time required between the factory and each retailer. To detect.

[0015]

In the present invention, the first processing means 10 determines the provisional shipping time to each store based on the arrival time required by each store and the time required between the factory and each store. Calculate and sort by time.

When the processing of the first processing means 10 is completed,
The second processing means 11 selects the dealer as the processing target in the sorted temporary shipping time order, uses the production information, and produces the fastest quantity to produce the number of products to be sold required by the processing target dealer. While specifying the line, the production completion time in the case of producing on the production line is calculated and sorted in time order.

Then, the scheduling output means 13
Outputs the shipping time defined from the production completion time calculated by the second processing means 11 as the scheduled shipping time to each store. At this time, when the detection unit 14 detects the existence of a store to which the scheduled shipping time which is not in time for the arrival of the store is assigned, the output color is explicitly output, for example, by changing the display color of the store.

The scheduling shipping time thus determined is derived by determining the production line for each store. For example, when sending newspapers, the newspapers are being changed to print the latest news at nearby stores.In such a case, a printing press is selected for each store. Then, at the time when the printing for a certain store is completed, it is preferable to stop the rotary press that was performing the printing for the plate update. From this, it can be said that this method of determining the production line for each store and obtaining the scheduled shipping time is suitable for such a case.

However, in this method, since the production line is determined for each store, there is a problem in that it may be possible to ship earlier by using all rotary presses in terms of each store.

Therefore, the third processing means 12 selects a store as a processing target in the order of the production completion time sorted by the second processing means 11 and uses the production information to determine the store to be processed. The production completion time when the number of products to be sold is produced on all production lines is calculated, and the scheduling output means 13 outputs the shipping time defined from the production completion time as the scheduled shipping time to each store. .

As described above, according to the present invention, the production information of the product for sale on each production line in the factory, the arrival time and the quantity of the product required by each shop, the factory and the shop Therefore, it becomes possible to provide a shipping planning system capable of automatically scheduling the shipping time of an item to be sold to each store when the required time between the items is given.

[0022]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention will be described in detail below with reference to an embodiment applied to a scheduling process for sending newspapers.

FIG. 2 shows a system configuration of a data processing system for implementing the present invention. In the figure, 20 is a data processing device composed of a computer, and 30 is a data processing device 2.
0 is a large storage device, 40 is a terminal included in the data processing device 20, 41 is a printer included in the data processing device 20, and 42 is an output file included in the data processing device 20.

The data processing device 20 executes a newspaper shipping scheduling operation to create and output a printing schedule of a newspaper printing press and a shipping schedule to a newspaper shop. The data editing unit 22 for changing the shipping schedule / printing schedule created by the computing unit 21 while interacting with the computing unit 21, the terminal 40, the print schedule table 23 prepared as a work file for the printing schedule, and the shipping schedule. And a shipping schedule table 24 prepared as a work file of.

FIG. 3 shows the data structure of the print schedule table 23, and FIG. 4 shows the data structure of the shipping schedule table 24. That is, the print schedule table 23 has as entries the factory name, the rotary press name, the print start time, the print end time, the number of prints, and the speed per minute (the number of prints per minute).
The item 4 has the name of the store, the number of copies, the arrival time of the store, and the departure time of the factory as entries.

On the other hand, the large storage device 30 is provided with a print information file 31 for managing the start time of newspaper printing, the printing capability of each rotary press provided in the newspaper printing factory, and the print start time (print information file 31 is provided. ) And a factory information file 32, a copy number information file 33 that manages the number of copies sent to each store, a course information file 34 that manages the arrival time of each store, a copy number information file 33, and course information. A shipping information file 35 that manages shipping information to each store created from the management data of the file 34
And a required time information file 36 for managing required time to each store.

That is, the factory information file 32 is shown in FIG.
As shown in, the minute speed (the number of printed sheets per minute) of each rotary press provided in the newspaper printing factory and the print start time are managed. Further, as shown in FIG. 6, the shipping information file 35 manages the number of copies shipped to each store and the arrival time of each store. The required time information file 36 is shown in FIG.
As shown in, the time required for each store is managed in consideration of the times of morning and evening editions, traffic congestion, etc.

FIG. 8 shows the arithmetic unit 21 of the data processing device 20.
An example of the program structure expanded by FIG. As shown in this figure, the calculation unit 21 creates and outputs a print schedule of a newspaper printing press, and also creates and outputs a shipping schedule to a newspaper shop.
Temporary departure time calculation program 210, rotary press distribution calculation program 211, departure time correction calculation program 212
And a schedule result output program 213.

FIG. 9 shows a temporary departure time calculation program 210.
10 is an example of the process flow of the rotary press distribution calculation program 211, FIG. 11 is an example of the process flow of the departure time correction calculation program 212, and FIG. Result output program 213
An example of the processing flow of FIG.

Next, according to these processing flows, the newspaper shipping scheduling processing realized by the present invention will be described in detail. Temporary departure time calculation program 21
When a scheduling process request for newspaper shipment is issued, first, as shown in the process flow of FIG. 9, first, in step 1, it is judged whether or not the processes for all the stores are completed, When it is determined that the processing has not been completed, the process proceeds to step 2, and one unprocessed store information (store name, number of copies shipped, arrival time) is taken out from the shipping information file 35, and in the following step 3, From the required time information file 36, the required time to the extracted store is taken out.

Then, in step 4, the temporary factory departure time is obtained by calculating the difference time between the arrival time at the store retrieved in step 2 and the required time retrieved in step 3.
That is, if the newspaper printing factory departs by this time, the temporary factory departure time is found to be in time for the arrival at the shop. Then, in step 5, the store name, the number of copies, and the arrival time of the store retrieved in step 2 are registered in the corresponding entry of the shipping schedule table 24, and the entry of the factory departure time in the shipping schedule table 24 is entered in step 4 After registering the temporary factory departure time calculated in step 1, the process returns to step 1.

Then, when it is detected in step 1 that the processing for all the stores registered in the shipping information file 35 has been completed, the process proceeds to step 6 and the entry data of the shipping schedule table 24 is sorted in the order of the time when the temporary factory starts. Then, the process ends.

In this way, the temporary departure time calculation program 210, when the required time in the management data of the required time information file 36 shown in FIG. 7 becomes valid, the required time and the shipping information shown in FIG. The temporary factory departure time is calculated from the management data of the file 35 as shown on the left side of FIG. 13, and the temporary factory departure time is sorted in the order of the temporary factory departure time. The registered shipping schedule table 24 is created.

The rotary press distribution calculation program 211 enters the process when the process of the temporary departure time calculation program 210 is completed, and as shown in the process flow of FIG. 10, first, in step 1, the factory information file 32 is entered. Management data (print start time of each rotary press equipped in the newspaper printing factory,
The minute speed X) is read and these are registered in the corresponding entry of the print schedule table 23.
Subsequently, in step 2, it is determined whether or not the processing has been completed for all the stores, and when it is determined that the processing has not been completed, the process proceeds to step 3 and is created by the temporary departure time calculation program 210. From the dispatch schedule table 24, one unprocessed store is taken out in the order of the provisional factory departure time, and the number of dispatches Y is specified.

Subsequently, in step 4, the registered value Z (the initial value is "0") of the number of prints of each rotary press is read from the print schedule table 23, and the number of prints = Z + Y print end time for each rotary press. = Printing start time + (Z + Y) / X is calculated. Subsequently, in step 5, the earliest of the calculated printing end times is specified, and the temporary factory departure time indicated by the store taken out in step 3 registered in the shipping schedule table 24 is specified in the specified printing. Change to the end time. Subsequently, in step 6, the specified print end time and the calculated number of print copies corresponding thereto are registered in the corresponding rotary press entry of the print schedule table 23, and then the process returns to step 2.

Then, in step 2, when the end of processing for all the stores registered in the shipping schedule table 24 is detected, the process proceeds to step 7 and the entry data of the shipping schedule table 24 is sorted in the order of the time of departure from the factory. Ends the process.

In this manner, the rotary press distribution calculation program 211 creates the dispatch schedule table 24 (the temporary factory departure time is registered) shown on the right side of FIG. 13 by the temporary departure time calculation program 210. The shipping schedule table 24 and the management data of the factory information file 32 shown in FIG. 5 are used to create the printing schedule table 23 while updating the entry data as shown in FIGS. 14 and 15. As shown on the left side of FIG. 16, the factory departure time (corresponding to the print end time) for each store is calculated, and this is sorted in the order of the factory departure time, so that the shipping schedule table 24 as shown on the right side of FIG. To create.

The factory departure time registered in the shipping schedule table 24 is derived by deciding a rotary press to print at each newspaper shop. The departure time correction calculation program 212 enters the processing when the processing of the rotary press distribution calculation program 211 ends, and as shown in the processing flow of FIG. 11, first, in step 1, from the factory information file 32, the rotary press Time-series data of the total minute speed value x is obtained. Subsequently, in step 2, it is determined whether or not the processing has been completed for all the dealers, and when it is determined that the processing has not been completed, the process proceeds to step 3 and the rotary press distribution calculation program 211 is used. From the created shipping schedule table 24, one unprocessed store is taken out in the order of the factory departure time, the number of shipped copies is specified, and the total value y of the specified number of shipped copies is obtained using this.

Next, in step 4, the printing end time is reached by calculating "y / x" while taking into consideration the change in the time-series data of the total speed value x of the rotary press obtained in step 1. The departure time is calculated, and accordingly, the factory departure time indicated by the store taken out in step 3 registered in the shipping schedule table 24 is changed to the calculated factory departure time, and then the process returns to step 2. Then, in step 2, when the end of processing for all the stores registered in the shipping schedule table 24 is detected, the processing is ended.

In this way, the departure time correction calculation program 212 is derived from the management data of the factory information file 32 when the delivery schedule table 24 shown on the right side of FIG. 16 is created by the rotary press distribution calculation program 211. 17 is registered in the created shipping schedule table 24 using the time-series data of the total speed value x of the rotary press shown in FIG. 17 (the print end time is registered in the print schedule table 23). Since the print end time when printing the number of copies sent from each store on the rotary press in order from the earliest start time of the factory is obtained, as shown in FIG. 18, the start time of the factory is changed to the print end time. is there.

That is, for example, the total value of the number of copies delivered to the L store is "8500", which is from "1:25" to "1:30".
The total speed per minute up to “800” and the total speed per minute after “1:30” are “1500”. : 30+ (8500-800 * 5) / 150
0 = 1: 33 ”is obtained, and the factory departure time“ 1:34 ”of the L dealer registered in the shipping schedule table 24 is changed to“ 1:33 ”.

Schedule result output program 213
Starts when the processing of the departure time correction calculation program 212 is completed, and as shown in the processing flow of FIG.
First, in step 1, the data content of the print schedule table 23 is output to the printer 41 or the like.

Next, in the output process of the data contents of the shipping schedule table 24, it is judged in step 2 whether or not the processes for all the dealers are completed, and it is judged that the process is not completed. Occasionally, the process proceeds to step 3, and one unprocessed store is taken out from the shipping schedule table 24 whose factory departure time is corrected by the departure time correction calculation program 212 in the ascending order of the factory departure time. Specify the arrival time of the store.

Subsequently, in step 4, the required time to the store extracted in step 2 is extracted from the required time information file 36, and in step 5, the factory departure time specified in step 3 and the extracted time in step 4 are extracted. The arrival time at the store is calculated by calculating the addition time with the required time. In other words, the arrival time at the store when shipping at the factory departure time calculated by the departure time correction calculation program 212 is calculated.

Subsequently, in step 6, it is judged which of the store arrival time specified in step 3 and the store arrival time calculated in step 5 is earlier, and the store arrival time calculated in step 5 is determined. When it is judged that the delivery is later, that is, when it is judged that the delivery at the factory departure time calculated by the departure time correction calculation program 212 will not be in time for the store arrival time required by the store, the process proceeds to step 7. ,
After the display color of the data contents of the store registered in the shipping schedule table 24 is set to red for the alarm display, the process returns to step 2. On the other hand, when it is determined in step 6 that the store arrival time calculated in step 5 is earlier, that is, the store required by the store even if it is shipped at the factory departure time determined by the departure time correction calculation program 212. When it is determined that the arrival time will be reached, the process returns to step 2 while the display color of the data content of the store registered in the shipping schedule table 24 is set to the normal color.

Then, in step 2, when the end of processing for all the stores registered in the shipping schedule table 24 is detected, the process proceeds to step 8 and the printer 41 is set according to the display color in which the data content of the shipping schedule table 24 is set. And so on, and the process ends.

This schedule result output program 21
By receiving the output result of No. 3, the user can know that there is a store that is too late for the arrival time.
In the future, when emergency news or the like occurs, the user may change the print start time or change the time required for the dealer to execute the simulation, thereby accelerating the print start time. , You will be able to take various measures such as increasing the number of trucks and dealing with them.

Although the illustrated embodiment has been described, the present invention is not limited to this. For example, in the embodiment,
Although the configuration for operating the departure time correction calculation program 212 is disclosed, the present invention is not limited to this, and a configuration in which the processing result of the rotary press distribution calculation program 211 is output is also possible.

The factory departure time calculated by the rotary press distribution calculation program 211 is derived by deciding the rotary press for each store. When sending newspapers, the newspaper editions are being changed to print the latest news at nearby stores.In such a case, select a rotary press for each store and print. It is effective to adopt this method because it is preferable to stop the rotary press that was executing the printing to update the plate when the printing for a certain store is completed. Is.

Further, although the present invention is disclosed in the embodiment in accordance with the embodiment applied to newspaper delivery, the present invention is not limited to this, and can be applied to other delivery systems as it is.

[0051]

As described above, according to the present invention,
When the production information of the products for each production line in the factory, the arrival time and the number of products required for each shop, and the time required between the factory and each shop are given, each sales It will be possible to provide a shipping planning system that can automatically schedule the shipping time of items for sale to a store.

From now on, while variously changing the production information, the arrival time of the store, the number of items to be sold, and the required time, it becomes possible to instantly know whether or not the store is in time, thereby changing the shipping plan. If there is a problem, you will be able to immediately know how to deal with it.

[Brief description of drawings]

FIG. 1 is a principle configuration diagram of the present invention.

FIG. 2 is a system configuration diagram of a data processing system implementing the present invention.

FIG. 3 is an explanatory diagram of a print schedule table.

FIG. 4 is an explanatory diagram of a shipping schedule table.

FIG. 5 is an explanatory diagram of a factory information file.

FIG. 6 is an explanatory diagram of a shipping information file.

FIG. 7 is an explanatory diagram of a required time information file.

FIG. 8 is an example of a program configuration of a calculation unit.

FIG. 9 is a processing flow of a temporary departure time calculation program.

FIG. 10 is a processing flow of a rotary press distribution calculation program.

FIG. 11 is a processing flow of a departure time correction calculation program.

FIG. 12 is a processing flow of a schedule result output program.

FIG. 13 is an explanatory diagram of processing of a temporary departure time calculation program.

FIG. 14 is an explanatory diagram of a process of a rotary press distribution calculation program.

FIG. 15 is an explanatory diagram of a process of a rotary press distribution calculation program.

FIG. 16 is an explanatory diagram of processing of a rotary press distribution calculation program.

FIG. 17 is an explanatory diagram of time series data of the total speed value of the rotary press.

FIG. 18 is an explanatory diagram of processing of a departure time correction calculation program.

[Explanation of symbols]

 1 Dispatch Planning System 10 First Processing Means 11 Second Processing Means 12 Third Processing Means 13 Scheduling Output Means 14 Detecting Means

Claims (3)

[Claims] 1. The production information of a product for sale on each production line in a factory, the arrival time and the number of products for sale required by each shop, and the time required between the factory and each shop are given. At this time, it is a shipping planning system that schedules the shipping time of products to be sold to each store, and calculates the temporary shipping time to each store from the above arrival time and the required time and sorts them in chronological order. The first processing means for performing the first processing means, and the fastest production line for producing a quantity of products for sale required by the store to be processed by selecting a store as the process target in the order of the temporary shipping time and using the production information. And a second processing means for calculating the production completion time when the product is produced on the production line. 2. The production information of the product for sale on each production line in the factory, the arrival time and the number of products required for each shop, and the time required between the factory and each shop are given. At this time, it is a shipping planning system that schedules the shipping time of products to be sold to each store, and calculates the temporary shipping time to each store from the above arrival time and the required time and sorts them in chronological order. The first processing means for performing the first processing means, and the fastest production line for producing a quantity of products for sale required by the store to be processed by selecting a store as the process target in the order of the temporary shipping time and using the production information. While selecting the second processing means for calculating the production completion time in the case of producing on the production line and sorting in time order, and selecting the dealer as the processing target in the order of the production completion time,
And a third processing means for calculating the production completion time when the number of products to be sold required by the shop to be processed is produced on all the production lines by using the above production information. Planning system. 3. The shipping planning system according to claim 1, wherein it is detected from the scheduled shipping time and the required time whether or not there is a store to which the scheduled shipping time that is not in time for the arrival at the store is assigned. A dispatch planning system characterized by having detection means.