JP2007157124A - Schedule correcting device, schedule correcting program and schedule correcting method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To easily and appropriately correct a schedule which is an order of a plurality of jobs assigned to a plurality of resources in the plan creation of a production process. <P>SOLUTION: In a schedule correction program 30, when a job for correction selected directly from an external system, or with a keyboard 3A or a mouse 3B by a user and a specified assignment range are inputted, a CPU 21 (candidate extraction part 6) acquires the schedule 31 from a hard disk 4 to extract candidates of the corrected schedule satisfying predetermined restriction in which the job for correction can be assigned within the assignment range (S1-S3). Next, the CPU 21 (evaluation value calculation part 7) calculates predetermined evaluation values for all of the extracted candidates for the corrected schedule and the CPU 21 (candidate determining part 8) determines the corrected schedule in which the evaluation values become the best (S4, 5). Then, the CPU 21 (result display part 9) outputs the determined corrected schedule on a display 2 (S6). <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to a schedule correction apparatus, a schedule correction program, and a schedule correction method for correcting a schedule that is an order of a plurality of jobs assigned to a plurality of resources in production process planning.

  Conventionally, when creating a production process plan, for example, a schedule that is the order of jobs assigned to resources such as production equipment and workers displayed on a display unit such as a display as a Gantt chart is input using a mouse or a keyboard. A schedule technique for correcting by means has been developed.

  For example, there are techniques shown in Patent Document 1 and Patent Document 2. In these technologies, a Gantt chart is created by drawing on a display as one rectangle (tile) having a horizontal width from the processing start time to the processing end time in units of jobs (corresponding to one work in equipment). Display as a schedule. Usually, equipment is displayed on the vertical axis and time is displayed on the horizontal axis.

  In these technologies, when the schedule is corrected, the user first selects one of these jobs indicated by the tiles with the mouse or the keyboard, and then selects the selected job in the time axis direction or the facility axis direction or in the direction of those. Move in combination or change tile width (occupation time in equipment). Next, the schedule modification engine refers to the result of moving / changing, and it is simulated to satisfy the time constraints (no processing overlap, no time reversal in the preceding and following processes of the same product), and other equipment is included. Modify the entire schedule.

  In particular, the technique of Patent Document 1 is characterized in that the task is moved so that the setup change prohibited area and the setup change work do not overlap. The technique disclosed in Patent Document 2 is characterized in that a job that does not move in advance is designated by the user's intention when the entire schedule is corrected.

  Specifically, FIG. 25 shows an example of schedule display and correction according to the prior art. In FIG. 25, the schedule that is the work order of the job is shown as a Gantt chart for the process of manufacturing the three types of products 1, 2, and 3 using the four types of facilities A, B, C, and D. . In the figure, for example, a job relating to a process of manufacturing the product 1 using the equipment A is indicated by a tile as a job 1-A. In correcting the schedule, first, the equipment C (job 2-C) of the product 2 is moved between the job 1-C and the job 3-C with a mouse (first step). In this state, a time reversal occurs between the job 2-C and the job 2-D. Therefore, a simulation is performed by the schedule correction engine, and the job 2-D is moved after the job 1-D (second step).

  As described above, in the prior art, the schedule can be corrected by performing a simulation with the schedule correction engine while looking over the entire schedule and finding problems. In addition, an executable correction schedule can be obtained without greatly changing the initial schedule.

Japanese Patent Laid-Open No. 5-28161 JP-A-8-30686

  However, in the prior art, it is necessary for the user to strictly specify the destination of the job on the Gantt chart. For this reason, when there are many varieties and the operation restrictions are complicated, we know the availability of continuous processing between varieties, setup change time, alternative equipment conditions, and differences in processing capacity depending on equipment when specifying the destination. It was necessary and only a limited expert could operate. That is, when an unskilled person operates, the operation is performed while referring to the material describing the operation conditions, so that it takes time for the correction work and it is difficult to quickly correct the schedule.

  Also, in the initial schedule, if there is wasted time between jobs, or if work is stopped due to unscheduled events such as delayed delivery of raw materials or stoppage of orders, the production process will be freed up. In order to prevent this, there is a case where a new job or a job in a later process is desired to be allocated to the free time.

  However, if there are many job candidates that can be assigned to the free time, comprehensively consider operational restrictions such as setup change between product types, differences in processing time due to jobs, and effects on other planned jobs. It is necessary to determine the optimum allocation job by judgment, and it is difficult for even an expert to carry out accurately and in a short time.

  The object of the present invention has been made in view of the above problems, and it is possible to easily and appropriately modify a schedule which is an order of a plurality of jobs allocated to a plurality of resources in production process planning. The present invention provides a schedule correction device, a schedule correction program, and a schedule correction method.

  Another object of the present invention is to determine an optimum job in a short time from a plurality of job candidates for assignment at a designated assignment timing in order to solve the above-mentioned problem, and is not familiar with operation restrictions. To provide a schedule correction device, a schedule correction program, and a schedule correction method capable of easily and appropriately correcting a schedule even by a user.

