JP2007079908A - Scheduling program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a scheduling program for eliminating the need of repeating work of specifying a sending origin and a receiving destination during leveling and filling and deciding to what degree the load of a bucket is increased or decreased before establishing the movement of a load element. <P>SOLUTION: When two or more buckets are specified from a load graph 21 as the processing objects of leveling or filling and the upper side of the block of one of the specified buckets is dragged, a scheduling apparatus 10 indicates a temporary upper side indicating a block state when the drag is temporarily ended inside the specified bucket in the load graph 21 and changes the position of the temporary upper side according to the drag amount. When the drag is ended, the scheduling apparatus 10 updates a load management data base 16a inside an HDD 14 and the display of the load graph 21 so that the temporary upper side becomes the actual upper side of the block. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to a scheduling program for enabling production planning and editing on a computer.

  As is well known, a production plan is a plan for a load (planned production amount) per unit period of each production line in a factory, and in recent years, a computer has been operated as a device for making and editing this production plan. A lot of software has been developed. When a computer on which such software is started is inputted, the number of parts to be manufactured by subtracting the number of parts in stock from the number of parts required for manufacturing the product. In accordance with the capacity and delivery date of each production line, the production of the calculated number of parts is allocated to the appropriate unit period in the corresponding production line, and the load per unit period in each production line (that part A so-called load graph in which the amount of work (number of hours or number) required for manufacturing the number is visually displayed is displayed on the display device. The load graph is also referred to as a pile graph or a work amount graph.

  The general configuration of the load graph will be briefly described. The load graph is composed of a plurality of columns arranged in a matrix, and each row is assigned to each of a plurality of production lines. Assigned to the unit period. Each column includes a bar graph indicating the magnitude of the load in the corresponding unit period of the corresponding production line, and the load of each unit period of each production line can be visually recognized by the magnitude of the bar graph. It is like that. Each column is generally called a bucket.

  By the way, the production plan calculated by the above-described software is computational, and for example, the load of a certain unit period in a certain production line is extremely large, and the load of other unit periods of the production line is small. Unevenness can occur. If there is such a bias, the utilization rate and staffing will be affected, so the manager of the production plan may rework the production plan so that the load in each unit period of each production line becomes average. is there. Specifically, the administrator, for a bucket with a relatively heavy load in the load graph, loads components that constitute the load (for example, the amount of work (number of hours required for production of the quantity to be produced in one order). Or a part of the number)) is distributed to other buckets of the production line or buckets of other production lines. Conversely, for a relatively lightly loaded bucket, load from several other buckets. Work to scrape the elements little by little. The former work is generally referred to as “mountains”. On the other hand, the latter work is hereinafter referred to as “valley filling”.

  These mountain collapse and valley filling operations are performed manually by the administrator on the screen showing the load graph. For example, as shown in FIG. 23, a load graph with a unit period of one week is shown on the screen for each of the three production lines of process A to process C, and is displayed in each bucket. In the case where the entire bar graph is composed of one or more blocks each corresponding to a load element constituting the load of the bucket, a part of the load element of the bucket for the week of August 22 in the production line of step A is When moving to the bucket of the week of August 15 in the process A, the administrator selects one block selected from the bucket of the week of August 22 in the production line of the process A in the receiving August 15 Drag and drop into the day bucket. Then, processing for changing the assignment destination of the load element corresponding to the selected block from the transmission source bucket to the reception destination bucket is performed, and the display of the load graph is updated.

  Further, the load graph is not shown as a bar graph in the bucket as shown in FIG. 23, which is composed of blocks each corresponding to one or more load elements assigned to it. The whole bar graph in the bucket is shown in one block as shown in FIG. In the case of the load graph as shown in FIG. 24, for example, a part of the load element of the August 22 week bucket in the production line of the process A is moved to the August 22 week bucket of the process B. In order to do so, the administrator drags the bar graph in the sending source bucket to the receiving destination bucket. Then, a list screen for selecting one of several load elements assigned to the transmission source bucket is separately displayed, and the administrator selects one of the load elements and clicks the OK button. When is clicked, a process of changing the assignment destination of the selected load element from the transmission source bucket to the reception destination bucket is performed, and the display of the load graph is updated.

Japanese Patent Application Laid-Open No. 11-085854

  As described with reference to FIGS. 23 and 24, according to the conventional software described above, when performing the landslide and valley filling work, the sending source and the receiving destination must be specified one by one. One load element cannot be moved. Therefore, when distributing load elements from one bucket to many buckets, or when collecting load elements from many buckets into one bucket, the work of specifying the sending source and receiving destination is universal. There was a problem that had to be done.

  In addition, in the type of load graph as shown in FIG. 24, the extent to which the load on the destination bucket increases or the amount to which the load on the source bucket decreases decreases in practice. Until the load graph display is updated after performing the work of filling the valleys and valleys, there is also a problem that the work of landslides and valley fillings must be repeated many times.

  The present invention has been made in view of the problems of the prior art as described above, and the problem is that when performing a landslide or valley filling operation on a load graph, It is possible to determine how much each graph increases or decreases before the movement of the load element is determined.

  The scheduling program invented in order to solve the above-described problem is a computer program that, when the number of parts to be delivered at one time is designated as a load element for a production line in a factory, the designated load element is used. In order to define which unit period in which production line should be manufactured, load storage means for storing correspondence information in which load elements are associated with production lines and unit periods in the storage device, and correspondence information in the storage device Based on this, a graph that represents two-dimensionally the total load composed of one or more load elements assigned to one unit period in one production line is divided for each unit period of each production line. A graph display means for displaying on the display device, an instruction for specifying one of the graphs whose size should be changed from among the many graphs, Load change accepting means for accepting through an input device for operating the internet, when the pointer is inside the specific graph, the specific graph is determined to be a transmission source, and the pointer is within a predetermined range outside the specific graph If the operation graph attribute determining means determines that the specific graph is the receiving destination, and the operation graph attribute determining means determines that the specific graph is the transmission source, the size of the entire load is represented in the specific graph. Select and determine the number of load elements according to the distance between the boundary line that separates the inside and outside of this specific graph and the pointer from the load lines assigned to the production line and unit period according to a predetermined priority order. When the movement target determining means determines the load element to be moved, a graph that is the destination of the load element is displayed as a specific graph. If the receiving destination determining means for determining in accordance with a predetermined priority order from the remaining graphs excluding, the operation bucket attribute determining means determines that the specific graph is the receiving destination, the entire load in the remaining graphs excluding the specific graph The number of loads according to the distance between the pointer and the boundary line that divides the inside and outside of the specific graph in accordance with a predetermined priority order from among the production line that represents the size of the load and the load elements assigned to the unit period Source selection means for selecting and determining an element as a movement target, and determining a graph of a production line and unit period to which those load elements are assigned as a transmission source, the operation graph attribute determining means, or the transmission source If the load element to be moved is temporarily removed from the load whose size is indicated in the graph determined by the determining means as the sender The boundary line of the graph representing the magnitude of the load consisting of the load elements that will remain in the graph is displayed as a temporary boundary line with a line type different from the source graph, and the operation graph attribute determining means or the receiving In the graph determined by the destination determination means as the receiving destination, the load size including all load elements when the load element to be moved is temporarily added to the load whose size is represented in the graph is shown. When receiving through the input device a temporary boundary line display means for displaying the boundary line of the graph to be represented as a temporary boundary line with a line type different from that of the receiving graph, and an instruction to end the display of the temporary boundary line, Previously, the load element assignment destination that was the target of movement at the time when the end instruction was issued is changed from the production line and unit period of the sending graph to the production line and unit period of the receiving graph. The function as an operation reflection means for changing the correspondence information in the storage device is characterized.

  When the scheduling program is configured in this way, the computer on which the scheduling program is started has a pointer placed inside one graph among many graphs as a target of mountain collapse or valley filling, or When the pointer is placed within the outer predetermined range, temporary boundary lines indicating the state of the sending source and receiving destination graphs when the end instruction is temporarily given at the position of the pointer are displayed on the sending source and receiving destination graphs. The position of the temporary boundary line is changed according to the distance between the original boundary line and the pointer. When there is an end instruction, the correspondence information in the storage device is updated so that the temporary boundary line becomes the boundary line of the actual transmission source and reception destination graphs.

  In the scheduling program of the present invention, the graph may be a vertical bar graph indicating the magnitude of the load in the vertical height, or a horizontal bar graph indicating the magnitude of the load in the horizontal width. A bubble graph indicating the size of the load in terms of the diameter may be used. If the graph is a bar graph, the temporary boundary moves in the direction perpendicular to the reference edge, with the edge opposite the edge with the zero reference (usually the upper edge for a vertical bar graph and the right edge for a horizontal bar graph) When the graph is a bubble graph, the temporary boundary line moves in the radial direction orthogonal to the contour line with the contour line as a reference. In any case, when there is a pointer inside the graph, the graph is subject to mountain collapse, and when the pointer is outside the graph, the graph is subject to valley filling.

  Therefore, according to the present invention, when performing a mountain climbing or valley filling operation on the load graph, it is not necessary to carry out the operation of specifying the transmission source and the receiving destination, and the load element It becomes possible to determine how much each graph increases or decreases before the movement is fixed.

  Hereinafter, one embodiment for carrying out the present invention will be described with reference to the accompanying drawings.

