JP2928308B2 - Processing schedule creation device - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION [Industrial Application Field] The present invention relates to a machining schedule creation device for creating a machining schedule when machining with an NC machine tool.

[Prior Art] Generally, when performing machining with an NC machine tool, a machining schedule is created. In creating a conventional machining schedule,
The operator has input the names of the processed parts, for example, BBB, CCC, etc. in order as shown in FIG. 8 in consideration of the material, jig, time, etc. for each processed part.

[Problems to be Solved by the Invention] In this case, even if the same machined parts are input, they must be input one by one, and furthermore, the operator needs to calculate the number of the machined parts and input them while considering the order. There was a problem that it was very troublesome.

Therefore, the present invention has been made in view of the above-described conventional problems, and has as its object to provide a machining schedule creation device that easily creates a machining schedule by inputting the number of jig repetitions and the total number of jigs. And

[Means for Solving the Problems] According to the present invention, a storage means storing a processing reservation table having a row corresponding to a type of a processing component and a column corresponding to a child schedule arranged in chronological order; Display means for displaying a reservation table; and a processing reservation table displayed by the display means, a jig repetition number, which is the number of jigs continuously usable for a predetermined type of processed part, and rows and columns of the table. Input means for inputting the total number of jigs, which is the required total number of jigs corresponding to the number of processed parts corresponding to the row in the child schedule corresponding to the column, at the intersection of In one column of the child schedule, processing is performed in a predetermined priority order by the number of processed parts corresponding to the number of jig repetitions input by the input means. After repeating the child schedule until the total number of used jigs reaches the above number of jigs for all processed parts,
And a calculating means for creating a processing schedule for performing processing in the same order after shifting to the next child schedule.

[Operation] In the present invention, the storage means stores a processing reservation table having rows corresponding to the types of processing parts and columns corresponding to the child schedules arranged in chronological order. By displaying, by the input means, the number of jig repetitions, which is the number of jigs that can be used continuously with respect to a predetermined type of processed part, in the processing reservation table, and the column at the intersection of the row and column of this table And the total number of jigs, which is the required total number of jigs corresponding to the number of processed parts corresponding to the line in the child schedule corresponding to the child schedule, is input. In the column, the number of processed parts corresponding to the number of jig repetitions input by the input means is to be processed in a predetermined priority order, and the total number of used jigs corresponding to the number of processed processed parts is all After repeating the child schedule until the number of jigs for the processed parts is reached, the process moves to the next child schedule, and a processing schedule is created in which processing is performed in the same order. A machining schedule is created simply by inputting the number of tools.

[Embodiment] An embodiment of a processing schedule creation device according to the present invention will be described below with reference to the drawings. FIG. 1 is an external perspective view of an embodiment of a processing schedule creation device according to the present invention.

In FIG. 1, the processing schedule creation device 1 has a CRT 2a as a display unit, a keyboard 3a as an input unit, and the like, which will be described later. FIG. 2 shows a block diagram thereof.

The storage means 4 is specifically a RAM. Further, depending on the device, a floppy disk may be used. The storage means 4 stores a processing reservation table as shown in FIG. 3 having rows corresponding to the types of processed parts and columns corresponding to the child schedules arranged in chronological order. Further, a message as shown in FIG. 4 and a processing schedule as shown in FIG. 5 may be stored.

The display means 2 is specifically a CRT 2a. The display means 2 displays a processing reservation table as shown in FIG. 3, a message as shown in FIG. 4, and a processing schedule as shown in FIG. 5, which are stored in the storage means 4. . In the machining reservation table shown in FIG. 3, the planned number 20 is the production planned number of each machined part, the complete number 21 is the machining completed quantity at the present stage, and the jig number 22 is the applicable number of the machined part. This is the usable number of jigs. This plan number 20,
The complete number 21 and the jig number 22 are input to the processing reservation table at an initial stage together with the processing part name. The child schedule divides the schedule into six parts in a temporal order so that the worker can start and finish which part of the day's schedule to start machining.

The input means 3 is specifically a keyboard 3a. The input means 3 includes a jig repetition number 23, which is the number of jigs that can be used continuously for a predetermined type of processed part in the processing reservation table shown in FIG. 3, and a position where a row and a column of this table intersect. In the sub-schedule corresponding to the column, the total number of jigs 24, which is the required total number of jigs corresponding to the number of processed parts corresponding to the row, is input. When a number exceeding the jig number 22 is input as the jig repetition number 23, a message as shown in FIG. 4 is displayed.
The column 25 of the processing order of the processing reservation table is a column for determining the processing priority of the processed component, and can be determined in advance for a row corresponding to the type of the processed component. The number of jigs is determined in the order of setting.