Means and effects for solving the problems

  In order to solve the above-described problem, the schedule correction method according to the present invention includes a process for correcting a schedule, which is an order of a plurality of jobs assigned to a plurality of resources, in a production process plan creation with a predetermined evaluation value. A computer-based schedule correction method performed using a computer, wherein the computer calculates a predetermined evaluation value for a correction schedule allocated within the allocation range while satisfying a predetermined constraint condition for a correction target job to be corrected, The computer outputs a correction schedule based on the calculated evaluation value.

  According to this, the user does not specify the assignment destination of the correction target job strictly by limiting the time, work order, equipment, etc., but only by specifying the allocation range around this, based on a predetermined evaluation value. The allocation destination satisfying the predetermined constraint condition is output, and the schedule can be easily and appropriately corrected based on the evaluation value even if the user is not familiar with the operation constraint.

  A schedule correction apparatus according to the present invention is a schedule correction apparatus for correcting a schedule by accessing a storage means for recording a schedule which is an order of a plurality of jobs allocated to a plurality of resources in production process plan creation. The display means for displaying the schedule, the input means for inputting an instruction from the outside with reference to the schedule displayed on the display means, and the object to be corrected by the input means The correction target job or directly given correction target job and the allocation range of the correction target job specified by the input unit are received, the schedule is acquired, and the correction target job is allocated within the allocation range. Candidate extraction means for extracting a candidate for a correction schedule that satisfies a given predetermined constraint, and the evaluation value is the highest Characterized in that and a result displaying means for controlling to display become revised schedule on the display means.

  The schedule correction program according to the present invention is a process for correcting a schedule in a computer accessible to storage means for recording a schedule that is an order of a plurality of jobs assigned to a plurality of resources in production process planning. Is a schedule correction program for performing correction, and receives the correction target job selected as a target to be corrected or a directly given correction target job and the assigned range of the correction target job, and acquires the schedule Then, within the allocation range, candidates for correction schedules that satisfy predetermined constraint conditions that can be allocated to the correction target job are extracted, and predetermined evaluation values are calculated for all the candidates for the correction schedule, and the correction is performed. The correction schedule that gives the best evaluation value among the schedule candidates Constant, and characterized in that to carry out a process of outputting a revised schedule of the evaluation value is the best on the computer.

  The schedule correction method according to the present invention accesses a storage means for recording a schedule which is an order of a plurality of jobs assigned to a plurality of resources and a display means for displaying the schedule in the production process plan creation. A schedule correction method for correcting a schedule using a computer capable of receiving a correction target job selected as a correction target or a correction target job directly given, and an allocation range of the specified correction target job , Acquiring the schedule, extracting a correction schedule candidate that satisfies a predetermined constraint condition that the correction target job can be allocated within the allocation range, and calculating a predetermined evaluation value for all of the correction schedule candidates. And a correction schedule with the best evaluation value among the candidates for the correction schedule is calculated. Determine the Yuru, the evaluation value and displaying on display means a revised schedule to be best.

  According to this, the user does not specify the allocation destination of the correction target job strictly by limiting the time, work order, equipment, etc., but only by specifying the allocation range around here, it is predetermined within the allocation range. For each assignment destination that satisfies the above constraints, a predetermined evaluation value is calculated, and an optimal assignment destination with the best evaluation value is determined. Even if the user is not familiar with operation constraints, Correction can be easily and appropriately performed.

  Here, the schedule correction apparatus according to the present invention may further include warning output means for controlling to output a predetermined warning when the candidate extraction means cannot extract a correction schedule candidate.

  The schedule correction program according to the present invention may further cause the computer to perform a process of outputting a predetermined warning when the correction schedule candidate cannot be extracted.

  The schedule correction method according to the present invention may output a predetermined warning when the candidate for the correction schedule cannot be extracted.

  According to this, a warning is output when there is no allocation destination that satisfies the predetermined constraint in the allocation range specified as the allocation destination of the correction target job (for example, the schedule correction is performed in the allocation range on the display means) By informing the user, the user can take measures such as changing the allocation range, and even if the user is not familiar with the operational constraints, the schedule can be modified more easily and appropriately. Can be performed.

  Further, in the schedule correction device according to the present invention, the warning output means further adds predetermined identification information to the allocation range portion of the schedule and records it in the storage means, and the identification information is added. The schedule may be controlled to be displayed on the display means so that the display portion is displayed differently from the other portions.

  In addition, the schedule correction program according to the present invention records and adds predetermined identification information to the portion of the allocation range of the schedule and adds the identification information when the candidate for the correction schedule cannot be extracted. The computer may be further processed to output the schedule so that the output part has a different output method from the other parts.

  In the schedule correction method according to the present invention, when a candidate for the correction schedule cannot be extracted, a predetermined identification information is further added and recorded in the allocation range portion of the schedule, and the identification information is added. The schedule may be displayed on the display means so that the displayed part has a different display method from the other parts.

  According to this, the user can identify the allocation range once determined that there is no allocation destination satisfying the predetermined constraint condition and other parts, and when the user changes the allocation range, the predetermined constraint It is possible to prevent duplicate allocation ranges that are determined to have no allocation destination satisfying the condition, and to efficiently modify the schedule.

  Here, in the schedule correction device, the schedule correction program, and the schedule correction method according to the present invention, the correction target job is a job that is newly added to the schedule, and the correction schedule candidate is the correction target job. A correction schedule may be extracted by performing a simulation by interrupting between jobs of each resource within the allocation range that satisfies a predetermined constraint condition.

  As a result, it is possible to easily and appropriately modify a schedule for newly adding a job to an existing schedule.

  Here, in the schedule correction apparatus, the schedule correction program, and the schedule correction method according to the present invention, the correction target job is a job in the schedule, and the correction schedule candidate is a predetermined correction target job. A correction schedule may be extracted by performing a simulation by interrupting between jobs of each resource within the allocation range that satisfies the constraint conditions.

  This makes it possible to easily and appropriately modify the schedule for moving jobs on the existing schedule.

  Here, in the schedule correction apparatus, the schedule correction program, and the schedule correction method according to the present invention, the correction target job is a job in the schedule, and the correction schedule candidate is a predetermined correction target job. A correction schedule may be extracted by performing a simulation by replacing with any job within the allocation range that satisfies the constraint conditions.

  As a result, it is possible to easily and appropriately modify the schedule for replacing a specific job with another job on the existing schedule.

  In the present invention, a “job” means a unit corresponding to one operation at a resource (equipment or worker) in the production process plan creation of each product.

  In the present invention, the “correction schedule” means a schedule in which the schedule recorded in the storage means is corrected.

  In the present invention, “simulation” is a result of allocating a correction target job to an allocation range using a program such as a schedule correction engine according to the prior art, and schedules in other facilities with time constraints (processing does not overlap, This means that the entire schedule is modified to satisfy the same product).

  In the present invention, “output” includes not only display and printing but also the case of giving to other programs and devices as data.

  In the present invention, the “input means” means an interface for giving the CPU at least the selection of the correction target job and the designation of the allocation range of the correction target job, and an interface with the user such as a keyboard, a mouse, a voice input device, etc. The one that takes

  In the present invention, the “display means” means at least a schedule and a correction schedule for displaying to the user, such as a display.

  In the present invention, the “program” is not only a program that can be directly executed by a computer, but also a removable recording medium such as a CD-ROM (Compact Disc Read Only Memory) and a DVD (Digital Versatile Disk) and a fixed type such as a hard disk. Also included are those that can be executed by installing a recording medium distributed on a recording medium or distributed via a communication network such as the Internet by wired or wireless telecommunication means. Also included are those that are compressed or encrypted.

  The schedule correction apparatus according to the present invention accesses a storage means for recording a schedule which is the order of a plurality of jobs assigned to a plurality of resources in production process planning, and corrects the schedule. The display means for displaying the schedule, the input means for receiving an input operation from the outside in accordance with the schedule displayed on the display means, and the storage means in accordance with an instruction from the input means for making a determination And a control means for displaying the determination result on the display means and controlling the storage means to record the schedule modified according to the determination result. The control means is an object to be corrected by the input means. Selected multiple correction target jobs or directly given multiple correction target jobs and specified by the input means Recognizes the allocation range of a number of correction target jobs, recognizes the allocation range of the schedule, and corresponds to one job that can be allocated from a plurality of correction target jobs at one location in the allocation range due to production process restrictions A candidate extracting unit that extracts all job candidates that satisfy the constraint condition to be assigned, and virtually assigning all job candidates extracted by the candidate extracting unit one by one to the correction schedule, and virtually assigning all the job candidates An evaluation value calculating means for calculating the evaluation value of the correction schedule, and assigning a job candidate having the most appropriate evaluation value among the evaluation values for all job candidates calculated by the evaluation value calculating means to the correction schedule A candidate determination unit that can determine the correction schedule, and the correction schedule determined by the candidate determination unit on the display unit A result display unit that presents, is intended to include.

  The schedule correction program according to the present invention is a process for correcting a schedule in a computer that can access a storage device that records a schedule that is an order of a plurality of jobs assigned to a plurality of resources in production process planning. Is a schedule correction program for displaying the schedule, a display step for displaying the schedule, an input step for receiving an input operation from the outside according to the schedule displayed by the display step, and a memory for the instruction from the input step A control step for making a determination by accessing the device, displaying the determination result, and controlling the storage device to record the schedule modified according to the determination result. Multiple correction targets selected as correction targets Receive the multiple correction target jobs given directly or directly and the allocation range of the multiple correction target jobs specified in the input step, recognize the allocation range of the schedule, and from within the multiple correction target jobs Due to constraints, a candidate extraction step for extracting all job candidates that satisfy the constraint conditions corresponding to one job that can be allocated at one location in the allocation range, and one job candidate extracted by the candidate extraction step An evaluation value calculation step for calculating the evaluation value of the correction schedule virtually assigned to all the job candidates and assigning evaluation values for all job candidates calculated by the evaluation value calculation step. The job candidate with the most appropriate evaluation value is assigned to the schedule, and the correction schedule is determined. A candidate determining step that may, in which causes a result display step of displaying the modified schedule determined by the candidate determination step, to the computer.

  The schedule correction method according to the present invention is a schedule correction method for correcting a schedule by accessing a storage device that records a schedule that is the order of a plurality of jobs allocated to a plurality of resources in production process planning. And a step of displaying a schedule, a step of receiving an input operation from the outside according to the displayed schedule, a determination by accessing the storage device according to an input operation from the outside, and a result of the determination And controlling to record in the storage device the schedule modified according to the determination result, and the controlling step includes a plurality of correction target jobs selected as targets to be corrected or given directly Of the multiple correction target jobs specified and the multiple correction target jobs specified by the process that receives the input operation. Recognizing the range and recognizing the allocation range of the schedule, the job that satisfies the constraints corresponding to one job that can be allocated at one location in the allocation range due to restrictions on the production process from within multiple correction target jobs A candidate extraction step for extracting all candidates, and an evaluation value calculation for virtually assigning all extracted job candidates to a schedule one by one and calculating an evaluation value for a correction schedule virtually assigned to all job candidates A candidate determination step in which a correction candidate can be determined by assigning a job candidate having the most appropriate evaluation value to the schedule among the evaluation values for all the calculated job candidates, and the determined correction schedule And a result display step for displaying.

  According to this, when there are a lot of unplanned jobs (for example, newly received orders, jobs that have a delivery date and are planned for the next time), the user can assign resources such as resources and work order on the existing schedule. ”Is specified, the influence of the additional planning at the allocation destination is simulated for each unplanned job, and the best job is determined by evaluating the simulation result. As a result, a new job can be easily and appropriately added to an existing schedule even if the user is not familiar with operation restrictions, equipment capacity, and the like.

  The schedule correction apparatus according to the present invention accesses a storage means for recording a schedule which is the order of a plurality of jobs assigned to a plurality of resources in production process planning, and corrects the schedule. The display means for displaying the schedule, the input means for receiving an input operation from the outside in accordance with the schedule displayed on the display means, and the storage means in accordance with an instruction from the input means for making a determination And a control unit for controlling the display unit to display the determination result on the display unit and to record the schedule corrected according to the determination result on the storage unit, and the control unit includes a plurality of display units displayed on the display unit. Based on the job to be corrected and the allocation range of multiple jobs to be corrected specified by the input means, the allocation range of the schedule And candidate extraction means for extracting all job candidates that satisfy a constraint condition corresponding to one job that can be allocated at one location in the allocation range due to restrictions on the production process from a plurality of correction target jobs, Evaluation value calculation means for virtually assigning all job candidates extracted by the candidate extraction means to the schedule one by one and calculating evaluation values of the correction schedule virtually assigned to all job candidates; and evaluation value calculation A candidate determination unit capable of allocating a job candidate having the most appropriate evaluation value among the evaluation values for all job candidates calculated by the unit to determine a correction schedule, and the candidate determination unit And a result display means for displaying the correction schedule on the display unit.

  The schedule correction program according to the present invention performs a process for correcting a schedule in a computer that can access a storage device that records a schedule that is an order of a plurality of jobs assigned to a plurality of resources in production process planning. A display step for displaying a schedule, an input step for receiving an input operation from the outside according to the schedule displayed by the display step, and a storage device according to an instruction from the input step And a control step for controlling to display the result of the determination, display the result of the determination, and record the schedule modified according to the result of the determination in the storage device, and the control step is displayed in the display step. Multiple correction target jobs and input steps One job that can be assigned at one place in the allocation range due to restrictions on the production process from within the plurality of correction target jobs by receiving the allocation range of the multiple correction target jobs A candidate extraction step for extracting all job candidates that satisfy the constraint condition corresponding to the above, and all job candidates extracted by the candidate extraction step are virtually assigned to the schedule one by one, and all of the job candidates are virtually The evaluation value calculation step for calculating the evaluation value of the assigned correction schedule, and the job candidate with the most appropriate evaluation value among the evaluation values for all job candidates calculated by the evaluation value calculation step is assigned to the schedule for correction. Candidate determination step that can determine the schedule, and the time determined by the candidate determination step And result display step of displaying the revised schedule, in which to perform the computer.

  The schedule correction method according to the present invention is a schedule correction method for correcting a schedule by accessing a storage device that records a schedule that is the order of a plurality of jobs allocated to a plurality of resources in production process planning. And a step of displaying a schedule, a step of receiving an input operation from the outside according to the displayed schedule, a determination by accessing the storage device according to an input operation from the outside, and a result of the determination And controlling to record the schedule modified according to the determination result in the storage device, and the controlling step includes a plurality of correction target jobs displayed in the displaying step and an input operation. Receiving the allocation range of multiple jobs to be modified specified by the process that receives Candidate extraction process that extracts all job candidates that satisfy the constraint condition corresponding to one job that can be allocated at one location in the allocation range due to restrictions on the production process from a plurality of correction target jobs, and all extracted Evaluation value calculation step of virtually assigning job candidates one by one to a schedule and calculating evaluation values of correction schedules virtually assigned to all job candidates, and evaluation values for all calculated job candidates Among these, a candidate determination step that can assign a job candidate having the most appropriate evaluation value to a schedule and determine a correction schedule, and a result display step that displays the determined correction schedule are included.

  According to this, if there are a lot of movable jobs (for example, jobs that have been delayed due to delivery or jobs that do not need to be rushed) among the planned jobs that you want to change the work time and order, By simply specifying the “assignment destination” such as resources and work order, the impact of additional planning on the assignment destination is simulated for each movable job, and the best job is evaluated by evaluating the simulation results. Is determined. As a result, even if the user is not familiar with operation restrictions and equipment capabilities, the job can be easily and appropriately transferred to the existing schedule.

  Hereinafter, the best mode for carrying out a schedule correction apparatus, a schedule correction program, and a schedule correction method according to the present invention will be described based on a specific example with reference to the drawings.