<Hardware configuration and software configuration>
First, the hardware configuration and software configuration of the scheduling apparatus of this embodiment will be described.

  FIG. 1 is a configuration diagram of a scheduling apparatus 10 according to the present embodiment.

  The scheduling apparatus 10 of this embodiment is an apparatus configured to function as a scheduling apparatus by installing scheduling software 16 (described later) in a personal computer that is generally commercially available.

  As is well known, the personal computer constituting the scheduling device 10 includes a display device 10a such as a liquid crystal display, an input device 10b such as a keyboard and a mouse, and a main body 10c connected to these devices.

  The main body 10c incorporates known hardware such as a CPU [Central Processing Unit] 11, a DRAM [Dynamic Random Access Memory] 12, an MDD [Multi Disk Drive] 13, and an HDD [Hard Disk Drive] 14. Among them, the HDD 14 controls input / output in the display device 10a and the input device 10b, and storage areas of the DRAM 12, the MDD 13 and the HDD 14 (storage elements, CD [Compact Disk], DVD [Digital Versatile Disk], HD [ The basic software 15 for providing basic functions such as read / write control to the storage area of the Hard Disk] to many application software is stored.

  The scheduling software 16 is installed in the HDD 14 of the scheduling device 10.

  The scheduling software 16 is a program group and a data group for causing a computer to operate as a device for making and editing a plan for a load per unit period of each production line in a factory.

  Since the original function of the scheduling software 16 is general, it will be briefly described here. When the scheduling software 16 is activated, when the product to be manufactured, the number of pieces, and the delivery date are input, the part to be manufactured is subtracted from the number of parts required for manufacturing the product. In accordance with the capacity and delivery date of each production line, the production of the calculated number of parts is allocated to the unit period of the corresponding production line and registered in the load management database 16a in the HDD. That is, each time an order is placed, records are added to the load management database 16a by the number of types of parts required by the order. The record includes fields of a production line on which the part is to be manufactured, a unit period in which the manufacturing is to be performed, a work amount (hours or number of manufactures), a delivery date, and a name of a product to be configured. The scheduling device 10 that stores the load management database 16a in the HDD 14 corresponds to the load storage unit described above.

  After the above-described registration, the computer, based on the load management database 16a, is a so-called load in which the load per unit period (the amount of work (number of hours or number) required for production) on each production line is visually represented. The graph is displayed on the display device 10a. This function corresponds to the graph display means described above.

  FIG. 2 is a diagram illustrating an example of the load graph 21.

  As shown in FIG. 2, the load graph 21 includes a plurality of columns arranged in a matrix, and each row is assigned to each of the three production lines of the processes A to C, and each column is Each is assigned to each week as a unit period. Each column includes a bar-shaped block indicating the load in the corresponding unit period of the corresponding production line, and the load of each unit period in each production line can be visually recognized according to the size of the block. It is like that. Each column is generally called a bucket.

  Then, after the load graph 21 as shown in FIG. 2 is displayed on the screen, the scheduling software 16 prepares for the landslide or valley filling in the case where it is necessary to manually perform the mountain break or valley filling. The load edit module program 16b for performing the process concerning is included. The load editing module program 16b constitutes a main part of the present invention, and details of processing executed by the CPU 11 in accordance with the program 16a will be described later.

  The scheduling software 16 also includes a cost coefficient master table 16c as shown in FIG. This cost coefficient master table 16c is the same for all parts that can be manufactured in a factory, when the manufacturing cost when the parts are manufactured on a normal manufacturing line is 1, and the parts are processed in the same working time on other manufacturing lines. It is the table which defined the increase rate of the manufacturing cost when manufacturing. The scheduling device 10 that stores the cost coefficient master table 16c in the HDD 14 functions as a cost storage unit.

  FIG. 3 is a diagram illustrating an example of a data structure of the cost coefficient master table 16c.

  As shown in FIG. 3, the cost coefficient master table 16c has the same number of records as the factory production line. Each record has a “line name” field and as many “part name n” fields as there are parts that can be manufactured in the factory. The “line name” field is a field in which the name of the production line is recorded. In the “part name n” field, names of parts that can be manufactured at the factory are assigned, and the cost increase ratio of the n-th part is recorded.

<Processing content>
Next, the contents of processing performed by the scheduling device 10 according to the load editing module program 16b will be described. However, for the convenience of explanation, after describing the operation that must be performed before the load editing module program 16b is started, the processing content related to the load editing module program 16b will be described.

  First, when a load graph 21 as shown in FIG. 2 is displayed on the display device 10a, a load editing setting menu is selected from a drop-down list box displayed when a menu button (not shown) is clicked. Then, the CPU 11 displays three load editing setting screens.

  4A to 4C are diagrams showing examples of three load editing setting screens 22 to 24, respectively.

  Of the three load editing setting screens 22 to 24, the first load editing setting screen 22 shown in FIG. 4A is a load element (for example, a single order received) that has been moved by mountain climbing by the processing described later. 5 is a screen for setting a selection condition when selecting a bucket that is a recipient of a work amount (number of hours or number) required for production of the quantity to be produced generated in step S2. The first load editing setting screen 22 includes a list box 22a, a move button 22b, an OK button 22c, and a cancel button 22d. In the list box 22a, three selection conditions of “leveling”, “cost”, and “advance amount” are listed from top to bottom in order of priority, and the selection button selected by the cursor is moved. The order of each selection condition in the list box 22a can be changed by moving it by the operation of 22b. The OK button 22c is a button that is clicked after the order of each selection condition in the list box 22a is determined, and the cancel button 22d is a button that is clicked when canceling such a setting operation. The “leveling” in the first load editing setting screen 22 refers to a selection condition for selecting a bucket with the least load as a load element receiving destination. The “cost” is a selection condition for selecting, as a load element receiving destination, a bucket in which the manufacturing cost of the part related to the load element that is a movement target is least expensive (the bucket having the lowest cost coefficient of the part). Say. The “advance amount” refers to a selection condition for selecting, as a load element receiving destination, a bucket having the shortest inventory period after the parts related to the load element to be moved are manufactured.

  The second load editing setting screen 23 shown in FIG. 4B is a screen for setting a selection condition when selecting a bucket that is a source of load elements in valley filling by processing described later. . Similar to the first load editing setting screen 22, the second load editing setting screen 23 includes a list box 23a, a move button 23b, an OK button 23c, and a cancel button 23d. These GUI [Graphical The functions of the User Interface] parts 23 a to 23 d are the same as those of the first load editing setting screen 22. Note that “leveling” in the second load editing setting screen 23 refers to a selection condition for selecting the bucket with the highest load as the load element transmission source. “Cost” refers to the bucket in which the manufacturing cost is the most reduced among the buckets for which the load elements to be moved are tentatively determined (the tentatively determined load elements are received from the cost factor at the transmission source). This is a selection condition for selecting the bucket having the largest value obtained by subtracting the previous cost coefficient, and therefore the bucket having the smallest increase when there is only a bucket that increases the manufacturing cost, as the load element transmission source. The “advance amount” refers to the bucket in which the inventory period is shortest after the parts related to the load element are manufactured at the receiving destination among the buckets for which the load elements to be moved are tentatively determined. Say the selection condition to select as the source of the element.

  In addition, the third load editing setting screen 24 shown in FIG. 4C selects a load element to be moved from the load element assigned to the transmission source bucket to the receiving bucket. It is a screen for setting the selection conditions when doing. The third load editing setting screen 24 includes a list box 24a, a move button 24b, a pair of radio buttons 24c, an OK button 24d, and a cancel button 24e. In the list box 24a, two selection conditions of “load” and “advance amount” are listed from top to bottom in order of priority, and the selection condition selected by the cursor is moved by operating the move button 24b. By doing so, the order of the selection conditions in the list box 24a is changed. The pair of radio buttons 24c are for setting conditions in more detail regarding the selection condition of “load”, and specifically, from among the load elements assigned to the bucket set as the transmission source, This is a button for designating whether to select a large load element (descending order) or to select the smallest load element (ascending order). The OK button 24d is a button that is clicked after the order of each selection condition in the list box 24a is determined, and the cancel button 24e is a button that is clicked when canceling such a setting operation. The “advance amount” on the third load editing setting screen 24 is a selection condition for selecting a load element with the earliest delivery date as a movement target.

  Then, in a state where the three load editing setting screens 22 to 24 as shown in FIGS. 4A to 4C are displayed on the display device 10a, the OK buttons 22d, 23d, and 24e of the screens 22 to 24 are displayed. Is clicked, the setting contents recorded in the DRAM 12 or the HDD 14 are overwritten and updated with the setting contents inputted in the respective screens 22 to 24 at the time of clicking.

  As an operation separate from such a setting operation, all buckets related to mountain collapse or valley filling are selected by left-clicking while pressing the shift key on the keyboard of the input device 10b, and then selected. When the drag operation starting from the upper side position of the block in any one of the buckets is started, the CPU 11 starts the load editing module program 16b and starts the load editing process. It has become. Note that the function of accepting an operation of selecting two or more buckets from the load graph 21 corresponds to the change target graph accepting means, and accepts a drag operation starting from the upper side position of one of the buckets. The function corresponds to the load change receiving means described above.

  5 to 8 are diagrams showing the flow of the load editing process.

  After starting the load editing process, the CPU 11 executes an initialization process (step S101). Specifically, the CPU 11 first generates and adds identification information for identifying the bucket from other buckets to all buckets selected before the start of the load editing process, Based on the load management database 16a described above, a table for managing the loads of all buckets selected before the start of the processing is created.

  FIG. 9 is a diagram illustrating an example of the data structure of the selected bucket information management table 31.

  As shown in FIG. 9, the selected bucket information management table 31 has the same number of records as the selected bucket. Each record has fields of “ID”, “line name”, “week”, “load”, “load information”, and “source / receiver”.

  The “ID” field is a field in which an ID which is identification information added to the bucket is recorded. The “line name” field is a field in which the name of a production line whose load is managed in the bucket is recorded. The “week” field is a field in which the date of the first day of the week in which the load of the production line is managed in the bucket is recorded. The “load” field is a field in which information indicating the magnitude of the load assigned to the bucket (the total number to be manufactured in the unit period) is recorded. The “load information” field is a field in which link information to the load element management tables 31a to 31c for managing all the load elements assigned to the bucket is recorded. The “transmission source / acceptance destination” field is a field in which the fact is recorded when the bucket is selected as the transmission origin or the reception destination. Note that, at the beginning of the selection bucket information management table 31 being created by the initialization process, the “source / receiver” field is blank.

  Note that the load element management tables 31a to 31c in which link information to the self is recorded in the “load information” field have the same number of records as the load elements allocated to the bucket. Each record has fields of “product name”, “load element”, “delivery date”, “movement order”, and “receiving destination ID”.

  The “product name” field is a field in which the name of a product to be manufactured based on the load element is recorded. The “load element” field is a field in which a load element (amount of work (number of hours or number), a unit is “time” if the number of hours is “number”) is recorded. The “Delivery Date” field is a field in which information indicating the delivery date of the load element is recorded. The “Movement Order” field is the number of load elements among the load elements to be moved when load elements to be moved from the bucket to another bucket are selected for mountain collapse or valley filling. This is a field in which a movement order indicating whether or not to move is recorded. However, when the load element is not selected as a movement target, the “movement order” field of the load element is blank. The “receiving destination ID” field is a field in which the bucket ID of the receiving destination when the load element is selected as a movement target is recorded.

  After generating the selected bucket information management table 31 (step S101 in FIG. 5), the CPU 11 determines whether or not the drag has ended (step S102).

  If the drag has not ended (step S102; NO), the CPU 11 determines whether or not the temporary upper side is displayed (step S103). As will be described later, the temporary upper side is a broken line indicating the position where the upper side moves if the drag is temporarily stopped while the upper side of the block is being dragged (FIG. 16, FIG. 20 to FIG. 20). (See FIG. 22).

  If the temporary upper side has not been displayed yet (step S103; YES), the CPU 11 determines whether or not the mouse pointer matches the original upper side (step S111).

  If the mouse pointer coincides with the original upper side (step S111 in FIG. 6; YES), the CPU 11 returns to the process of determining whether or not the drag has ended (step S102 in FIG. 5).

  On the other hand, when the mouse pointer does not match the original upper side (step S111; NO), the CPU 11 determines whether or not the mouse pointer is below the original upper side (step S112). This step S112 corresponds to the operation graph attribute determining means described above.

  When the mouse pointer is below the original upper side (step S112; YES), the CPU 11 executes a movement load element determination process (step S113). This movement load element determination process corresponds to the movement target determination means described above.

  10 and 11 are diagrams showing the flow of the moving load element determination process.

  After starting the moving load element determination process, the CPU 11 refers to the load element management tables 31a to 31c (see FIG. 9) of the bucket in which the drag operation is performed, and among all the load elements assigned to the bucket. From this, one unprocessed load element is specified as a processing target thereafter (step S201), and the variable P is cleared to zero (step S202).

  Subsequently, the CPU 11 executes an evaluation point addition processing loop L1. Specifically, in the evaluation point addition processing loop L1, the CPU 11 evaluates each evaluation item in the load element to be processed as a processing target one by one in the priority order set at that time. Steps S211 to S215 are executed for each item. Note that the evaluation items of the load element are specifically the size and delivery date. The priority order set for these evaluation items is determined using the third load editing setting screen 24 in FIG.

  In step S211, the CPU 11 calculates an evaluation score based on the evaluation item to be processed. Specifically, when the evaluation item to be processed is large, the CPU 11 “load element” in the record of the load element to be processed in the load element management tables 31a to 31c of the bucket in which the drag operation is performed. Read the value of the size of the load element to be processed from the field, use that value as the base point, and multiply the base point by the padding value (described later) corresponding to the priority order of the processing target evaluation items. Is an evaluation score based on the evaluation target item. Further, when the evaluation item to be processed is a delivery date, the CPU 11 reads the date of delivery from the “delivery date” field of the record of the processing target load element in the load element management tables 31a to 31c of the bucket, The number of days from the date of delivery to the first day of the unit period of the bucket is used as the base point, and the base point is multiplied by the padding value corresponding to the priority order of the processing target evaluation items. The evaluation score is based on the item. In addition, as shown in FIG. 12, when the size of the load element can take up to 100, the padding value corresponding to the priority order is set to 100 for the evaluation item of the first rank, and the rank is 2 It is desirable to set the rank evaluation item to 1. This padding value increases the influence on the total of the evaluation points for the evaluation items set higher in priority. Of course, when the maximum value that the load element can take is larger than 100, or When the maximum value that can be taken for a period exceeds 100 days, if the inflated value in the second rank is set to 1, the inflated value in the first rank is the maximum of the load element or the unit period, whichever is larger It must be larger than this.

  In step S212 and step S213 in FIG. 10, the CPU 11 determines whether or not the evaluation item to be processed is large, and the load element set using the third load edit setting screen 24 in FIG. 4. Whether or not the selection method is descending order is determined. If the evaluation item to be processed is a size (step S212; YES), and the load element selection method is set in descending order (step S213; YES), the CPU 11 proceeds to step S211. A process of multiplying the evaluation score calculated in step -1 by -1 is performed (step S214). On the other hand, when the evaluation item to be processed is not large (step S212; NO), or when the load element selection method is set in ascending order (step S213; NO), the CPU 11 calculates in step S211. Leave the evaluation score as it is without multiplying anything.

  In step S215, the CPU 11 adds the calculated evaluation score to the substitution value of the variable P, and overwrites and updates the substitution value of the variable P with the obtained value.

  After performing these steps S211 to S215 for each evaluation item of the load element to be processed, the CPU 11 leaves the evaluation point addition processing loop L1 and sets the substitution value of the variable P to the final value of the load element to be processed. The evaluation points (total evaluation points for each evaluation item) are stored in a predetermined area in the DRAM 12 (step S221 in FIG. 11).

  Thereafter, the CPU 11 determines whether or not the evaluation point addition processing loop L1 has been executed for all the load elements in the bucket (step S222).

  If there is one of the load elements in the bucket that has not finished executing the evaluation point addition processing loop L1 (step S222; NO), the CPU 11 selects one of the unprocessed load elements. It specifies as a process target (step S201), and the evaluation point addition process loop L1 is performed again.

  Thereafter, when the evaluation point addition processing loop L1 has been executed for all of the load elements in the bucket (step S222; YES), the CPU 11 temporarily stores the load element in the DRAM 12 among all the load elements assigned to the bucket. The load element having the smallest evaluation score is determined as a movement target (step S223), and the movement load element determination process according to FIGS. 10 and 11 is terminated.

  The CPU 11 determines a load element to be moved by executing such a moving load element determination process (step S113 in FIG. 6), and then executes a receiving destination bucket determination process (step S114). This receiving destination bucket determination process corresponds to the receiving destination determining means described above.

  FIG. 13 is a diagram illustrating a flow of a receiving bucket determination process.

  After starting the receiving bucket determination process, the CPU 11 refers to the selected bucket information management table 31 (see FIG. 9), and selects the remaining selected buckets other than the bucket where the drag operation is performed as the subsequent processing target. One unprocessed bucket is specified (step S301), and the variable Q is cleared to zero (step S302).

  Subsequently, the CPU 11 executes an evaluation point addition processing loop L2. Specifically, in this evaluation point addition processing loop L2, the CPU 11 identifies each evaluation item in the processing target bucket as a processing target one by one in the priority order set at that time, thereby evaluating the evaluation item. Steps S311 and S312 are executed for each of the above. Note that the bucket evaluation items are specifically the size of the load, the cost coefficient corresponding to the movement target, and the movement amount of the movement target. The priority order set for these evaluation items is determined using the first load editing setting screen 22 in FIG.

  In step S311, the CPU 11 calculates an evaluation score based on the evaluation item to be processed. Specifically, when the evaluation item to be processed is the size of the load, the CPU 11 reads the value of the size from the “load” field of the record of the processing target bucket in the selected bucket information management table 31. The value is used as a base point, and the base point is multiplied by a padding value corresponding to the priority order of the processing target evaluation items, and the obtained value is set as an evaluation point based on the evaluation target item. Further, when the evaluation item to be processed is a cost coefficient corresponding to the movement target, the CPU 11 determines, from the cost coefficient master table 16c, the processing target bucket for the load element determined as the movement target in step S113 in FIG. Read the cost coefficient value at, use that value as the base point, multiply the base point by the padding value corresponding to the priority order of the evaluation target item, and evaluate the obtained value based on the evaluation target item. Let it be a point. Further, when the evaluation item to be processed is the amount of movement of the load element from the bucket to the processing target bucket, the CPU 11 refers to the selected bucket information management table 31 and selects the processing target bucket from the first day of the bucket. The number of days until the first day is used as a base point, and the base point is multiplied by the padding value corresponding to the priority order of the processing target evaluation items, and the obtained value is used as the evaluation point based on the evaluation target item. As shown in FIG. 14, when the load can be up to 100, the padding value corresponding to the priority order is 10000 for the evaluation item with the first rank, and the rank is second. It is desirable to set 100 for the evaluation item and 1 for the evaluation item ranked third. This inflated value, like the inflated value shown in FIG. 12, increases the influence on the total of the evaluation points for the evaluation items set higher in priority, and of course, the maximum value that can be taken by the load. Is greater than 100, the maximum value that can be taken by the cost coefficient exceeds 100, or the maximum value that can be taken by the moving period exceeds 100 days, and the inflated value that ranks third is 1 The inflated value of the second rank is not less than the maximum value of the load, cost coefficient, and movement period, whichever is larger, and the inflated value of the first rank is next to the inflated value of the second rank. It must be larger than the square.

  In step S <b> 312 of FIG. 13, the CPU 11 adds the calculated evaluation score to the substitution value of the variable Q, and overwrites and updates the substitution value of the variable Q with the obtained value.

  After performing these steps S311 and S312 for each evaluation item of the bucket to be processed, the CPU 11 leaves the evaluation point addition processing loop L2, and uses the substitution value of the variable Q as the final evaluation score of the bucket to be processed. This is stored in a predetermined area in the DRAM 12 as (total evaluation score for each evaluation item) (step S321).

  Thereafter, the CPU 11 determines whether or not the evaluation point addition processing loop L2 has been executed for all of the remaining selected buckets excluding the bucket on which the drag operation is performed (step S322).

  When there is a bucket other than the bucket on which the drag operation has been performed and the execution of the evaluation point addition processing loop L2 is not completed (step S322; NO), the CPU 11 One is specified as a processing target (step S301), and the evaluation score addition processing loop L2 is executed again.

  Thereafter, when the evaluation point addition processing loop L2 has been executed for all of the remaining selected buckets excluding the bucket on which the drag operation has been performed (step S322; YES), the CPU 11 determines, The bucket with the smallest evaluation score temporarily stored in the DRAM 12 is determined as the receiving destination of the load element determined as the movement target, and the receiving destination bucket determination processing according to FIG. 13 is terminated.

  Then, after determining the receiving destination bucket of the load element by executing the receiving destination bucket determination process (step S114 in FIG. 6), the CPU 11 executes a temporary upper side display process (step S116). This temporary upper side display process corresponds to the above-described temporary boundary line display means.

  Specifically, the CPU 11 first registers the bucket in which the drag operation is performed in the selected bucket information management table 31 in FIG. 9 (corresponding to the operation graph attribute determination unit), and is selected in step S114. The bucket is registered as a receiving destination, and the load element selected in step S113 in FIG. 6 is registered as a movement target. FIG. 15 is a diagram showing the selected bucket information management table 31 after these registration processes are performed. As shown in FIG. 15, in the selected bucket information management table 31, “sending source” is recorded in the “sending source / receiving destination” field of the record of the bucket in which the drag operation is performed, and is set as the receiving destination. “Acceptance destination” is recorded in the “transmission source / acceptance destination” field of the bucket record. In the load element management tables 31a to 31c linked to the “load information” field of the record of the sending source bucket, “1” is recorded in the “movement order” field of the record of the load element that is the movement target. In the “receiving destination ID” field, the receiving bucket ID is recorded.

  And after registering each information to the selection bucket information management table 31 and the load element management tables 31a-31c linked to this, CPU11 performs the process which displays a temporary upper side based on the information in these tables. Specifically, the CPU 11 temporarily displays a block expressed by the remaining load elements after excluding the load elements determined as the movement target from among the load elements assigned to the sending source bucket. The upper side of the block is displayed as a temporary upper side in a source bucket in a broken line. Similarly, the CPU 11 temporarily displays the upper side of the block when the block represented by the load element is temporarily displayed after the load element to be moved is added to the load element assigned to the receiving bucket. As the upper side, it is displayed in the receiving bucket in a broken line. FIG. 16 is a diagram illustrating an example when temporary upper sides are respectively shown in the process A bucket for the week of August 15 and the bucket of the process A for the week of August 22 in the load graph 21 of FIG. It is. In FIG. 16, the bucket surrounded by the thick line is the selected bucket.

  Then, after executing such a temporary upper side display process (step S116), the CPU 11 returns to the process of determining whether or not the drag has ended (step S102 in FIG. 5).

  On the other hand, when the mouse pointer is located above the original upper side (step S112 in FIG. 6; NO), the CPU 11 executes a transmission source bucket determination process (step S115). This transmission source bucket determination process corresponds to the transmission source determination means described above.

  FIG. 17 is a diagram showing the flow of the transmission source bucket determination process.

  After starting the transmission source bucket determination process, the CPU 11 refers to the selected bucket information management table 31 (see FIG. 9), and selects the remaining selected buckets other than the bucket on which the drag operation has been performed, Then, one unprocessed bucket is specified (step S401), and the variable R is cleared to zero (step S402).

  Subsequently, the CPU 11 executes a moving load element determination process to determine a load element to be moved from among load elements assigned to the processing target bucket when the processing target bucket is temporarily set as a transmission source. (Step S403). Note that the moving load element determination processing has already been described with reference to FIGS. 10 and 11, and therefore the description thereof is omitted here.

  The CPU 11 executes the evaluation point addition processing loop L3 after determining the load element to be moved from the processing target bucket by the moving load element determination process. Specifically, in this evaluation score addition processing loop L3, the CPU 11 specifies each evaluation item in the processing target bucket as a processing target one by one in the priority order set at that time, thereby evaluating the evaluation items. Steps S411 and S412 are executed for each of the above. Note that the bucket evaluation items are specifically the size of the load, the cost coefficient corresponding to the movement target, and the movement amount of the movement target. Further, the priority order set for these evaluation items is determined using the second load editing setting screen 23 in FIG.

  In step S411, the CPU 11 calculates an evaluation score based on the evaluation item to be processed. Specifically, when the evaluation item to be processed is the size of the load, the CPU 11 reads the value of the size from the “load” field of the record of the processing target bucket in the selected bucket information management table 31. The value obtained by multiplying the value by -1 is used as a base point, and the base point is multiplied by the padding value corresponding to the priority order of the processing target evaluation item, and the obtained value is evaluated based on the evaluation target item. Let it be a point. Further, when the evaluation item to be processed is a cost coefficient corresponding to the movement target, the CPU 11 performs a drag operation on the load element determined as the movement target in step S403 from the cost coefficient master table 16c. Read the value of the cost coefficient in the bucket, use that value as the base point, multiply the base point by the padding value corresponding to the priority order of the processing target evaluation item, and use the obtained value based on the evaluation target item Use as an evaluation point. Further, when the evaluation item to be processed is the amount of movement of the load element from the processing target bucket to the bucket, the CPU 11 refers to the selected bucket information management table 31 and starts from the first day of the processing target bucket. The number of days until the first day is used as a base point, and the base point is multiplied by the padding value corresponding to the priority order of the processing target evaluation items, and the obtained value is used as the evaluation point based on the evaluation target item. As shown in FIG. 18, the relationship between the maximum value that can be taken by the magnitude of the load, the cost coefficient, and the movement period and the padding value are the same as those shown in FIG.

  In step S412, the CPU 11 adds the calculated evaluation score to the substitution value of the variable R, and overwrites and updates the substitution value of the variable R with the obtained value.

  After performing these steps S411 and S412 for each evaluation item of the bucket to be processed, the CPU 11 leaves the evaluation point addition processing loop L3, and uses the substitution value of the variable R as the final evaluation score of the bucket to be processed. As (total evaluation score for each evaluation item), it is stored in a predetermined area in the DRAM 12 (step S421). At this time, the CPU 11 also stores information indicating the load element determined as the movement target in step S403 in the DRAM 12 in association with the evaluation score.

  Thereafter, the CPU 11 determines whether or not the evaluation point addition processing loop L3 has been executed for all of the remaining selected buckets excluding the bucket on which the drag operation is performed (step S422).

  If there is a bucket other than the bucket on which the drag operation has been performed and the execution of the evaluation point addition processing loop L3 has not been completed (step S422; NO), the CPU 11 One is specified as a processing target (step S401), and the moving load element determination processing (step S403) and the evaluation point addition processing loop L3 are executed again.

  Thereafter, when the evaluation point addition processing loop L3 has been executed for all of the remaining selected buckets excluding the bucket on which the drag operation has been performed (step S422; YES), the CPU 11 selects among the buckets for which the evaluation points have been calculated. The bucket having the smallest evaluation score temporarily stored in the DRAM 12 is determined as the load element sending source, and the sending source bucket determining process according to FIG. 17 is terminated.

  Then, after determining the transmission source bucket and the load element to be moved by executing the transmission source bucket determination process (step S115 in FIG. 6), the CPU 11 executes a temporary upper side display process (step S116). This temporary upper side display process corresponds to the above-described temporary boundary line display means.

  Specifically, the CPU 11 first registers the bucket selected in step S115 as a transmission source in the selected bucket information management table 31 of FIG. 9 (corresponding to the operation graph attribute determining means), and a drag operation is performed. A bucket is registered as a receiving destination, and the load element selected in step S403 is registered as a movement target for the bucket set as the transmission source.

  And after registering each information to the selection bucket information management table 31 and the load element management tables 31a-31c linked to this, CPU11 performs the process which displays a temporary upper side based on the information in these tables. As a result, a broken temporary upper side is shown in the bucket in which the drag operation is performed in the load graph 21 and the bucket determined as the transmission source.

  Then, after executing such a temporary upper side display process (step S116), the CPU 11 returns to the process of determining whether or not the drag has ended (step S102 in FIG. 5).

  If the drag has not ended (step S102; NO), and the temporary upper side is displayed (step S103; NO), the CPU 11 determines whether or not the temporary upper side is below the original upper side. It discriminate | determines (step S104).

  If the temporary upper side is below the original upper side (step S104; YES), the CPU 11 determines whether or not the mouse pointer is below the temporary upper side (step S131).

  If the mouse pointer is on the lower side of the temporary upper side (step S131; YES), the CPU 11 performs the drag operation by executing the movement load element determination process described based on FIGS. One load element to be moved is determined from among the load elements assigned to the bucket (step S132). However, among the load elements assigned to the bucket on which the drag operation is performed, the CPU 11 has already been determined as a movement target (a numerical value is displayed in the “movement order” field as shown in FIG. 15). The recorded load element) is excluded from the options to be moved, and the moving load element determination process is performed.

  Subsequently, the CPU 11 determines the receiving destination bucket of the load element determined as the movement target in step S132 by executing the receiving destination bucket determination process described based on FIG. 13 (step S133).

  Thereafter, the CPU 11 executes a temporary upper side display update process (step S134). The temporary upper side display update process corresponds to the temporary boundary line display means described above.

  Specifically, the CPU 11 first registers the bucket determined in step S133 as a recipient (does nothing if registered), and registers the load element determined in step S132 as a movement target. I do. FIG. 19 is a diagram showing the selected bucket information management table 31 when the mouse pointer moves downward beyond the temporary upper side when the temporary upper side is at the position shown in FIGS. 15 and 16. As shown in FIG. 19, in the selected bucket information management table 31, “acceptance destination” is recorded in the “transmission source / acceptance destination” field of the bucket record newly determined as the acceptance destination in step S133. In addition, in the load element management tables 31a to 31c linked to the “load information” field of the record of the bucket that is being dragged, in the “movement order” field of the record of the load element that has been moved in step S132, “2” is recorded, and the ID of the bucket determined as the receiving destination in step S133 is recorded in the “receiving destination ID” field.

  Then, after registering each information in the selected bucket information management table 31 and the load element management tables 31a to 31c linked to the selected bucket information management table 31, the CPU 11 performs a process of updating the display of the temporary upper side based on the information in these tables. Do. Specifically, the CPU 11 temporarily deletes the temporary upper side displayed in the transmission source bucket, and then uses the remaining load elements after removing the load element determined as the movement target in the transmission source bucket. When the block to be expressed is temporarily displayed, the upper side of the block is displayed as a temporary upper side in a transmission source bucket by a broken line. Similarly, the CPU 11 once deletes the temporary upper side displayed in the receiving destination bucket, and then, for each bucket determined as the receiving destination, all the loads after the load element to be moved is added. When a block represented by an element is temporarily displayed, the upper side of the block is displayed as a temporary upper side in a corresponding receiving destination bucket by a broken line. FIG. 20 is a diagram illustrating an example of the load graph 21 corresponding to the contents of the selected bucket information management table 31 of FIG. As apparent from FIG. 16, in the load graph 21 of FIG. 20, when the mouse pointer is moved further down, the bucket for the week of August 22 in the process B is also the receiving destination, and the temporary upper side is It is displayed.

  Then, after executing such a temporary upper side display update process (step S134), the CPU 11 returns to the process of determining whether or not the drag has ended (step S102 in FIG. 5).

  On the other hand, if the mouse pointer is above the temporary upper side (step S131 in FIG. 7; NO), the CPU 11 determines whether or not the mouse pointer matches the original upper side, and the mouse pointer is immediately before the temporary upper side position. Are also determined on the upper side (steps S135 and S136).

  If the mouse pointer does not coincide with the original upper side and the mouse pointer is not above the temporary upper side position (step S135; NO, step S136; NO), the CPU 11 determines whether the dragging has ended. Returning to the process of determining whether or not (step S102 in FIG. 5).

  On the other hand, if the mouse pointer coincides with the original upper side (step S135; YES), or if the mouse pointer is above the previous temporary upper side position (step S136; YES), the CPU 11 temporarily moved immediately before. Processing for returning the load element to the original bucket is executed (step S137). Specifically, the CPU 11 refers to the load element management tables 31a to 31c linked to the record of the bucket in which the drag operation is performed in the selected bucket information management table 31, and records the movement order in the “movement order” field. Among the recorded records, the values of the “movement order” field and the “reception destination ID” field of the record having the largest movement order are deleted.

  Thereafter, the CPU 11 executes a temporary upper side display update process based on the selected bucket information management table 31 and the load element management tables 31a to 31c linked to these (step S138). The temporary upper side display update process corresponds to the temporary boundary line display means described above. As a result of this processing, for example, when the mouse pointer located at the position shown in FIG. 20 moves upward beyond the immediately preceding temporary upper side position, the temporary upper side is deleted, and the display of the load graph 21 is shown in FIG. It will return to the state of 16.

  Then, after executing such a temporary upper side display update process (step S138), the CPU 11 returns to the process of determining whether or not the drag has ended (step S102 in FIG. 5).

  If the drag has not ended (step S102; NO) and the temporary upper side is above the original upper side (step S103; NO, step S104; NO), the CPU 11 indicates that the mouse pointer is the temporary upper side. It is determined whether or not it is on the upper side (step S151).

  If the mouse pointer is on the upper side of the temporary upper side (step S151; YES), the CPU 11 executes a sending source bucket determination process described based on FIG. From the remaining selected buckets, a bucket to be sent and a load element to be moved in the bucket are determined (step S152).

  Thereafter, the CPU 11 executes a temporary upper side display update process (step S153). The temporary upper side display update process corresponds to the temporary boundary line display means described above.

  Specifically, the CPU 11 registers the bucket and load element determined in step S152 as a transmission source and a movement target. However, if the bucket has already been registered as a sender, the CPU 11 does nothing.

  Then, after registering each information in the selected bucket information management table 31 and the load element management tables 31a to 31c linked to the selected bucket information management table 31, the CPU 11 performs a process of updating the display of the temporary upper side based on the information in these tables. Do. As a result, for example, as shown in FIG. 21, when the mouse pointer is located above the original upper side and below the temporary upper side, if the mouse pointer moves above the temporary upper side, the temporary upper side is erased. Then, a new temporary upper side is displayed above the mouse pointer.

  Then, after executing such a temporary upper side display update process (step S153), the CPU 11 returns to the process of determining whether or not the drag has ended (step S102 in FIG. 5).

  On the other hand, when the mouse pointer is on the lower side of the temporary upper side (step S151 in FIG. 8; NO), the CPU 11 determines whether or not the mouse pointer matches the original upper side and the position of the temporary upper side immediately before the mouse pointer. It is respectively determined whether or not it is below (steps S154 and S155).

  If the mouse pointer does not coincide with the original upper side and the mouse pointer is not below the temporary upper side position (step S154; NO, step S155; NO), the CPU 11 ends the dragging. The process returns to the process of determining whether or not (step S102 in FIG. 5).

  On the other hand, when the mouse pointer coincides with the original upper side (step S154; YES), or when the mouse pointer is below the previous temporary upper side position (step S155; YES), the CPU 11 temporarily moves immediately. A process of returning the loaded load element to the original bucket is executed (step S156). Specifically, the CPU 11 refers to the load element management tables 31a to 31c linked to the selected bucket information management table 31, and among the records in which the movement order is recorded in the “movement order” field, the movement order is Delete the values of the “movement order” field and the “reception destination ID” field of the largest record.

  Thereafter, the CPU 11 executes a temporary upper side display update process based on the selected bucket information management table 31 and the load element management tables 31a to 31c linked to these (step S157). The temporary upper side display update process corresponds to the temporary boundary line display means described above. As a result of this processing, for example, when the mouse pointer located at a position as shown in FIG. 22 moves downward beyond the previous temporary upper side position, the temporary upper side being displayed is erased, and the previous By newly displaying the temporary upper side at the temporary upper side position, the display of the load graph 21 returns to the state of FIG.

  Then, after executing such a temporary upper side display update process (step S157), the CPU 11 returns to the process of determining whether or not the drag has ended (step S102 in FIG. 5).

  If the drag has ended (step S102; YES), the CPU 11 executes a reflection process (step S105). Specifically, the CPU 11 reflects the contents of the selected bucket information management table 31 in the load management database 16a described above. This reflection process corresponds to the operation reflection means described above. After completing the reflection process, the CPU 11 ends the load editing process according to FIGS.

  When the content of the load management database 16a is updated by this load editing process, the original function of the scheduling software updates the content of the load graph 21 based on the content of the load management database 16a. Thereby, the display of the load graph 21 is updated so that the temporary upper side displayed at the time when the dragging is finished becomes the upper side of the actual block.