The calculation means 5 is specifically a microcomputer. The calculating means 5 performs processing in a predetermined priority order by the number of processing parts corresponding to the jig repetition number 23 input by the input means 3 in one column of the child schedule of the processing reservation schedule shown in FIG. After repeating the child schedule until the number of used jigs corresponding to the number of processed parts reaches the total number of jigs for all the processed parts, move to the next child schedule, and then repeat the same order Create a processing schedule to perform processing in. More specifically, in FIG. 3, first, in the child schedule 1, the AAA in the processing order 1 is processed into three since the number of repetitions 23 is 3, and then the BBB in the processing order 2 is processed into the number 1 by 23. Therefore, one DDD is processed, and then one DDD in the processing order 3 is processed because the number of repetitions 23 is 1. Then, the process returns to AAA, and three pieces are further processed. One BBB and one DDD are processed. Subsequently, the process returns to AAA, and since the total number of jigs is 7 and 6 pieces have already been machined, one piece is machined, and then one BBB is machined. D
DD is not processed because it has already processed two jigs. Proceeding to the next child schedule 2, processing order 3, 4,
The processing is repeated in the order of 5 until the total number of jigs is reached. Thereafter, a processing schedule shown in FIG. 5 that performs processing in the same order is created. In this specific example, the processing when one processing part is fixed to one jig has been described.
When two processing parts are fixed to the jig, the number of processing is twice the total number of jigs.

Next, the operation of creating a machining schedule by the machining schedule creating apparatus according to the present invention will be described with reference to the flowchart of FIG.

First, in step S1 (hereinafter referred to as S2, S3,...), It is confirmed that the processing reservation has been set. Next, the child schedule number x = 1 is set in S2. Then, in S3, the processing order number is set to n = 0. Next, in S4, the processing order number is set to n = n + 1. Then, the process proceeds to S9, and if the total number of jigs of the child schedule number x is not 0, the process proceeds to S6. In S6, it is determined whether or not the total number of jigs is set for the part having the processing order number n. Here, the total number of jigs is 0
If not, return to S4. If the total number of jigs for the n processed parts is not 0, the processed parts with the processing order number n are continuously allocated by the jig repetition number in S7. Then, the number of jig repetitions is subtracted from the number of jigs in S8 to obtain a new number of jigs. If the subtraction results in a negative value, it is set to 0.
Subsequently, the process returns to S4, and thereafter, S4, S9, S6, S7, S8, S4 until the assignment of the processing schedule of the child schedule x is completed.
And go around this loop. However, child schedule number x in S9
See if the total number of all jigs is 0 and if it is not 0, then S6
If it is 0 in S9, the process proceeds to S11. In S11, it is checked whether the child schedule number x = 6. If x = 6, x = x + 1 and x are updated in S12, and S13
To initialize the processing order number n to n = 0, and return to S4. Then, the above-described flow is repeated in the updated child schedule x. That is, the processing order number n = n + 1 is set in S4, the process goes through S9 and S6, and the total number of jigs of the processing part having the processing order number n is 0 in S6.
If so, the process returns to S4, and if the total number of jigs is not 0, the processing schedule is allocated by the number of jig repetitions in S7. Then, the number of new jigs is set in S8. This is repeated in the child schedule x. And child schedule x
When the sub-schedule number x = 6 in S11, the process ends. In FIG. 6, the processing is terminated when x = 6, but the numerical value can be changed. The processing order n extends over a plurality of pages, not 5 for one screen. In the embodiment, the maximum is 350.

Here, the flowchart of FIG.
This will be described with reference to the processing reservation table shown in FIG.