[First embodiment]
First, the schedule correction apparatus according to the first embodiment will be described with reference to FIG. FIG. 1 is a block diagram showing the overall configuration of the schedule correction apparatus according to the first embodiment.

  As shown in FIG. 1, the schedule correction device 1 includes a display unit (display unit) 2, an input unit (input unit) 3, a storage unit (storage unit) 4, and a control unit 5. The control unit 5 includes a candidate extraction unit (candidate extraction unit) 6, an evaluation value calculation unit (evaluation value calculation unit) 7, a candidate determination unit (candidate determination unit) 8, and a result display unit (result display unit). 9.

  The storage unit 4 stores an existing (initial state) schedule. The existing schedule is recorded based on, for example, another program for creating a production process plan, or is directly recorded by the user via the input unit 3. The display unit 2 is for displaying a schedule.

  The input unit 3 is for a user to input a command from the outside while viewing the schedule displayed on the display unit 2. Here, the command includes a correction target job to be selected as a correction target and an allocation range specified as an approximate range to which the correction target job is allocated.

  The control unit 5 is for controlling the candidate extraction unit 6, the evaluation value calculation unit 7, the candidate determination unit 8, and the result display unit 9.

  The candidate extraction unit 6 is based on a correction target job selected as a target to be corrected by the input unit 3 or a correction target job directly given by an external system and the allocation range of the correction target job specified by the input unit 3. This is for extracting correction schedule candidates that satisfy predetermined constraint conditions that can be allocated to the correction target job within the allocation range of the schedule.

Here, the following jobs correspond to the correction target jobs.
1. Jobs to be newly added instead of existing scheduled jobs such as limited express jobs (hereinafter referred to as “additional jobs”)
2. A job that is in an existing schedule and that moves, such as a job that may cause a delay in delivery (hereinafter referred to as a “migration source job”).
3. If you do not want to change the operating rate of each facility as much as possible before and after the schedule correction, other jobs in the existing schedule, such as jobs that are replaced in the same facility, etc. Job to be replaced (hereinafter referred to as “replacement source job”).
When the correction target job is an additional job, the correction target job is selected by the user through the input unit 3 or directly provided by an external system or the like. When the user selects a correction target job with the input unit 3, the user selects from the one or a plurality of additional jobs displayed in addition to the schedule on the display unit 2 with the input unit 3, or the user inputs An additional job is selected manually from section 3. In addition, when a job to be directly corrected is given by an external system, etc., for example, when an order with a short delivery time is generated in a production management system linked with an order receiving system, data is automatically transferred to this system as an express job. It is also assumed that orders that need to be rebuilt quickly due to equipment troubles or quality abnormalities in the lower process are automatically transferred from the production management system as additional jobs. When the correction target job is a movement source job or a replacement source job, the correction target job is selected and given by the user from the jobs displayed as a schedule on the display unit 2 using the input unit 3.

  The allocation range is a range in which the job to be corrected is allocated. For example, when the schedule displayed on the display unit 2 is indicated by a Gantt chart with the horizontal axis as time and the vertical axis as equipment, the user By operating the input unit 3, the allocation range is designated on the horizontal axis and the vertical axis.

  The predetermined constraint condition is, for example, an operation condition such as an operation restriction that is not possible due to a combination of usable equipment and front and rear varieties, and is registered in advance in the storage unit 4 and read out by the candidate extraction unit 6. . In addition, if the correction target job is an additional job, the correction schedule candidate that satisfies the predetermined constraint that can be assigned to the correction target job is determined by considering the predetermined restriction condition and adding the correction target job to be added within the allocation range. A correction schedule is extracted that has been simulated by interrupting the assignable position (between jobs of each facility). In addition, when the correction target job is a job that is in the existing schedule and is to be moved, considering the predetermined condition, the position to which the correction target job to be moved can be allocated within the allocation range (job and job of each facility) The correction schedule that was simulated during In addition, if the job to be corrected is a job in an existing schedule and is to be replaced with another job, the correction target job to be replaced is replaced with a replaceable job within the allocation range in consideration of predetermined conditions. Extract the simulation schedule that was simulated. Note that the simulation uses a program such as a schedule correction engine according to the prior art to assign the correction target job to the allocation range, and the schedule in other equipment is time-constrained (the processes before and after the same product that do not overlap) This is done by modifying the entire schedule so that the time is satisfied.

  The evaluation value calculation unit 7 is for calculating a predetermined evaluation value for all of the correction schedule candidates extracted by the candidate extraction unit 6. Here, the predetermined evaluation value is calculated using an evaluation index in a general schedule technique, such as the sum of the setup change times, the sum of the delivery delay times, and the completion time of the final job.

  The candidate determination unit 8 is for determining a correction schedule having the best evaluation value from all the correction schedule candidates whose evaluation values are calculated by the evaluation value calculation unit 7. Here, whether or not the evaluation value is the best is determined based on the evaluation index in the general schedule used in the evaluation value calculation unit 7 and the purpose of the schedule.

  The result display unit 9 is for controlling the display unit 2 to display a correction schedule that provides the best evaluation value determined by the candidate determination unit 8. In other words, the correction schedule with the best evaluation value determined by the candidate determination unit 8 is output to the display unit 2 via the output interface of the control unit 5. Note that the output interface is a program or hardware that performs data conversion and communication for output to the display unit 2.

  Next, a hardware configuration of the computer 20 when the control unit 5 of the schedule correction device 1 according to the first embodiment is realized using the CPU 21 will be described with reference to FIG. FIG. 2 is a block diagram illustrating a hardware configuration of a computer when the control unit of the schedule correction device according to the first embodiment is realized using a CPU.

  As shown in FIG. 2, the CPU 21 of the computer 20 includes a memory 22, a display 2 as a display unit, a keyboard 3A and a mouse 3B as input units, a hard disk 4 as a storage unit, and a CD-ROM drive 23. And are connected. The hard disk 4 stores a schedule correction program 30, a schedule 31, and an operating system (OS) 32. In the first embodiment, the schedule correction program 30 is a program that causes the CPU 21 to function as the candidate extraction unit 6, the evaluation value calculation unit 7, the candidate determination unit 8, and the result display unit 9 described above. Installed from the CD-ROM.

  Next, the processing procedure of the schedule correction program 30 according to the first embodiment will be described with reference to FIG. FIG. 3 is a flowchart illustrating the processing procedure of the schedule correction program according to the first embodiment. The schedule correction program 30 is read by the CPU 21 from the hard disk 4 and performs the processing of FIG. 3 in cooperation with the operating system 32. It should be noted that part or all of the processing may be performed by the schedule correction program 30 alone.

  As shown in FIG. 3, first, a correction target job selected from the keyboard 3A or the mouse 3B with reference to the schedule 31 displayed on the display 2 by the user, or a correction target job directly given from an external system, etc. With reference to the schedule 31 displayed on the display 2, the assignment range of the correction target job designated from the keyboard 3A or the mouse 3B is input (step S1).

  Then, the CPU 21 (candidate extraction unit 6) acquires the schedule 31 from the hard disk 4 (step S2), and extracts a correction schedule candidate that satisfies a predetermined constraint that the correction target job can be allocated within the allocation range ( Step S3).

  Next, the CPU 21 (evaluation value calculation unit 7) calculates a predetermined evaluation value for all of the extracted correction schedule candidates (step S4). And CPU21 (candidate determination part 8) determines the correction schedule from which an evaluation value becomes the best (step S5).

  Finally, the CPU 21 (result display unit 9) outputs the determined correction schedule to the display 2 (step S6).

  The process of the schedule correction program according to the first embodiment described above can be processed as a schedule correction method according to the first embodiment using a computer.

  Next, with respect to an example in which the schedule is actually corrected using the schedule correction device, the schedule correction program, and the schedule correction method according to the first embodiment, the replacement is performed when the correction target job is an additional job, or a moving job. The description will be made with reference to FIGS. In addition, in this example, the production process which processes a raw material with the six installations from the installation 1 to the installation 6, and manufactures a product is made into object. The product shall be processed only once in any one of the six facilities.