<Operational effects of this embodiment>
Next, the operation and effect of the scheduling apparatus 10 of this embodiment will be described.

  The manager of the production plan operates the scheduling device 10 to display the load graph 21 on the display device 10a, and then when the load graph 21 needs to be crushed or filled, the following operation is performed. It can be carried out.

  That is, when there is a bucket (for example, a bucket having a relatively large block) in which the load element is to be distributed to another bucket in the load graph 21, the administrator first loads the load element from the bucket and the bucket. The buckets that are likely to be accepted are identified and the buckets are selected by left-clicking while holding down the shift key.

  After selecting two or more buckets in this manner, the administrator selects one bucket whose size of the block is to be changed from the selected buckets, and performs a drag operation using the upper side position of the block of the bucket as a starting point.

  When the mouse pointer is moved to the lower side of the upper side of the block after the start of the drag operation, one load element to be moved is selected from among the load elements assigned to the bucket, and The bucket that is the load element receiving destination is selected (step S102; NO, S103; YES, S111; NO, S112; YES, S113, S114), and the state of the block when the load element is temporarily moved to the receiving destination. The temporary upper side shown is shown in the sending source bucket and the receiving destination bucket (step S116, FIG. 16).

  When the administrator moves the mouse pointer to the lower side beyond the temporary upper side while continuing the drag operation, the administrator further selects another movement target from among the load elements assigned to the bucket. One load element is selected, and a bucket as a receiving destination of the load element is selected (step S102; NO, S103; NO, S104; YES, S131; YES, S132, S133), and then the mouse pointer. If a new temporary upper side is displayed on the lower side, and the recipient is a newly selected bucket, the new temporary upper side is indicated in the bucket and the recipient has already been selected. In the case of the bucket, the temporary upper side of the bucket is displayed at a position one step higher (step S134, FIG. 20).

  In addition, while continuing the drag operation, the administrator moves the mouse pointer above the temporary upper side shown previously without moving the mouse pointer below the newly shown temporary upper side. Then, the newly shown temporary upper side is deleted and the previously shown temporary upper side is shown again (step S102; NO, S103; NO, S104; YES, S131; NO, S135; NO, S136). ; YES, S137, S138, FIG. 16).

  When the size of the block in the selected bucket becomes appropriate due to such an operation, when the administrator stops the drag operation, the temporary upper side becomes the upper side of the actual block. When the load management database 16a in the HDD 14 is updated, the display of the load graph 21 is updated (step S102; YES, S105).

  As described above, when the administrator performs mountain climbing in the load graph 21, after selecting the target bucket, the administrator simply drags the upper side of the block of one bucket and determines the movement of the load element. It becomes possible to determine how much the load on the bucket increases or decreases. However, at this time, it is not necessary to carry out the work of designating the sending source and the receiving destination.

  On the other hand, when there is a bucket (for example, a bucket having a relatively small block) in which the load element is to be scraped from another bucket in the load graph 21, the administrator assigns the load element to the bucket and the bucket. Identify buckets that are likely to be served and select them by left-clicking while holding down the shift key.

  After selecting two or more buckets in this manner, the administrator selects one bucket whose size of the block is to be changed from the selected buckets, and performs a drag operation using the upper side position of the block of the bucket as a starting point.

  Then, after starting the drag operation, when the mouse pointer is moved to the upper side of the upper side of the block, a bucket as a load element sending source and a load element as a movement target are selected (step S102; NO, S103; YES). , S111; NO, S112; NO, S115), and a temporary upper side indicating a block state when the load element temporarily moves to the receiving destination is shown in the sending source bucket and the receiving destination bucket. (Step S116, FIG. 21).

  Further, when the administrator moves the mouse pointer to the upper side beyond the temporary upper side while continuing the drag operation, the bucket as the load element sending source and the load element as the movement target are further selected. (Step S102; NO, S103; NO, S104; NO, S151; YES, S152), and then a new temporary upper side is shown above the mouse pointer, and a transmission source is newly selected. If it is a bucket, a new temporary upper side is indicated in the bucket, and if the sending source is an already selected bucket, the temporary upper side of the bucket is displayed at a position one level lower. (Step S153, FIG. 22).

  In addition, while continuing the drag operation, the administrator moves the mouse pointer beyond the position of the temporary upper side indicated above without moving the mouse pointer above the temporary upper side indicated previously. Then, the newly shown temporary upper side is deleted and the previously shown temporary upper side is shown again (step S102; NO, S103; NO, S104; YES, S151; NO, S155; YES, S156). , S157, FIG. 21).

  When the size of the block in the selected bucket becomes appropriate due to such an operation, when the administrator stops the drag operation, the temporary upper side becomes the upper side of the actual block. When the load management database 16a in the HDD 14 is updated, the display of the load graph 21 is updated (step S102; YES, S105).

  In this way, even when performing valley filling in the load graph 21, the administrator selects the target bucket and then drags the upper side of one bucket block to confirm the movement of the load element. It will be possible to determine how much the load on the bucket will increase or decrease before. However, at this time, it is not necessary to carry out the work of designating the sending source and the receiving destination.

  Further, according to the scheduling device 10 of the present embodiment, the load element receiving destination at the time of landslide, the sending source at the time of valley filling, and the load element to be moved are automatically selected. However, these selection methods can be set in advance using the first to third load editing setting screens 22 to 24 shown in FIG. As a result, when performing landslides or valley fillings, managers must consider whether the load level is leveled, the cost is minimized, or the inventory period is as short as possible. You do n’t have to.