The setting of the processing reservation is completed (S1), and the child schedule number x = 1 and the processing order number n = 0 are initialized (S2, S3). Next, n = 1 and n = 1 (S4). Then go through S9,
In the case where n = 1 in S6, since the number of jigs for the processing component AAA is set to 7 in FIG. 3, the processing schedule is continuously assigned by the number of jig repetitions 3 in S7. Then, the number of jig repetitions 3 is subtracted from the number 7 of jigs in S8, and the number of new jigs 4 is obtained.
And Next, in the case of n = 2 in S4 and passing through S9, and n = 2 in S6, since the number of jigs in the BBB is set to 3 in FIG.
In step 7, a processing schedule is allocated for one jig repetition number. Then, the number 1 of jig repetitions is subtracted from the number 3 of jigs in S8 to obtain a new number 2 of jigs. Then, if n = 3 in S4 and the flow goes through S9, and n = 3 in S6, the number of jigs in the CCC is 0 in FIG. 3, so the flow returns to S4 and n = 4. Then, if n = 4 in S6 after passing through S9, since the total number of jigs in DDD is 2 in FIG. 3, the processing schedule is allocated by 1 jig repetition number in S7. Next, n = 5, and in the processing portion EEE, since this is the total number of jigs, 0, returning from S6 to S4, n = 6 and proceeding to S9. If the total number of jigs of all the processed parts is not 0 in S9, if n is larger than the processing order set in S10, return to n = 1 in S10 ', and repeat from S6 to S8, S4, S9 again. From AAA to EEE, if there is a total number of jigs, a processing schedule is assigned. Then, if the total number of jigs of all the processed parts of this child schedule becomes 0 in S9, the process proceeds to S11, and since x is not 6, x is set to 2 in S12. Enter the assignment and perform the same operation. Then, at S11, x =
It ends when it reaches 6. FIG. 5 shows the completed processing schedule.

Next, as another embodiment, a processing reservation schedule as shown in FIG. 7 can be considered. That is, the total number of jigs 24 and the priority order 25 are inputted at the positions where the columns of the child schedule and the rows of the work parts intersect. This priority 25
The order in the child schedule. Therefore, the priority can be changed for each child schedule. The calculation operation in this case is the same as the flowchart shown in FIG.

In the above embodiment, the processing reservation is described based on the total number of jigs. However, it is also possible to prepare a processing schedule based on the number of pallets for fixing the jig on the assumption that one jig and one jig are used. It is.

[Effects of the Invention] In the present invention, the display means displays the processing reservation table stored in the storage means, and the input means inputs the number of jig repetitions and the total number of jigs. Can be created.

[Brief description of the drawings]

FIG. 1 is an external perspective view of an embodiment of a machining schedule creation device according to the present invention, FIG. 2 is a block diagram of the embodiment, FIG. 3 is a machining reservation table diagram of the embodiment, FIG. Fig. 5 is a message diagram of the embodiment, Fig. 5 is a machining schedule diagram of the embodiment, Fig. 6 is a flowchart of the embodiment, Fig. 7 is a machining reservation table diagram of another embodiment, 8
The figure is a conventional processing schedule diagram. 1 ... processing schedule creation device 2 ... display means 3 ... input means 4 ... storage means 5 ... calculation means 23 ... number of jig repetitions, 24 ... total number of jigs.

────────────────────────────────────────────────── ─── Continued on the front page (72) Inventor Yoshinari Ota 106 Mori Seiki Co., Ltd., Kita-Koriyama-cho, Yamatokoriyama-shi, Nara Prefecture (58) Field surveyed (Int. Cl. ⁶ , DB name) B23Q 41 / 08 G06F 17/60

Claims (4)

(57) [Claims] 1. A machining schedule creating apparatus for creating a machining schedule when performing machining with an NC machine tool, comprising a row corresponding to a type of a machined part and a column corresponding to a child schedule arranged in chronological order. Storage means for storing a processing reservation table; display means for displaying the processing reservation table; and the number of jigs which can be used continuously for a predetermined type of processing component in the processing reservation table displayed by the display means. The number of jig repetitions, and the required total number of jigs corresponding to the number of processed parts corresponding to the row in the child schedule corresponding to the column at the position where the row and column intersect in the table Input means for inputting the total number of jigs, and the number of processed parts corresponding to the jig repetition number input by the input means in one column of the child schedule After that, the child schedule is repeated until the total number of used jigs corresponding to the number of processed parts reaches the above-mentioned total number of jigs for all processed parts. A processing means for preparing a processing schedule for performing processing in the same order after the child schedule has been shifted to the child schedule. 2. The processing schedule creating apparatus according to claim 1, wherein the priority order is determined in advance for a row corresponding to the type of the processing component. 3. The processing schedule creating apparatus according to claim 1, wherein the priority order can be different for each child schedule. 4. The method according to claim 1, wherein the number of jigs and the priority of each column of the child schedule are input at a position where a row corresponding to the type of the work part and a column of the child schedule intersect. The processing schedule creation device according to claim 3.