<When the job to be modified is an additional job>
1) On the display 2, as shown in FIG. 4, a schedule 31 stored in the hard disk 4 is shown in a Gantt chart. Then, the user is based on the minimum attributes (for example, product type and delivery date) of the job J10 to be selected as the job to be corrected from the three jobs of the new jobs J10, J11, and J12 displayed on the display 2. The allocation range of the correction target job is designated on the Gantt chart using the mouse 3B. In FIG. 4, the assigned range is indicated within the frame indicated by the broken line.
2) The user clicks on the icon corresponding to job J10 from the icons corresponding to the three jobs J10, J11, and J12 displayed on the display 2 with the mouse 3B until the specified allocation range is reached. By dragging, J10 is selected as a correction target job.
3) Next, as shown in FIG. 5, the CPU 21 can allocate the correction target job J10 within the allocation range specified in 2) (equipment and work sequence, that is, between jobs of each facility. ) Here, with reference to the operation conditions stored in the hard disk 4 in advance, candidates for positions that can be allocated (that is, candidates for allocation positions) are automatically searched. FIG. 5 shows that there are positions that cannot be assigned to equipment 1 and equipment 4 (that is, positions that cannot be assigned due to operational restrictions).
4) Then, the CPU 21 calculates respective evaluation values for the correction schedule candidates in which the correction target job J10 is interrupted to all the possible position candidates and the simulation is performed. Finally, as shown in FIG. 6, the CPU 21 determines a correction schedule having the best evaluation value among all the correction schedule candidates, and displays the correction schedule on the display 2 in a Gantt chart. FIG. 6 shows that the evaluation value is the best in the correction schedule in which the correction target job J10 is interrupted after the job J13 of the facility 2 and the simulation is performed. Further, due to the effect of interrupting the correction target job J10 after the job J13 of the facility 2, a job (job indicated as “affected job” in FIG. 6) that was initially after the job J13 of the facility 2 is displayed. It turns out that it shifts later in time.

<When the job to be corrected is a moved job>
1) On the display 2, as shown in FIG. 7, a schedule 31 stored in the hard disk 4 is shown in a Gantt chart. Then, it is assumed that the user selects job J2 as a correction target job from among the jobs displayed on the display 2.
2) Then, based on the minimum attributes (for example, product type and delivery date) of job J2, the allocation range of the correction target job is designated on the Gantt chart using mouse 3B. In FIG. 7, an assigned range (“movement destination range” in FIG. 7) indicated within a frame indicated by a broken line is shown.
3) The user clicks the icon corresponding to the job J2 displayed on the display 2 with the mouse 3B and drags it to the designated allocation range, thereby selecting J2 as the correction target job.
4) Next, as shown in FIG. 8, the CPU 21 can allocate the correction target job J2 within the allocation range specified in 2) (equipment and work order, that is, between the jobs of each facility. ) Here, with reference to the operation conditions stored in the hard disk 4 in advance, candidates for positions that can be allocated (that is, candidates for allocation positions) are automatically searched. FIG. 8 shows that there are positions that cannot be assigned to equipment 2, equipment 5, and equipment 6 (that is, positions that cannot be assigned due to operational restrictions).
5) Then, the CPU 21 calculates respective evaluation values for the correction schedule candidates in which the correction target job J2 is interrupted to all the possible position candidates and the simulation is performed. Finally, as shown in FIG. 9, the CPU 21 determines a correction schedule having the best evaluation value among all the correction schedule candidates, and displays the correction schedule on the display 2 in a Gantt chart. FIG. 9 shows that the evaluation value is the best in the correction schedule in which the correction target job J2 is interrupted after the job J7 of the facility 6 and the simulation is performed. In addition, due to the effect of job J2 being removed from equipment 1, the jobs that were originally after job J2 in equipment 1 (jobs indicated as “affected jobs” in FIG. 9) are shifted forward in time. You can see that Due to the effect of interrupting the correction target job J2 after the job J7 of the facility 6, the job that was initially after the job J7 of the facility 6 (the job shown as “affected job” in FIG. 9) is temporal. It can be seen that there was a shift later.

<When the job to be modified is a replacement job>
1) On the display 2, as shown in FIG. 10, the schedule 31 stored in the hard disk 4 is shown in a Gantt chart. Then, it is assumed that the user selects job J4 as a correction target job from among the jobs displayed on the display 2.
2) Based on the minimum attributes (for example, product type and delivery date) of job J4, the allocation range of the job to be corrected is designated on the Gantt chart using the mouse 3B. In FIG. 10, an allocation range (“replacement destination search range” in FIG. 10) designated within a frame indicated by a broken line is shown.
3) The user selects J4 as a job to be corrected by clicking on the icon corresponding to job J4 displayed on the display 2 with the mouse 3B and dragging it to the designated allocation range.
4) Next, as shown in FIG. 11, the CPU 21 searches for a job that can be replaced with the correction target job J4 within the allocation range specified in 2). Here, referring to the operation conditions stored in the hard disk 4 in advance, candidates for replaceable jobs (that is, candidates for replacement destination jobs) are automatically searched. However, two types of operation conditions are determined when the correction target job J4 that is the replacement source job moves to the replacement destination job and when the replacement destination job moves to the correction target job J4 that is the replacement source job. It is extracted as a candidate only when the above operating conditions are also satisfied. FIG. 11 shows that four jobs have not been adopted as replacement destination job candidates for the correction target job J4.
5) Then, the CPU 21 calculates respective evaluation values for the correction schedule candidates that are simulated by replacing all the replacement destination job candidates with the correction target job J4. Finally, as shown in FIG. 12, the CPU 21 determines a correction schedule with the best evaluation value among all the correction schedule candidates, and displays the correction schedule on the display 2 in a Gantt chart. FIG. 12 shows that the job J5 of the facility 2 is determined as the replacement destination job, and the correction schedule obtained by performing the simulation by replacing the job J4 with the correction target job has the best evaluation value. In addition, because job J5 is replaced with correction target job J4 and job J5 has a longer work time than correction target job J4, job J5 and subsequent jobs (as “affected jobs” in FIG. It can be seen that the job shown) is shifted later in time.

  As described above, according to the schedule correction device, the schedule correction program, and the schedule correction method according to the first embodiment, the user strictly limits the allocation destination of the correction target job by limiting the time, work order, equipment, and the like. Instead of designating, just by designating the allocation range around here, when the allocation range is allocated to the allocation destination that satisfies the predetermined constraint condition, the predetermined evaluation value is calculated, and the evaluation value is the best Thus, even if the user is not familiar with the operation restrictions, the schedule can be easily and appropriately corrected.

[Second Embodiment]
In the second embodiment, a user is notified of a predetermined warning when a correction schedule candidate that satisfies a predetermined constraint condition that the correction target job can be assigned in the first embodiment cannot be extracted.

  First, the schedule correction apparatus according to the second embodiment will be described with reference to FIG. FIG. 13 is a block diagram showing the overall configuration of the schedule correction apparatus according to the second embodiment. In addition, the same code | symbol is attached | subjected about the part same as the schedule correction apparatus which concerns on 1st embodiment, and the description is abbreviate | omitted.

  The control unit 5 of the schedule correction device 1a according to the second embodiment includes a warning output unit 10 in addition to the control unit 5 of the schedule correction device 1a according to the first embodiment.

  The warning output unit 10 outputs a predetermined warning when the candidate extraction unit 6 cannot extract a correction schedule candidate, and adds predetermined identification information to the portion of the allocation range of the correction target job designated by the input unit 3 Then, the schedule is recorded in the storage unit 4, and the schedule is displayed on the display unit 2 so that the part to which the identification information is added has a different display method from the other part. Here, the predetermined warning means means for notifying the user that the candidate for the correction schedule cannot be extracted by the candidate extraction unit 6, and for example, a warning “No possible candidate” is displayed on the display unit 2. Or sound a warning sound. The predetermined identification information means a flag or the like. Also, the different display method means, for example, changing the display color.

  The hardware configuration of the computer 20 when the control unit 5 of the schedule correction device 1a according to the second embodiment is realized using the CPU 21 is the same as that of the first embodiment shown in FIG. The description is omitted.

  Next, the processing procedure of the schedule correction program 30 according to the second embodiment will be described with reference to FIG. FIG. 14 is a flowchart illustrating the processing procedure of the schedule correction program according to the second embodiment.

  First, a correction target job selected from the keyboard 3A or the mouse 3B with reference to the schedule 31 displayed on the display 2 by the user or a correction target job directly given from an external system or the like, and a schedule displayed on the display 2 by the user Referring to FIG. 31, the assignment range of the correction target job designated from the keyboard 3A or the mouse 3B is input (step S11).

  The CPU 21 (candidate extraction unit 6) acquires the schedule 31 from the hard disk 4 (step S12), and extracts a correction schedule candidate that satisfies a predetermined constraint that the correction target job can be allocated within the allocation range (step S13). ), It is determined whether there is a correction schedule candidate that can be extracted (step S17).