(Appendix 1)
Computer
To define the number of parts to be delivered at one time as a load factor for a production line in a factory, in order to define in which unit period in which production line the specified load factor should be produced, Load storage means for storing correspondence information in which load elements are associated with production lines and unit periods in a storage device;
Based on the correspondence information in the storage device, a graph that two-dimensionally represents the size of the entire load composed of one or more load elements assigned to one unit period in one production line, A graph display means for displaying on a display device by dividing each unit period;
Load change accepting means for accepting an instruction for specifying one of the graphs whose size is to be changed from among the many graphs through an input device for operating a pointer;
When the pointer is inside the specific graph, the specific graph is determined as the transmission source, and when the pointer is within a predetermined range outside the specific graph, the specific graph is determined as the receiving destination. Graph attribute determination means,
When the operation graph attribute determining means determines that the specific graph is a transmission source, a predetermined priority is selected from the manufacturing line and the load element allocated to the unit period in which the size of the entire load is represented in the specific graph. A moving object determining means for selecting and determining the number of load elements according to the distance between the boundary line separating the inside and outside of the specific graph and the pointer according to the order;
When the movement target determining means determines a load element to be moved, a receiving destination determining means for determining a graph as a receiving destination of the load element from a remaining graph excluding the specific graph according to a predetermined priority order,
When the operation bucket attribute determining means determines the specific graph as the receiving destination, the manufacturing line in which the size of the entire load is represented in the remaining graphs excluding the specific graph and the load elements allocated to the unit period Then, according to a predetermined priority order, the number of load elements corresponding to the distance between the boundary line that separates the inside and outside of the specific graph and the pointer is selected and determined as a movement target, and these load elements are assigned. A transmission source determination means for determining a graph of a production line and a unit period as a transmission source;
When the load element to be moved is temporarily removed from the load whose size is represented in the graph determined as the transmission source by the operation graph attribute determination unit or the transmission source determination unit The boundary line of the graph representing the magnitude of the load composed of the remaining load elements is displayed as a temporary boundary line with a line type different from the source graph, and the operation graph attribute determining means or the receiving destination In the graph determined by the determination means as the receiving destination, the load size composed of all load elements when the load element to be moved is temporarily added to the load whose size is represented in the graph is represented. Temporary boundary line display means for displaying the boundary line of the graph as a temporary boundary line with a line type different from that of the receiving graph; and
When an instruction to end the display of the provisional boundary line is received through the input device, the load element allocation destination that is the movement target at the time of the end instruction is the receiving destination from the production line and unit period of the sending source graph A scheduling program that functions as an operation reflecting means for changing the correspondence information in the storage device so that the production line and unit period of the graph are changed.