When there are correction schedule candidates that can be extracted (step S17: YES),
The CPU 21 (evaluation value calculation unit 7) calculates a predetermined evaluation value for all of the extracted correction schedule candidates (step S14). And CPU21 (candidate determination part 8) determines the correction schedule from which an evaluation value becomes the best (step S15).

  Finally, the CPU 21 (result display unit 9) outputs the determined correction schedule to the display 2 (step S16).

  On the other hand, if there is no correction schedule candidate that can be extracted (step S17: NO), the CPU 21 (warning output unit 10) outputs a warning (step S18), and also the keyboard 3A or mouse on the display 2 by the user in step S11. Identification information is added to the allocation range of the correction target job specified from 3B and recorded in the schedule 31 of the hard disk 4 so that the display method of the part to which the identification information of the schedule 31 is added differs from the other part. The schedule 31 is displayed on the display 2.

  The process of the schedule correction program according to the second embodiment described above can be processed as a schedule correction method according to the second embodiment using a computer.

  Next, with respect to an example in which the schedule is actually corrected using the schedule correction device and schedule correction program according to the second embodiment, and the schedule correction method, the schedule correction device and schedule correction program according to the first embodiment, In addition, an example in which the schedule is actually corrected using the schedule correction method (when the correction target job is an additional job) will be described with reference to FIG.

  In the above 3), when the CPU 21 searches for a position (equipment and work order, that is, between jobs of each equipment) where the correction target job J10 can be allocated within the allocation range specified in 2). If there is no position where the correction target job J10 can be allocated within the range, the display 2 displays “no possible candidate” and changes only the display color of the allocated range as shown in FIG. The schedule 31 is displayed on the display 2.

  As described above, according to the schedule correction device, the schedule correction program, and the schedule correction method according to the second embodiment, there is an allocation destination that satisfies a predetermined constraint condition in the allocation range specified as the allocation destination of the correction target job. If there is not, a warning is output (for example, a message indicating that the schedule cannot be corrected in the allocation range on the display means), and the user takes measures such as changing the allocation range. Even if the user is not familiar with the operation restrictions, the schedule can be corrected more easily and appropriately. In addition, the user can identify the allocation range once determined that there is no allocation destination satisfying the predetermined constraint condition and other parts, and when the user changes the allocation range, It is possible to prevent overlapping allocation ranges determined to have no allocation destination to be satisfied, and to efficiently perform schedule correction.

  The preferred embodiments of the present invention have been described above. However, the present invention is not limited to the above-described embodiments, and various modifications can be made as long as they are described in the claims.

  In the above-described embodiment, the correction target job is one job. However, a plurality of continuous jobs can be collectively set as the correction target job (see FIG. 16). In this case, it is possible to perform simulation by extracting candidate correction schedules that can be allocated while maintaining the initial order of a plurality of consecutive jobs, or each of a plurality of consecutive jobs can be allocated. Simulation may be performed by extracting correction schedule candidates for all combinations. The former is characterized in that the amount of calculation in the simulation is small and the calculation time is fast, while the latter is characterized in that the calculation amount in the simulation is large but a better correction schedule may be obtained.

[Third embodiment]
In the third embodiment, a schedule correction apparatus, a schedule correction program, and a schedule correction method that can determine an optimum job in a short time from a plurality of job candidates for allocation at a specified allocation timing will be described.

  The overall configuration of the schedule correction device 1b according to the third embodiment is the same as the overall configuration according to the second embodiment (see FIG. 13). In addition, in this example, the production process which processes a raw material with the six installations from the installation 1 to the installation 6, and manufactures a product is made into object. The product shall be processed only once in any one of the six facilities.

  FIG. 17 is a flowchart for explaining an example of a processing procedure of the schedule correction program 30 according to the third embodiment. Moreover, FIGS. 18-20 is a figure which shows an example of the image of the display 2 for demonstrating the schedule correction program which concerns on 3rd embodiment.

  As in the first or second embodiment, the CPU 21 reads the schedule correction program 30 recorded on the hard disk 4 and performs the processing of FIG. 17 in cooperation with the operating system 32.

  As shown in FIG. 17, first, the user inputs a plurality of additional job candidates (step S21). The plurality of additional job candidates here are additional job groups related to a job for an article for which a rapid delivery request has been requested or a job for a new request.

  Next, the CPU 21 reads the schedule 31 from the hard disk 4 (step S22). In the present embodiment, the schedule 31 is read from the hard disk 4. However, the present invention is not limited to this, and the schedule 31 may be automatically read every predetermined time.

  Subsequently, a part of the Gantt chart of the schedule 31 displayed on the display 2 is instructed by the user using the keyboard 3A or the mouse 3B. The CPU 21 recognizes the assignment position of the additional job candidate by recognizing the operation of the keyboard 3A or the mouse 3B as the input means (step S23).

  The CPU 21 extracts additional job candidates that can be allocated based on predetermined conditions (step S24). Here, the predetermined conditions are only the operation time and operation conditions of the additional job candidate.

  Specifically, the operation condition is compared with the conditions of a process having a predetermined operation time and a free time corresponding to the free time of the schedule 31. Thereby, the CPU 21 can easily extract a condition corresponding to the schedule 31 and delete an additional job candidate that cannot be reliably assigned. That is, it is possible to reduce the calculation burden or calculation time for the additional job candidate to be deleted.

  Here, if the CPU 21 cannot extract an additional job candidate that can be allocated based on a predetermined condition, the CPU 21 instructs the display 2 to display a warning (step S25). The user confirms the display on the display 2 and instructs a part of the Gantt chart of the schedule 31 again with the keyboard 3A or the mouse 3B. The CPU 21 recognizes the operation of the keyboard 3A or the mouse 3B, which is an input means, and determines whether or not there is a re-instruction on the allocation position of the additional job candidate (step S26). When it is determined that there is no re-instruction of the allocation position, the CPU 21 repeats the processes of step S25 and step S26.

  On the other hand, when the CPU 21 determines that there is a re-instruction of the allocation position, the CPU 21 returns to the process of step S24 and repeats the process of step S24.

  In the process of step S24, if the CPU 21 determines that there is an extraction of an additional job candidate that can be allocated based on a predetermined condition, the CPU 21 selects one additional job candidate that can be allocated (step S28).

  Subsequently, the CPU 21 adds an additional job candidate to the allocation job candidate position, executes a simulation (step S29), and calculates an evaluation value (step S30). Here, as an evaluation value, an evaluation index of a general schedule such as a total sum of setup times, a sum of delays in delivery time, a completion time of a final job, and a total production amount within a predetermined period is used.

  The CPU 21 determines whether or not all additional job candidates that can be allocated have been evaluated (step S31). Specifically, the CPU 21 calculates an evaluation value when each additional job candidate is added to the schedule 31 when there are a plurality of additional job candidates that can be allocated in the process of step S24. If the CPU 21 determines that all the additional job candidates have not been evaluated, it repeats the processing from step S28 to step S31 again.

  If the CPU 21 determines that all the additional job candidates have been evaluated, that is, if the CPU 21 determines that the evaluation values have been calculated individually for all the additional job candidates, the additional job candidate having the best evaluation value is assigned to the assigned position. Allocation is performed (step S32).

  As a result, it is possible to determine one optimum job in a short time from a plurality of addition candidate addition jobs for the designated allocation position.

  Next, with respect to an example in which the schedule is actually corrected using the schedule correction device, the schedule correction program, and the schedule correction method according to the third embodiment, the case where the correction target is an additional job is based on FIGS. I will explain.

  1) As shown in FIG. 18, the display 2 shows a schedule 31 stored in the hard disk 4 in a Gantt chart. Then, the user selects an additional job candidate to be corrected from the additional job candidates displayed on the display 2 using the keyboard 3A or the mouse 3B.

  For example, in FIG. 18, nine additional job candidates of jobs J20 to J28 are displayed on the display 2. The user selects six additional job candidates SL, jobs J20 to J25, from the nine additional job candidates. Here, it is assumed that the additional job candidate SL includes a plurality of job candidates.

  Note that the additional job candidate may be input as a new ordering job by the user, or may be added from an external system.

  2) The user designates the job assignment position on the Gantt chart using the mouse 3B, and clicks the mouse 3B or depresses the keyboard 3A to confirm the assignment position. Specifically, the facility and the work order are specified. For example, FIG. 18 shows a case where the position after the first job of the facility 3 is designated as the allocation position.

  3) Next, it is individually determined whether or not a predetermined constraint is satisfied for each of the assignable additional job candidates SL selected in 1) with respect to the assignment position specified in 2).

Here, the predetermined constraint is, for example, a constraint such as whether each facility has a usable facility in the production of each job of the additional job candidate SL, or whether there is no problem in the combination with the preceding and succeeding job types. Specifically, it is performed by referring to the master in which the restriction is recorded. In FIG. 19, among the additional job candidates SL, the job J21 and the job J23 have a problem in combination with either the equipment of the equipment 3 or the first job and / or the third job of the equipment 3 and are designated. This indicates that production cannot be performed at the assigned position.
4) Next, for all the additional job candidates that can be worked at the designated allocation position extracted in 3), a simulation is performed when each job is added to the allocation designation position, and an evaluation value is calculated for each. Here, the evaluation value indicates an evaluation index of a general schedule such as a total sum of setup times, a sum of delays in delivery time, a completion time of a final job, and a total production amount within a predetermined period. In addition, we decided to use general schedule evaluation indices such as total setup time, sum of delays in delivery, final job completion time, and total production volume within a specified period as evaluation values. Any condition or index may be used.

  5) Subsequently, among all the candidates for the additional job, the job having the best evaluation value is assigned to the assignment designated position, and the simulation result is displayed on the display 2 as a Gantt chart. FIG. 20 shows a case where the additional job candidate J22 is determined as the best additional job.

  In addition, it can be seen that three jobs after J22 of the equipment 3 are shifted later in time due to the influence.

  If there is no additional job candidate that can be allocated in the above 3), a warning “There is no job that can be added” is displayed on the display 2 to prompt the user to change the allocation position.

[Fourth embodiment]
In the fourth embodiment, for a designated allocation position, a plurality of jobs are selected from a group of jobs planned on the initial schedule, and one optimum job is selected from the plurality of job groups in a short time. A schedule correction apparatus, a schedule correction program, and a schedule correction method that can be moved will be described.

  The overall configuration of the schedule correction device 1c according to the fourth embodiment is the same as the overall configuration according to the second embodiment (see FIG. 13) and the overall configuration according to the third embodiment. In addition, in this example, the production process which processes a raw material with the six installations from the installation 1 to the installation 6, and manufactures a product is made into object. The product shall be processed only once in any one of the six facilities.

  FIG. 21 is a flowchart illustrating an example of a processing procedure of the schedule correction program 30 according to the fourth embodiment. FIGS. 22 to 24 are diagrams illustrating an example of an image of the display 2 for explaining the schedule correction program according to the fourth embodiment.

  As in the first, second, or third embodiment, the CPU 21 reads the schedule correction program 30 recorded on the hard disk 4 and performs the processing of FIG. 21 in cooperation with the operating system 32. Hereinafter, an outline of the operation of the CPU 21 will be described, and a specific example will be described later using the display 2.

  As shown in FIG. 21, first, the CPU 21 reads the schedule 31 from the hard disk 4 (step S41). In the present embodiment, the schedule 31 is read from the hard disk 4. However, the present invention is not limited to this, and the schedule 31 may be automatically read every predetermined time. In this case, the schedule correction program is started when the process of step S42 described later is started.

  Next, the user inputs a plurality of source job candidates (step S42). Here, the plurality of migration source job candidates mean jobs that are likely to be late for delivery or jobs whose delivery date has changed. Note that for the input of a plurality of movement source job candidates, a part of the Gantt chart of the schedule 31 displayed on the display 2 by the user is designated by the keyboard 3A or the mouse 3B.

  Subsequently, a part of the Gantt chart of the schedule 31 displayed on the display 2 is instructed by the user using the keyboard 3A or the mouse 3B. The CPU 21 recognizes the assignment position of the source job candidate by recognizing the operation of the keyboard 3A or the mouse 3B as the input means (step S43).

  The CPU 21 extracts move source job candidates that can be assigned based on predetermined conditions (step S44). Here, the predetermined condition is to determine only the operation time and the operation condition of the migration source job candidate.

  Specifically, the operation condition is compared with the conditions of a process having a predetermined operation time and a free time corresponding to the free time of the schedule 31. Thereby, the CPU 21 can easily extract the condition corresponding to the schedule 31 and delete the migration source job candidate that cannot be reliably assigned. That is, it is possible to reduce the calculation burden or calculation time for the migration source job to be deleted.

  Here, when the CPU 21 cannot extract a transfer source job candidate that can be assigned based on a predetermined condition, the CPU 21 instructs the display 2 to display a warning (step S45). The user confirms the display on the display 2 and instructs a part of the Gantt chart of the schedule 31 again with the keyboard 3A or the mouse 3B. The CPU 21 recognizes the operation of the keyboard 3A or the mouse 3B as the input means, and determines whether or not there is a re-instruction of the assignment position of the source job candidate (step S46). When it is determined that there is no re-instruction of the allocation position, the CPU 21 repeats the processes of step S45 and step S46.

  On the other hand, if the CPU 21 determines that there is a re-instruction of the allocation position, the CPU 21 returns to the process of step S44 and repeats the process of step S44.

  In the process of step S44, when the CPU 21 determines that there is extraction of a transfer source job candidate that can be allocated based on a predetermined condition, the CPU 21 selects one transfer source job candidate that can be allocated (step S48).

  Subsequently, the CPU 21 adds a movement source job candidate to the allocation job candidate position, executes a simulation (step S49), and calculates an evaluation value (step S50). Here, as an evaluation value, an evaluation index of a general schedule such as a total sum of setup times, a sum of delays in delivery time, a completion time of a final job, and a total production amount within a predetermined period is used.

  The CPU 21 determines whether or not all transferable job candidates that can be allocated have been evaluated (step S51). Specifically, in the process of step S44, the CPU 21 calculates an evaluation value when each of the migration source job candidates is added to the schedule 31 when there are a plurality of assignable migration source job candidates. When the CPU 21 determines that all the movement source job candidates have not been evaluated, the CPU 21 repeats the processing from step S48 to step S51 again.

  If the CPU 21 determines that all the migration source job candidates have been evaluated, that is, if the CPU 21 determines that evaluation values have been calculated individually for all the migration source job candidates, the CPU 21 assigns the migration source job candidate with the best evaluation value. It is assigned to the designated position (step S52).

  As a result, it is possible to determine one optimal job in a short time from a plurality of allocation candidate transfer source jobs for the specified allocation position.

  Next, with respect to an example in which the schedule is actually corrected by using the schedule correction device, the schedule correction program, and the schedule correction method according to the fourth embodiment, the case where the correction target is a movement source job is shown in FIGS. This will be explained based on.

  1) The display 2 shows a schedule 31 stored in the hard disk 4 as a Gantt chart as shown in FIG. Then, the user selects a source job candidate to be corrected from among a plurality of jobs displayed on the display 2 using the keyboard 3A or the mouse 3B.

  For example, in FIG. 22, six movement source job candidates of jobs J31 to J36 are displayed on the display 2. The user selects six movement source job candidates SL1 of jobs J31 to J36 from the movement source job candidates. Here, it is assumed that the source job candidate SL1 includes a plurality of job candidates.

  2) The user designates the job assignment position on the Gantt chart using the mouse 3B, and clicks the mouse 3B or depresses the keyboard 3A to confirm the assignment position. Specifically, the facility and the work order are specified. For example, FIG. 23 shows a case where the position after the first job of the facility 3 is designated as the allocation position.

  3) Next, for each of the allocation positions specified in 2), it is individually determined whether or not a predetermined constraint is satisfied for each of the transferable source job candidates SL1 selected in 1).

Here, the predetermined constraint is, for example, a constraint such as whether each facility has a usable facility in the production of the migration source job candidate SL1, or whether there is no problem in the combination with the preceding and succeeding job types. Specifically, it is performed by referring to the master in which the restriction is recorded. In FIG. 23, among the job candidates SL1, the job J31 and the job J36 have a problem in combining with either the equipment of the equipment 3 or the first job and / or the third job of the equipment 3. This indicates that production cannot be performed at the assigned position.
4) Next, a simulation is performed for each of the migration source job candidates that can be worked at the specified allocation position extracted in 3), and an evaluation value is calculated for each job. Here, the evaluation value indicates an evaluation index of a general schedule such as a total sum of setup times, a sum of delays in delivery time, a completion time of a final job, and a total production amount within a predetermined period. In addition, we decided to use general schedule evaluation indices such as total setup time, sum of delays in delivery, final job completion time, and total production volume within a specified period as evaluation values. Any condition or index may be used.

  5) Subsequently, among all the candidates for the movement source job, the job having the best evaluation value is assigned to the assignment designation position, and the simulation result is displayed on the display 2 as a Gantt chart. FIG. 24 shows a case where the migration source job candidate J34 is determined as the best migration source job.

  Further, it can be seen that five jobs after J34 of the equipment 3 are shifted later in time due to the influence. Further, due to the influence of job J34 being removed from equipment 4, the jobs that have been after job J34 in equipment 4 (jobs indicated as “affected jobs” in FIG. 24) shift forward in time. . In addition, in the above 4), when there is no candidate for additional job that can be allocated, a warning “There is no job that can be added” is output to prompt the operator to change the allocation position.

  In the above 3), when there is no candidate of a transfer source job that can be allocated, a warning “There is no job that can be added” is displayed on the display 2 to prompt the user to change the allocation position.