(Appendix 2)
Said computer further
An instruction for selecting two or more graphs whose size is to be changed from a large number of graphs displayed by the graph display unit, and function as a change target graph reception unit that receives through an input device,
The load change receiving means operates a pointer with an instruction for specifying one graph whose size should be changed from two or more graphs selected through the instruction received by the change target graph receiving means. Accept through the input device to
The scheduling according to claim 1, wherein the reception destination determination unit and the transmission source determination unit determine a reception destination and a transmission source from a graph selected through an instruction received by the change target graph reception unit. program.

(Appendix 3)
The movement target determining means is configured to select the pointer and the upper side from a plurality of load elements according to a priority order selected in advance among a load element in descending order, a load element in ascending order, and an order in which delivery is early. The scheduling program according to appendix 1 or 2, wherein a number of load elements corresponding to the distance between the first and second load elements are selected and determined.

(Appendix 4)
Said computer further
For each of all the parts that can be produced in each production line, function as cost storage means for storing cost information indicating the production cost of each part in the production line in a storage device,
The receiving destination determining means is a priority order selected in advance from the order of decreasing load, the order of low manufacturing cost of load elements to be moved, and the order of shortening the inventory period of load elements to be moved. The scheduling according to appendix 1, 2, or 3, wherein the bucket to which the load element to be moved is received is determined from the remaining ones excluding the bucket that has been dragged from the designated bucket. program.

(Appendix 5)
Said computer further
For each of all the parts that can be produced in each production line, function as cost storage means for storing cost information indicating the production cost of each part in the production line in a storage device,
The transmission source determining means is configured in advance, in order of increasing load elements to be moved, in descending order of manufacturing cost of load elements to be moved, and in order of decreasing inventory period of load elements to be moved. In accordance with the selected priority order, the number of load elements corresponding to the distance between the pointer and the upper side is selected and determined as a movement target, and the bucket to which these load elements are assigned is determined as a transmission source. The scheduling program according to any one of appendices 1 to 4, characterized in that:

(Appendix 6)
To define the number of parts to be delivered at one time as a load factor for a production line in a factory, in order to define in which unit period in which production line the specified load factor should be produced, For a computer that stores correspondence information in which a load element is associated with a production line and a unit period in a storage device,
Based on the correspondence information in the storage device, a graph that two-dimensionally represents the size of the entire load composed of one or more load elements assigned to one unit period in one production line, Graph display procedure for displaying on the display device separately for each unit period,
A load change acceptance procedure for accepting, through an input device for operating a pointer, an instruction for specifying one of the plurality of graphs whose size is to be changed;
When the pointer is inside the specific graph, the specific graph is determined as the transmission source, and when the pointer is within a predetermined range outside the specific graph, the specific graph is determined as the receiving destination. Graph attribute determination procedure,
When the specific graph is determined as the transmission source in the operation graph attribute determination procedure, a predetermined line is selected from the manufacturing line and the load element assigned to the unit period in which the size of the entire load is represented in the specific graph. A moving object determination procedure for selecting and determining the number of load elements according to the distance between the boundary line separating the inside and outside of this specific graph and the pointer according to the priority order of
When a load element to be moved is determined in the moving object determination procedure, a receiving destination determination that determines a graph as a receiving destination of the load element from the remaining graphs excluding the specific graph according to a predetermined priority order. procedure,
When the specific graph is determined as the receiving destination in the operation bucket attribute determination procedure, the load element assigned to the production line and the unit period in which the size of the entire load is represented in the remaining graph excluding the specific graph In accordance with a predetermined priority order, the number of load elements corresponding to the distance between the boundary line separating the inside and outside of the specific graph and the pointer is selected and determined as a movement target, and these load elements are assigned. A transmission source determination procedure for determining a production line and a graph of a unit period as a transmission source,
When the load element to be moved is temporarily removed from the load whose size is represented in the graph determined as the transmission source in the operation graph attribute determination procedure or the transmission source determination procedure The boundary line of the graph representing the magnitude of the load consisting of the load elements that will remain in the graph is displayed as a temporary boundary line with a line type different from the source graph, and the operation graph attribute determination procedure or the acceptance The size of the load consisting of all the load elements when the load element to be moved is temporarily added to the load whose size is represented in the graph determined as the destination in the destination determination procedure A temporary boundary line display procedure for displaying a boundary line of a graph representing a boundary line as a temporary boundary line with a different line type from the receiving graph, and
When an instruction to end the display of the provisional boundary line is received through the input device, the load element allocation destination that is the movement target at the time of the end instruction is the receiving destination from the production line and unit period of the sending source graph A load graph editing method, comprising: executing an operation reflection procedure for changing the correspondence information in the storage device so that the production line and unit period of the graph are changed.