It is a block diagram which shows the whole structure of the schedule correction apparatus which concerns on 1st embodiment. It is a block diagram which shows the hardware constitutions of the computer at the time of implement | achieving the control part of the schedule correction apparatus which concerns on 1st embodiment using CPU. It is a flowchart explaining the procedure of the process of the schedule correction program which concerns on 1st embodiment. In the case where the correction target job is an additional job, the schedule correction apparatus and schedule correction program according to the first embodiment, and the schedule correction method are examples of actually correcting the schedule, selecting the correction target job, An example in which an allocation range is specified is shown. This is an example in which the schedule is actually corrected by using the schedule correction device, the schedule correction program, and the schedule correction method according to the first embodiment when the correction target job is an additional job, and an example in which allocation position candidates are extracted Is shown. This is an example in which the schedule is actually corrected using the schedule correction device, the schedule correction program, and the schedule correction method according to the first embodiment when the correction target job is an additional job, and the determined correction schedule is displayed. An example is shown. When the correction target job is a moving job, the schedule correction apparatus and schedule correction program according to the first embodiment, and the schedule correction method are examples of actually correcting the schedule, and the correction target job is selected. An example in which an allocation range is specified is shown. This is an example in which the schedule is actually corrected by using the schedule correction device, the schedule correction program, and the schedule correction method according to the first embodiment when the correction target job is a moving job, and an example in which allocation position candidates are extracted Is shown. This is an example in which the schedule is actually corrected using the schedule correction device, the schedule correction program, and the schedule correction method according to the first embodiment when the correction target job is a moving job, and the determined correction schedule is displayed. An example is shown. In the case where the correction target job is a replacement job, the schedule correction apparatus and schedule correction program according to the first embodiment, and the schedule correction method are examples of actually correcting the schedule, selecting the correction target job, An example in which an allocation range is specified is shown. This is an example in which the schedule is actually corrected using the schedule correction device, the schedule correction program, and the schedule correction method according to the first embodiment when the correction target job is a replacement job, and candidates for replacement destination jobs are extracted. An example is shown. This is an example in which the schedule is actually corrected using the schedule correction device, the schedule correction program, and the schedule correction method according to the first embodiment when the correction target job is a replacement job, and the determined correction schedule is displayed. An example is shown. It is a block diagram which shows the whole structure of the schedule correction apparatus which concerns on 2nd embodiment. It is the flowchart explaining the procedure of the process of the schedule correction program which concerns on 2nd embodiment. This is an example in which the schedule is actually corrected using the schedule correction device, the schedule correction program, and the schedule correction method according to the first embodiment when the correction target job is a moving job, and the allocation position candidate cannot be extracted. Shows an example of changing the display method of the allocation range and displaying the schedule. It is an example in which a schedule is actually corrected using the schedule correction device, the schedule correction program, and the schedule correction method according to the present embodiment, and shows an example in which a plurality of continuous correction target jobs are selected and an allocation range is specified. ing. It is a flowchart explaining an example of the process sequence of the schedule correction program 30 which concerns on 3rd embodiment. It is a figure which shows an example of the image of the display for demonstrating the schedule correction program which concerns on 3rd embodiment. It is a figure which shows an example of the image of the display for demonstrating the schedule correction program which concerns on 3rd embodiment. It is a figure which shows an example of the image of the display for demonstrating the schedule correction program which concerns on 3rd embodiment. It is a flowchart explaining an example of the procedure of the process of the schedule correction program which concerns on 4th embodiment. It is a figure which shows an example of the image of the display for demonstrating the schedule correction program which concerns on 4th embodiment. It is a figure which shows an example of the image of the display for demonstrating the schedule correction program which concerns on 4th embodiment. It is a figure which shows an example of the image of the display for demonstrating the schedule correction program which concerns on 4th embodiment. The example of the display and correction of a schedule by a prior art is shown.

Explanation of symbols

1 Schedule Correction Device 2 Display Unit (Display)
3 Input unit 3A Keyboard 3B Mouse 4 Storage unit (hard disk)
6 candidate extraction unit 7 evaluation value calculation unit 8 candidate determination unit 9 result display unit 10 warning output unit 20 computer 30 schedule correction program 31 schedule

Claims (31)