Configuration diagram of scheduling apparatus of this embodiment Diagram showing an example of a load graph The figure which shows an example of the data structure of a cost coefficient master table The figure which shows an example of three load edit setting screens Diagram showing the flow of load editing processing Diagram showing the flow of load editing processing Diagram showing the flow of load editing processing Diagram showing the flow of load editing processing The figure which shows an example of the data structure of a selection bucket information management table Diagram showing the flow of mobile load element determination processing Diagram showing the flow of mobile load element determination processing Explanatory diagram of padding value used to determine load element to be moved The figure which shows the flow of receiving bucket decision processing Explanatory drawing of padding value used for determination of receiving bucket The figure which shows the contents of the selection bucket information management table after registration processing The figure which shows an example of the load graph by which the temporary upper side was shown The figure which shows the flow of sending origin bucket decision processing Explanatory drawing of the padding value used to determine the source bucket The figure which shows the contents of the selection bucket information management table after registration processing The figure which shows an example of the load graph by which the temporary upper side was shown The figure which shows an example of the load graph by which the temporary upper side was shown The figure which shows an example of the load graph by which the temporary upper side was shown The figure which shows an example of the landslide in the conventional load graph The figure which shows an example of the landslide in the conventional load graph

Explanation of symbols

DESCRIPTION OF SYMBOLS 10 Scheduling apparatus 10a Display apparatus 10b Input apparatus 10c Main body 11 CPU
12 DRAM
14 HDD
16 Scheduling software 16a Load management database 16b Load editing module program 16c Cost coefficient master table