A schedule correction device for correcting a schedule by accessing a storage means for recording a schedule that is an order of a plurality of jobs assigned to a plurality of resources in production process planning,
Display means for displaying the schedule;
With reference to the schedule displayed on the display means, input means for inputting a command from the outside,
A correction target job selected as a target to be corrected by the input means or a correction target job given directly;
In response to the allocation range of the correction target job specified by the input means, the schedule is acquired, and correction schedule candidates satisfying a predetermined constraint condition that the correction target job can be allocated within the allocation range are obtained. Candidate extraction means for extracting;
Evaluation value calculation means for calculating a predetermined evaluation value for all of the candidates for the correction schedule;
Candidate determination means for determining a correction schedule with the best evaluation value from among the correction schedule candidates;
A result display means for controlling the display means to display the correction schedule with the best evaluation value;
A schedule correction apparatus comprising: A warning output means for controlling to output a predetermined warning when a candidate for the correction schedule cannot be extracted by the candidate extraction means;
The schedule correction apparatus according to claim 1, further comprising:   The warning output means further adds predetermined identification information to the allocation range portion of the schedule and records it in the storage means, and a display method in which the portion to which the identification information is added is different from other portions; The schedule correction apparatus according to claim 2, wherein the schedule is controlled to be displayed on the display unit. The correction target job is a job to be newly added to the schedule,
The correction schedule candidate extracts the correction schedule by performing a simulation by interrupting the job to be corrected between jobs of each resource within the allocation range that satisfies a predetermined constraint condition. 4. The schedule correction device according to any one of 3. The correction target job is a job in the schedule,
The correction schedule candidate extracts the correction schedule by performing a simulation by interrupting the job to be corrected between jobs of each resource within the allocation range that satisfies a predetermined constraint condition. 4. The schedule correction device according to any one of 3. The correction target job is a job in the schedule,
The candidate for the correction schedule performs a simulation by replacing the job to be corrected with any job within the allocation range that satisfies a predetermined constraint condition, and extracts a correction schedule. The schedule correction apparatus as described in any one of Claims. A schedule correction device for correcting a schedule by accessing a storage means for recording a schedule that is an order of a plurality of jobs assigned to a plurality of resources in production process planning,
Display means for displaying the schedule;
Input means for receiving an input operation from the outside according to the schedule displayed on the display means;
According to an instruction from the input unit, the storage unit is accessed to make a determination, the determination result is displayed on the display unit, and a schedule modified according to the determination result is recorded in the storage unit. Control means to control,
The control means includes
In response to a plurality of correction target jobs selected as targets to be corrected by the input means or a plurality of correction target jobs directly given, and an allocation range of the plurality of correction target jobs specified by the input means, Recognize the allocation range of the schedule, and select all job candidates that satisfy the constraint condition corresponding to one job that can be allocated at one place in the allocation range due to the restrictions on the production process from among the plurality of correction target jobs Candidate extraction means for extracting;
Evaluation value calculating means for virtually assigning all the job candidates extracted by the candidate extracting means to the schedule one by one and calculating the evaluation value of the virtually assigned correction schedule for all of the job candidates When,
Candidate determination means capable of allocating a job candidate having the most appropriate evaluation value among evaluation values for all job candidates calculated by the evaluation value calculation means to determine a correction schedule;
And a result display means for causing the display section to display the correction schedule determined by the candidate determination means. A schedule correction device for correcting a schedule by accessing a storage means for recording a schedule which is an order of a plurality of jobs allocated to a plurality of resources in production process planning,
Display means for displaying the schedule;
Input means for receiving an input operation from the outside according to the schedule displayed on the display means;
According to an instruction from the input unit, the storage unit is accessed to make a determination, the determination result is displayed on the display unit, and a schedule modified according to the determination result is recorded in the storage unit. Control means to control,
The control means includes
Receiving a plurality of correction target jobs displayed on the display means and an allocation range of the plurality of correction target jobs designated by the input means, the allocation range of the schedule is recognized, and the plurality of correction target jobs Candidate extraction means for extracting all job candidates that satisfy the constraint condition corresponding to one job that can be allocated at one location in the allocation range due to restrictions on the production process from within,
Evaluation value calculating means for virtually assigning all the job candidates extracted by the candidate extracting means to the schedule one by one and calculating the evaluation value of the virtually assigned correction schedule for all of the job candidates When,
Candidate determination means capable of allocating a job candidate having the most appropriate evaluation value among evaluation values for all job candidates calculated by the evaluation value calculation means to determine a correction schedule;
And a result display means for causing the display section to display the correction schedule determined by the candidate determination means.   9. The schedule correction device according to claim 7, further comprising warning output means for controlling to output a predetermined warning when the candidate for correction schedule cannot be extracted by the candidate extraction means.   The warning output means further adds predetermined identification information to the allocation range portion of the schedule and records it in the storage means, and a display method in which the portion to which the identification information is added is different from other portions; The schedule correction apparatus according to claim 9, wherein the schedule is controlled to be displayed on the display unit. A schedule correction program for causing a computer capable of accessing a storage means for recording a schedule which is an order of a plurality of jobs assigned to a plurality of resources to perform a process for correcting the schedule in production process planning. ,
The correction target job selected as a target to be corrected or the correction target job directly given and the allocation range of the specified correction target job, the schedule is acquired, and the correction target is within the allocation range A candidate for a correction schedule that satisfies a predetermined constraint that can be assigned by a job is extracted, a predetermined evaluation value is calculated for all of the candidates for the correction schedule, and the evaluation value is the best among the candidates for the correction schedule. The schedule correction program for making a computer perform the process which determines the correction schedule which becomes and outputs the correction schedule from which the said evaluation value becomes the best.   12. The schedule correction program according to claim 11, further causing the computer to perform a process of outputting a predetermined warning when the correction schedule candidate cannot be extracted.   When the candidate for the correction schedule cannot be extracted, an output method in which predetermined identification information is further added and recorded in the portion of the allocation range of the schedule, and the portion to which the identification information is added is different from other portions The schedule correction program according to claim 12, further causing the computer to perform a process of outputting the schedule so that The correction target job is a job to be newly added,
The correction schedule candidate extracts the correction schedule by performing a simulation by interrupting the job to be corrected between jobs of each resource within the allocation range that satisfies a predetermined constraint condition. 14. The schedule correction program according to any one of items 13. The correction target job is a job in the schedule,
The correction schedule candidate extracts the correction schedule by performing a simulation by interrupting the job to be corrected between jobs of each resource within the allocation range that satisfies a predetermined constraint condition. 14. The schedule correction program according to any one of items 13. The correction target job is a job in the schedule,
The candidate for the correction schedule performs a simulation by exchanging the job to be corrected with any job in the allocation range that satisfies a predetermined constraint condition, and extracts a correction schedule. The schedule correction program according to any one of the above. A schedule correction program for causing a computer that can access a storage device that records a schedule, which is an order of a plurality of jobs assigned to a plurality of resources, in a production process plan, to perform a process for correcting the schedule. ,
A display step for displaying the schedule;
An input step for receiving an input operation from the outside according to the schedule displayed by the display step;
Control to access the storage device in accordance with an instruction from the input step, display the result of the determination, and record the correction schedule corrected in accordance with the result of the determination in the storage device And a control step to
The control step includes
In response to a plurality of correction target jobs selected as correction targets in the input step or a plurality of correction target jobs directly given, and an allocation range of the plurality of correction target jobs specified in the input step, Recognize the allocation range of the schedule, and select all job candidates that satisfy the constraint condition corresponding to one job that can be allocated at one place in the allocation range due to the restrictions on the production process from among the plurality of correction target jobs A candidate extraction step to extract;
Evaluation value calculation step of virtually assigning all the job candidates extracted in the candidate extraction step to the schedule one by one and calculating the evaluation value of the virtually assigned correction schedule for all of the job candidates When,
A candidate determination step capable of allocating a job candidate having the most appropriate evaluation value among the evaluation values for all job candidates calculated by the evaluation value calculation step to determine the correction schedule;
A schedule correction program that causes the computer to perform a result display step of displaying the correction schedule determined in the candidate determination step. A schedule correction program for causing a computer that can access a storage device that records a schedule, which is an order of a plurality of jobs assigned to a plurality of resources, in a production process plan, to perform a process for correcting the schedule. ,
A display step for displaying the schedule;
An input step for receiving an input operation from the outside according to the schedule displayed by the display step;
Control to access the storage device in accordance with an instruction from the input step, display the result of the determination, and record the correction schedule corrected in accordance with the result of the determination in the storage device And a control step to
The control step includes
Receiving a plurality of correction target jobs displayed in the display step and an allocation range of the plurality of correction target jobs specified in the input step, the allocation range of the schedule is recognized, and the plurality of correction target jobs A candidate extraction step for extracting all job candidates that satisfy a constraint condition corresponding to one job that can be allocated at one location in the allocation range due to restrictions on the production process from within,
Evaluation value calculation step of virtually assigning all the job candidates extracted in the candidate extraction step to the schedule one by one and calculating the evaluation value of the virtually assigned correction schedule for all of the job candidates When,
A candidate determination step capable of allocating a job candidate having the most appropriate evaluation value among the evaluation values for all job candidates calculated by the evaluation value calculation step to determine the correction schedule;
A schedule correction program that causes the computer to perform a result display step of displaying the correction schedule determined in the candidate determination step.   The schedule correction program according to claim 17 or 18, further comprising a step of outputting a predetermined warning when the candidate for the correction schedule cannot be extracted.   When the candidate for the correction schedule cannot be extracted, an output method in which predetermined identification information is further added and recorded in the portion of the allocation range of the schedule, and the portion to which the identification information is added is different from other portions The schedule correction program according to claim 19, further causing a computer to perform the step of outputting the schedule so that A schedule correction method using a computer that performs a process of correcting a schedule that is an order of a plurality of jobs assigned to a plurality of resources in a production process plan creation, using a predetermined evaluation value,
The computer calculates a predetermined evaluation value for a correction schedule that is allocated within the allocation range while satisfying a predetermined constraint condition for the correction target job to be corrected,
The computer outputs a correction schedule based on the calculated evaluation value. A schedule for correcting a schedule using a computer capable of accessing a storage means for recording a schedule that is the order of a plurality of jobs assigned to a plurality of resources and a display means for displaying the schedule in production process planning A correction method,
The correction target job selected as a target to be corrected or the correction target job directly given and the allocation range of the specified correction target job, the schedule is acquired, and the correction target is within the allocation range A candidate for a correction schedule that satisfies a predetermined constraint that can be assigned by a job is extracted, a predetermined evaluation value is calculated for all of the candidates for the correction schedule, and the evaluation value is the best among the candidates for the correction schedule. The schedule correction method is characterized in that a correction schedule having the best evaluation value is displayed on a display means.   23. The schedule correction method according to claim 22, wherein a predetermined warning is output when the candidate for the correction schedule cannot be extracted.   When the candidate for the correction schedule cannot be extracted, a display method is further provided in which predetermined identification information is added to and recorded in the allocation range portion of the schedule, and the portion to which the identification information is added is different from other portions The schedule correction method according to claim 23, wherein the schedule is displayed on the display means so that The correction target job is a job to be newly added,
The correction schedule candidate extracts the correction schedule by performing a simulation by interrupting the job to be corrected between jobs of each resource within the allocation range that satisfies a predetermined constraint condition. The schedule correction method according to any one of 24. The correction target job is a job in the schedule,
The correction schedule candidate extracts the correction schedule by performing a simulation by interrupting the job to be corrected between jobs of each resource within the allocation range that satisfies a predetermined constraint condition. The schedule correction method according to any one of 24. The correction target job is a job in the schedule,
25. The correction schedule candidate performs the simulation by replacing the job to be corrected with any job in the allocation range that satisfies a predetermined constraint condition, and extracts a correction schedule. The schedule correction method as described in any one of Claims. A schedule correction method for correcting a schedule by accessing a storage device that records a schedule that is an order of a plurality of jobs allocated to a plurality of resources in production process planning,
Displaying the schedule;
Receiving an input operation from outside in accordance with the displayed schedule;
Control to make a determination by accessing the storage device in response to an external input operation, display the determination result, and record the correction schedule corrected in accordance with the determination result in the storage device Comprising the steps of:
The controlling step includes
In response to a plurality of correction target jobs selected as targets to be corrected or a plurality of correction target jobs directly given, and an allocation range of the plurality of correction target jobs specified by the step of receiving the input operation, Recognizes the allocation range of the schedule and extracts all job candidates that satisfy the constraints corresponding to one job that can be allocated at one location in the allocation range due to the restrictions on the production process from the plurality of correction target jobs Candidate extraction process to
An evaluation value calculation step of virtually assigning all of the extracted job candidates one by one to the schedule, and calculating an evaluation value of the virtually assigned correction schedule for all of the job candidates;
A candidate determination step capable of determining a correction schedule by assigning a job candidate having the most appropriate evaluation value among the calculated evaluation values for all job candidates to the schedule;
And a result display step of displaying the determined correction schedule. A schedule correction method for correcting a schedule by accessing a storage device that records a schedule that is an order of a plurality of jobs allocated to a plurality of resources in production process planning,
Displaying the schedule;
Receiving an input operation from outside in accordance with the displayed schedule;
Control to make a determination by accessing the storage device in response to an external input operation, display the determination result, and record the correction schedule corrected in accordance with the determination result in the storage device Comprising the steps of:
The controlling step includes
Receiving the plurality of correction target jobs displayed in the displaying step and the allocation range of the plurality of correction target jobs designated by the step of receiving the input operation, recognizing the allocation range of the schedule, A candidate extraction step for extracting all job candidates that satisfy the constraint conditions corresponding to one job that can be allocated at one location in the allocation range due to restrictions on the production process from within the correction target job;
An evaluation value calculation step of virtually assigning all of the extracted job candidates one by one to the schedule, and calculating an evaluation value of the virtually assigned correction schedule for all of the job candidates;
A candidate determination step capable of determining a correction schedule by assigning a job candidate having the most appropriate evaluation value among the calculated evaluation values for all job candidates to the schedule;
And a result display step of displaying the determined correction schedule.   30. The schedule correction method according to claim 28, further comprising a step of outputting a predetermined warning when the correction schedule candidates cannot be extracted.   When the candidate for the correction schedule cannot be extracted, a display method is further provided in which predetermined identification information is added to and recorded in the allocation range portion of the schedule, and the portion to which the identification information is added is different from other portions 31. The schedule correction method according to claim 30, further comprising a step of displaying the schedule so that

Images