Claims (3)

Computer
To define the number of parts to be delivered at one time as a load factor for a production line in a factory, in order to define in which unit period in which production line the specified load factor should be produced, Load storage means for storing correspondence information in which load elements are associated with production lines and unit periods in a storage device;
Based on the correspondence information in the storage device, a graph that two-dimensionally represents the size of the entire load composed of one or more load elements assigned to one unit period in one production line, A graph display means for displaying on a display device by dividing each unit period;
Load change accepting means for accepting an instruction for specifying one of the graphs whose size is to be changed from among the many graphs through an input device for operating a pointer;
When the pointer is inside the specific graph, the specific graph is determined as the transmission source, and when the pointer is within a predetermined range outside the specific graph, the specific graph is determined as the receiving destination. Graph attribute determination means,
When the operation graph attribute determining means determines that the specific graph is a transmission source, a predetermined priority is selected from the manufacturing line and the load element allocated to the unit period in which the size of the entire load is represented in the specific graph. A moving object determining means for selecting and determining the number of load elements according to the distance between the boundary line separating the inside and outside of the specific graph and the pointer according to the order;
When the movement target determining means determines a load element to be moved, a receiving destination determining means for determining a graph as a receiving destination of the load element from a remaining graph excluding the specific graph according to a predetermined priority order,
When the operation bucket attribute determining means determines the specific graph as the receiving destination, the manufacturing line in which the size of the entire load is represented in the remaining graphs excluding the specific graph and the load elements allocated to the unit period Then, according to a predetermined priority order, the number of load elements corresponding to the distance between the boundary line that separates the inside and outside of the specific graph and the pointer is selected and determined as a movement target, and these load elements are assigned. A transmission source determination means for determining a graph of a production line and a unit period as a transmission source;
When the load element to be moved is temporarily removed from the load whose size is represented in the graph determined as the transmission source by the operation graph attribute determination unit or the transmission source determination unit The boundary line of the graph representing the magnitude of the load composed of the remaining load elements is displayed as a temporary boundary line with a line type different from the source graph, and the operation graph attribute determining means or the receiving destination In the graph determined by the determination means as the receiving destination, the load size composed of all load elements when the load element to be moved is temporarily added to the load whose size is represented in the graph is represented. Temporary boundary line display means for displaying the boundary line of the graph as a temporary boundary line with a line type different from that of the receiving graph; and
When an instruction to end the display of the provisional boundary line is received through the input device, the load element allocation destination that is the movement target at the time of the end instruction is the receiving destination from the production line and unit period of the sending source graph A scheduling program that functions as an operation reflecting means for changing the correspondence information in the storage device so that the production line and unit period of the graph are changed. Said computer further
An instruction for selecting two or more graphs whose size is to be changed from a large number of graphs displayed by the graph display unit, and function as a change target graph reception unit that receives through an input device,
The load change receiving means operates a pointer with an instruction for specifying one graph whose size should be changed from two or more graphs selected through the instruction received by the change target graph receiving means. Accept through the input device to
The said receiving destination determination means and the said transmission origin determination means determine an acceptance destination and a transmission origin from the graph selected through the instruction | indication which the said change object graph reception means received. Scheduling program. The movement target determining means is configured to select the pointer and the upper side from a plurality of load elements according to a priority order selected in advance among a load element in descending order, a load element in ascending order, and an order in which delivery is early. The scheduling program according to claim 1 or 2, wherein a number of load elements corresponding to the distance between the first and second load elements are selected and determined.