JP7082530B2 - Scheduling device, scheduling method and program - Google Patents

Description

The present invention relates to a scheduling device, a scheduling method and a program.

For example, in Patent Document 1, a work schedule of a board processing apparatus is created, which includes a work schedule of transporting a plurality of substrates whose work has been performed in parallel and at individual timings by a plurality of processing units to a predetermined transport destination. Scheduling devices are disclosed. In the apparatus described in Patent Document 1, at the time of carrying out after the cleaning process, a sequential carrying-out flow in which a plurality of boards are sequentially carried out or a batch carrying-out flow in which a plurality of boards are collectively carried out is selected. According to the apparatus described in Patent Document 1, when it is determined that the batch transfer flow completes the delivery of a plurality of substrates earlier than the sequential transfer flow, the substrate processing apparatus is adopted by adopting the batch transfer flow. The throughput is improved.

Further, in Patent Document 2, among a plurality of schedule information obtained by shifting the startable time of any of the plurality of processes until the predetermined number of times or the predetermined calculation time expires, the schedule with the earliest process completion time A scheduling device that determines information as optimal schedule information is disclosed. According to the apparatus described in Patent Document 2, a plurality of schedule information can be compared to create a schedule for completing a product at the earliest.

Japanese Patent No. 6105982 Japanese Patent No. 5344939

In batch processing such as heat treatment and surface treatment, and in the process of automatically processing a plurality of parts unmanned using a robot or the like, the following points may have to be taken into consideration when making a work plan. That is, in batch processing, for example, in a furnace capable of simultaneously charging a large number of parts, a plurality of parts are simultaneously processed in one process. Therefore, in batch processing, the start time of processing is the same for all parts, and the completion time is also the same for all parts. On the other hand, in unmanned machining, for example, multiple parts with different working times are machined at the same time, but the worker cannot enter the area around the machining equipment during machining, and the parts are machined from the equipment until the machining of all parts is completed. It may not be possible to remove it. In this case, the work start time is the same for all parts, and the completion time is also the same for all parts. That is, when making a work plan for batch processing or unmanned processing, it may be necessary to consider synchronization of the start time and the completion time for a plurality of operations.

However, in the conventional scheduling device, for example, it is determined for each component whether or not the work for each component can be started, and if it can be started, a schedule is created so that the work is started at that timing. That is, in such a scheduling device, it is not possible to consider the case where the start time and the completion time of the work must be the same. Therefore, such a scheduling device cannot be applied to batch processing or unmanned processing processes. Therefore, when using such a scheduling device, either manually modify the schedule created by the scheduling device, or manually schedule using a tool such as spreadsheet software without using such a scheduling device. I have no choice but to create.

The present invention has been made in view of the above circumstances, and an object of the present invention is to provide a scheduling device, a scheduling method, and a program capable of creating a schedule in consideration of simultaneous start of a plurality of operations.

In order to solve the above problem, one aspect of the present invention is a group of resources when allocating a job to be allocated to a resource to be allocated, which is one of a group of resources that need to be synchronized in start time. A determination unit that determines whether or not the start time of another job allocated to another resource in the group of resources has already been recorded at the latest allocation time related to the group, and the latest allocation related to the group of resources. If it is determined that the start time of the other job allocated to the other resource is not recorded at the time, the allocation target job is allocated to the allocation target resource and the allocation target is set as the latest allocation time. If it is determined that the start time of another job allocated to the other resource is recorded in the recording unit that records the start time of the job and the latest allocation time related to the group of resources, the allocation target A scheduling device having an allocation unit that determines whether or not the job start time matches the time recorded as the latest allocation time, and if it matches, allocates the allocation target job to the allocation target resource. be.

Further, one aspect of the present invention is the scheduling device, in which the first completion time, which is the completion time of the allocation target job, is calculated when the start time of the allocation target job is recorded as the latest allocation time. When the calculated first completion time is later than the latest scheduled release time of the group of resources, the recording unit updates the first completion time as the latest scheduled release time. The allocation unit sets the start time of the next job of the allocation target job to be allocated to the group of resources to the updated latest scheduled release time.

Further, one aspect of the present invention is the scheduling device, in which the determination unit makes the determination when the job is started within the work shift.

Further, one aspect of the present invention is the scheduling device, in which the determination unit makes the determination when all the jobs to be performed before have been completed.

Further, one aspect of the present invention is the scheduling device, in which the determination unit makes the determination when a predetermined working time constraint is satisfied.

Further, one aspect of the present invention is the scheduling device, wherein the work time constraint is (1) the difference between the start of the previous job and the start of the subsequent job is within a certain time, a certain time or more, or a certain time or less. (2) The difference from the start of the previous job to the scheduled completion of the later job is within a certain period of time, more than a certain time or less than a certain time, and (3) after the completion of the previous job. The difference until the start of the job is within a certain time, more than a certain time, or less than a certain time, and (4) the difference from the completion of the previous job to the scheduled completion of the later job is within a certain time, more than a certain time, or It is either less than a certain period of time.

Further, one aspect of the present invention is the latest allocation time related to the group of resources when the allocation target job is allocated to the allocation target resource which is any one of the group resources that need to synchronize the start time. In addition to the step of determining whether or not the start time of another job allocated to another resource in the group of resources has already been recorded, and the latest allocation time of the group of resources. When the start time of another job allocated to the resource is not recorded, the step of allocating the allocation target job to the allocation target resource and recording the start time of the allocation target job as the latest allocation time, and When the start time of another job allocated to the other resource is recorded in the latest allocation time related to the group of resources, the time when the start time of the job to be allocated is recorded as the latest allocation time. It is a scheduling method including a step of determining whether or not a match is made, and if the match is found, a step of allocating the allocation target job to the allocation target resource.

Further, one aspect of the present invention is the latest allocation time related to the group of resources when the allocation target job is allocated to the allocation target resource which is any one of the group resources that need to synchronize the start time. In addition to the step of determining whether or not the start time of another job allocated to another resource in the group of resources has already been recorded, and the latest allocation time of the group of resources. When the start time of another job allocated to the resource is not recorded, the step of allocating the allocation target job to the allocation target resource and recording the start time of the allocation target job as the latest allocation time, and When the start time of another job allocated to the other resource is recorded in the latest allocation time related to the group of resources, the time when the start time of the job to be allocated is recorded as the latest allocation time. This is a program that causes a computer to execute a step of allocating the job to be allocated to the resource to be allocated, and a step of allocating the job to be allocated to the resource to be allocated.

According to each aspect of the present invention, the schedule can be created in consideration of simultaneous starts.

It is a block diagram which shows the structural example of the scheduling apparatus which concerns on one Embodiment of this invention. It is a figure which shows a part of the configuration example of the job table 31 shown in FIG. It is a figure which shows a part of the configuration example of the resource master 32 shown in FIG. It is a figure for demonstrating the configuration example of the constraint condition table 33 shown in FIG. It is a figure for demonstrating the configuration example of the constraint condition table 33 shown in FIG. It is a flowchart which shows the operation example of the scheduling apparatus 1 shown in FIG. It is a flowchart which shows the operation example of the scheduling apparatus 1 shown in FIG. It is a flowchart which shows the operation example of the scheduling apparatus 1 shown in FIG. It is a flowchart which shows the operation example of the scheduling apparatus 1 shown in FIG. It is a Gantt chart for demonstrating the operation example of the scheduling apparatus 1 shown in FIG. It is a Gantt chart for demonstrating the operation example of the scheduling apparatus 1 shown in FIG. It is a schematic block diagram which shows the structural example of the computer which concerns on one Embodiment of this invention.

<Embodiment>
Hereinafter, embodiments of the present invention will be described with reference to FIGS. 1 to 12.

FIG. 1 is a block diagram showing a configuration example of a scheduling device 1 according to an embodiment of the present invention. The scheduling device 1 shown in FIG. 1 is configured by using a computer such as a server or a personal computer, and includes a scheduling unit 2 and a database 3 configured by a combination of hardware and software. The scheduling unit 2 includes a determination unit 21, a recording unit 22, and an allocation unit 23. The database 3 includes a job table 31, a resource master 32, a constraint condition table 33, and schedule data 34.

In this embodiment, the following words are used with the following meanings. "Job" (job) includes the meaning of "work" and the meaning of "process". "Work" means "work". "Process" means "work division (stage)". A "resource" is a "resource" provided to a "job" and corresponds to, for example, equipment, jigs and tools, a place, a worker, and the like.

The scheduling unit 2 shown in FIG. 1 refers to the job table 31, the resource master 32, and the constraint condition table 33 stored in the database 3, creates a predetermined work plan, and stores the schedule data 34 in the database 3. .. The schedule data 34 is information indicating a created work plan, and includes at least information defining a start time and a completion time of each process for a plurality of processes corresponding to each order for each order (order). Here, a configuration example of the job table 31, the resource master 32, and the constraint condition table 33 shown in FIG. 1 will be described with reference to FIGS. 2 to 5. FIG. 2 is a diagram showing a part (record 311) of the configuration example of the job table 31 shown in FIG. The job table 31 shown in FIG. 1 is configured to include a plurality of records 311.

The record 311 shown in FIG. 2 is composed of data of a plurality of items (multiple fields) that define one job, and is composed of "job ID", "job content", "next job ID", "allocation resource", and "working time". ”, Etc. are included. The "job ID" indicates a job ID (identification code). The "job content" indicates the content of the work, and is composed of a work object such as a part, data indicating the work content such as assembly and processing for the work object, and data indicating the type of work such as test run and shipping. The "next job ID" represents the ID of the next job of the job. “Allocated resource” represents a resource ID (resource ID) and quantity to be allocated to the job. "Working time" represents the working time of the job.

FIG. 3 is a diagram showing a part (record 321) of the configuration example of the resource master 32 shown in FIG. The resource master 32 shown in FIG. 1 includes a plurality of records 321. The record 321 shown in FIG. 3 is composed of data of a plurality of items (multiple fields) defining one resource, and is composed of "resource ID", "resource type", "resource name", "quantity", "operation calendar", and the like. Includes data for multiple items (multiple fields) such as "synchronization necessity flag", "latest allocation time", and "latest release scheduled time". The “resource ID” indicates the ID of the resource, and includes, for example, the data “A00001”. The "resource type" indicates the type of resource (equipment, jig / tool, place, worker) and the like, and includes data such as "equipment". The “resource name” indicates the name of the resource and includes data such as “heat treatment furnace”. The “quantity” indicates the quantity (capacity) of the resource, and includes data of, for example, “10” (the number of parts that can be simultaneously charged into the heat treatment furnace). "Operating calendar" indicates calendar information indicating an operating time zone, for example, "2018/03/01 08: 00: 00-17: 00: 00" (year / month / day: hour: minute: second-hour: Includes data (minutes: seconds). The “synchronization necessity flag” is a flag indicating whether or not it is necessary to synchronize the start time and the completion time, and includes, for example, data “1”. The "latest allocation time" indicates the time when the work is first started in the process using the resource, and includes data such as "2018/03/01 10:00:00". The "latest allocation time" is recorded and used to synchronize the start time of the resource. The "latest release scheduled time" indicates the time when the work is scheduled to be completed at the end of the process using the resource, and includes data such as "2018/03/01 15: 00: 00". The "latest scheduled release time" is recorded and used to synchronize the completion time of the resource. The initial value of the "latest allocation time" is empty (Null), and the initial value of the "latest scheduled release time" is "0" (earliest time).

4 and 5 are views showing an example of data constituting the constraint condition table 33 shown in FIG. 1 divided into two figures. 4 and 5 show the numbers from “1” to “10”, the constraint condition, the method for determining the constraint condition, the data used for the determination, and the like in association with each other. Constraints are conditions that require judgment when creating a work plan. For example, resources can be allocated to a job when the constraint condition is satisfied, and resources cannot be allocated to the job when the constraint condition is not satisfied. Constraints can be arbitrarily added or deleted for each job or resource, for example. The constraint condition table 33 shown in FIG. 1 is configured to include data representing the contents of one or a plurality of constraint conditions when creating a work plan, and data used when determining each constraint condition.

The content of the constraint condition of No. 1 is "start within the work shift". The "start within the work shift" is determined by checking whether or not the time when the work is to be started is within the work shift time. Here, the "work shift" is a time zone in which the work is actually performed when the work is performed in a shift system at regular time zones. “Starting within a work shift” means starting (= starting) work within a work shift, not outside the work shift such as a break time or a takeover time. In order to correspond to the constraint condition of No. 1, the constraint condition table 33 includes, for example, data representing the constraint condition and data representing a work shift for each resource. The data representing the constraint condition is composed of, for example, a flag indicating whether or not to make a judgment by a judgment formula prepared in advance, a judgment formula itself, and the like.

The content of the constraint condition of No. 2 is "start timing according to the start shift". The "start timing according to the start shift" is determined by checking whether or not the start time is within the start shift. Here, the "start shift" is a time zone in which work can be started. In order to correspond to the constraint condition of No. 2, the constraint condition table 33 includes, for example, data representing the constraint condition and data representing the start shift for each resource.

The content of the constraint condition of No. 3 is "starting to complete the work within the work shift time". It is determined by calculating the completion time and checking if it is within the time of the work shift associated with the resource. In order to correspond to the constraint condition of No. 3, the constraint condition table 33 includes, for example, data representing the constraint condition and data representing a work shift for each resource.

The content of the constraint condition of No. 4 is "within the upper limit of the daily input amount". Have an array (1 data / day) to record the number of orders started in the head process, record each time the head process is started, and stop starting the head process when the upper limit is reached. In order to correspond to the constraint condition of No. 4, the constraint condition table 33 includes, for example, data representing the constraint condition, a storage area for recording the input amount for each resource, and data representing the daily upper limit value. ..

The content of the constraint condition of No. 5 is "overtime hours are within the upper limit hours". Each worker has a variable to record monthly overtime hours data, and overtime hours on the work plan are recorded. Calculates that work is possible after regular hours / on holidays until the upper limit of overtime hours is reached. In order to correspond to the constraint condition of No. 5, the constraint condition table 33 has, for example, data representing the constraint condition, a storage area for recording overtime hours on a monthly basis for each worker, and an upper limit value of overtime hours. Contains data to represent.

The content of the constraint condition of No. 6 is "the worker in charge has the ability to perform the process". For each process, the competence required to perform the process is defined, and a two-dimensional array that links the worker and the competence is prepared. It is judged by checking whether the worker in charge has the necessary competence. In order to correspond to the constraint condition of No. 6, the constraint condition table 33 has, for example, a data representing the constraint condition, a storage area for recording the ability of each worker to perform each process, and each process. Contains data representing the competence required for.

The content of the constraint condition of No. 7 is "all the child parts necessary for the process". For each process, define a list of parts and required quantity required to perform the process, and prepare the inventory quantity of parts and data of future delivery schedule. It is judged by checking whether the inventory of parts required for the process is more than the required amount at the timing of starting. In addition, with the start, we will manage the increase / decrease in the number of inventories based on the data scheduled to be delivered. In order to correspond to the constraint condition of No. 7, the constraint condition table 33 corresponds to, for example, a storage area for storing data representing the constraint condition, data defining a list of necessary parts and required quantities for each process, and inventory quantity of parts. , Includes data to be delivered in the future.

The content of the constraint condition of No. 8 is "no interference occurs in the process using a crane". For each crane, the data of the defensive range and the current position are given, and the data of the moving source and the moving destination are given to the crane usage process. It is judged by checking whether a nearby crane can be called to the moving source or can be moved from the moving source to the moving destination at the timing of starting. In order to correspond to the constraint condition of No. 8, the constraint condition table 33 contains, for example, data representing the constraint condition, data indicating whether or not to use a crane for each process, and data on the defensive range and the current position for each crane. It includes a storage area for storing, a storage area for storing data of the moving source and the moving destination for each crane usage process, and the like.

The content of the constraint condition of No. 9 is "all the previous processes have been completed". In addition to having data showing the context between processes, it also has a flag as to whether or not the schedule calculation of each process is completed during the scheduling calculation. It is judged by checking that all the previous processes are completed at the timing of the start. In order to correspond to the constraint condition of No. 9, the constraint condition table 33 includes, for example, data representing the constraint condition, data indicating the context between processes, and a flag indicating whether or not the schedule calculation of each process is completed. Includes storage area, etc.

The content of the constraint condition of No. 10 is "the work time constraint (start within a certain time / or more / or less from the start / completion of the previous process) is satisfied". Depending on the definition, it is judged by checking the following. That is, (1) whether or not the difference between the pre-process start time and the post-process start time is within a certain time / or more / or less, and (2) the difference between the pre-process start time and the post-process completion scheduled time is within a certain time / Whether or not it is above / below, (3) whether the difference between the pre-process completion time and the post-process start time is within a certain time / or above / or below, (4) the difference between the pre-process completion time and the post-process scheduled completion time , It is judged whether or not it is within a certain period of time / or more / or less. The constraint condition table 33 includes, for example, data representing the constraint condition in order to correspond to the constraint condition of the number 10.

Next, an operation example of the scheduling device 1 shown in FIG. 1 will be described with reference to FIGS. 6 to 11. FIG. 6 is a flowchart showing an operation example of the scheduling apparatus 1 shown in FIG. FIG. 7 is a flowchart showing a process in which the scheduling unit 2 creates a schedule in steps S11 and S12 shown in FIG. FIG. 8 is a flowchart showing a processing flow when the scheduling unit 2 processes the start event in step S26 shown in FIG. 7. FIG. 9 is a flowchart showing a processing flow when the scheduling unit 2 processes the completion event in step S25 shown in FIG. 7. 10 and 11 are Gantt charts for explaining an operation example of the scheduling device 1 shown in FIG.

The scheduling device 1 shown in FIG. 1 performs a schedule (work plan) search process as shown in FIG. First, the scheduling device 1 creates a schedule under the initial conditions by the scheduling unit 2 (step S11). In step S11, the scheduling unit 2 creates a schedule as shown in FIG. 7.

In the process shown in FIG. 7, the scheduling unit 2 first advances the simulation time to the simulation start time (step S21). In the present embodiment, the scheduling unit 2 regards the start and completion of each process of each component in each order to be scheduled as an event (event), and each start event and each completion event are on the time axis based on a predetermined constraint. Simulate the execution along the line while advancing the simulation time. Events include start events and completion events, and each process is defined by a start event and a completion event. In the present embodiment, temporarily setting the start time for the start event is referred to as generating a start event, and shifting (delaying) the temporarily set start time is to regenerate the start event. That is.

Next, the scheduling unit 2 determines whether or not all the events have been completed (step S22). When the processing for all the events is completed (in the case of "Yes" in step S22), the scheduling unit 2 ends the processing shown in FIG. 7.

On the other hand, when the processing for all the events is not completed (when "No" in step S22), the scheduling unit 2 adjusts the simulation time to the time of the nearest start event or completion event (step S23). .. Next, the scheduling unit 2 determines whether or not there is a completion event for which the completion time is set at the current simulation time (step S24).

When the completion event exists (when "Yes" in step S24), the scheduling unit 2 selects one completion event and performs processing (step S25). On the other hand, when the completion event does not exist (when "No" in step S24), the scheduling unit 2 selects one start event and performs processing (step S26). In the processing of steps S24 to S6, if the completion event exists at the simulation time, the processing for all the completion events is executed first, and the processing for the start event is executed after the completion events no longer exist. ..

In step S26, the scheduling unit 2 performs the process shown in FIG. In the process shown in FIG. 8, the scheduling unit 2 first determines whether or not the resources required for the process (the process including the start event selected in step S26 of FIG. 7) are available (step S31).

When the necessary resources are available (“Yes” in step S31), the scheduling unit 2 determines whether or not other constraint conditions are satisfied (step S32). The other constraint conditions are the constraint conditions described with reference to FIGS. 4 and 5 defined in the constraint condition table 33 shown in FIG.

When other constraint conditions are satisfied (“Yes” in step S32), the scheduling unit 2 determines whether or not the resources required for the process require synchronization of start or completion (step S33). .. In step S33, the scheduling unit 2 can confirm whether or not synchronization of start or completion is necessary by checking the value of the "synchronization necessity flag" of the resource master 32.

When synchronization of start or completion is required (in the case of "Yes" in step S33), the scheduling unit 2 determines whether the time (simulation time) to be started matches the latest allocation time of the resource used in the process. , Or, it is determined whether or not the latest allocation time is empty (not set) (step S34). Here, in step S34, the scheduling unit 2 refers to the “latest allocation time” of the resource master 32 (record 321).

When the time to be started matches the latest allocation time of the resource used in the process, or the latest allocation time is empty (when "Yes" in step S34), the scheduling unit 2 starts the process. It is determined that it is possible, and the necessary resources are occupied (step S35). That is, in step S35, the scheduling unit 2 records the start time of the process at the latest allocation time of the resource. Further, in step S35, the scheduling unit 2 calculates the completion time of the process and records (updates) it at the latest scheduled release time. In step S35, the scheduling unit 2 records the start time (simulation time) in the "latest allocation time" of the resource master 32 (record 321), and adds the "working time" stored in the job table 31 to the start time. Calculate the completion time with, and record the calculated completion time in the "latest release scheduled time" of the resource master 32 (record 321) if no value is set, and if a value is set. When the calculated completion time is later than the set value, it is updated with the calculated completion time. Here, the scheduling unit 2 ends the process shown in FIG.

On the other hand, if the required resources are not available ("No" in step S31), other constraint conditions are not satisfied ("No" in step S32), or the time when the vehicle is about to start is the relevant time. If the latest allocation time of the resource used in the process does not match and the latest allocation time is not empty (when "No" in step S34), the scheduling unit 2 does not start the work (process) and simulates. The time is postponed and the start event is regenerated (step S36). That is, in step S36, the scheduling unit 2 shifts the time of the selected start event later, and then ends the process shown in FIG.

Further, when synchronization of start and completion is not necessary (in the case of "No" in step S33), the scheduling unit 2 determines that the process can be started and occupies the necessary resources (step S37). That is, in step S37, the scheduling unit 2 records the start time of the process, records the allocation of necessary resources, and then ends the process shown in FIG.

On the other hand, in step S25 of FIG. 7, the scheduling unit 2 performs the process shown in FIG. In the process shown in FIG. 9, the scheduling unit 2 first records the work completion time of the process (the process including the completion event selected in step S25 of FIG. 7) (step S41). Next, the scheduling unit 2 resets (empties) the "latest allocation time" of the resource allocated to the process (step S42). Next, the scheduling unit 2 determines whether or not the next process exists (step S43). When the next process exists (“Yes” in step S43), the scheduling unit 2 generates a start event for the next process at the current simulation time (step S44).

Next, the simulation unit 2 determines whether or not the current simulation time coincides with the "latest scheduled release time" of the resource that needs to be allocated in the next process including the start event generated in step S44 (. Step S45). On the other hand, when the current simulation time matches the "latest scheduled release time" or the "latest scheduled release time" is "0" (when "Yes" in step S45), the simulation unit 2 is in the next step. The start time of the start event of is set to the current simulation time (step S46), and the process shown in FIG. 10 is terminated. On the other hand, when the current simulation time does not match the "latest scheduled release time" and the "latest scheduled release time" is not "0" (when "No" in step S45), the simulation unit 2 sets the simulation unit 2. The start time of the start event of the next step is set to the "latest scheduled release time" (step S47), and the process shown in FIG. 10 is terminated.

In step S11 shown in FIG. 6, the scheduling unit 2 creates a schedule by the process described with reference to FIGS. 7, 8 and 9, and records it as an optimum solution. Next, the scheduling unit 2 changes the job arrival procedure, creates a schedule in the same manner as in step S11, and if it is improved (if a schedule that is completed in a shorter time than before is created), the said Replace the optimal solution with the schedule (step S12). Next, the scheduling unit 2 determines whether or not an improved solution has been found (step S13). When an improved solution is found (in the case of "Yes" in step S13), the scheduling unit 2 executes the process of step S12 again. On the other hand, when an improvement solution is not found (in the case of "No" in step S13), the scheduling unit 2 ends the calculation (step S14).

Next, the effects of the present embodiment will be described with reference to FIGS. 10 and 11. FIG. 10A shows an example in which nine jobs Job1 to Job9 are scheduled without considering synchronization of work start and completion in batch processing, and FIG. 10B shows an example of scheduling according to the present embodiment. show. The horizontal axis is the time axis, and in the example shown in FIG. 10, each resource Machine A1 to A3 is, for example, the same equipment (for example, a heat treatment furnace) capable of processing three jobs in parallel. In this case, for jobs performed using the resources Machines A1 to A3, the start time and the completion time must be synchronized. However, in the example shown in FIG. 10A in which synchronization is not considered, jobs Job2 to Job3 are started before the first job Job1 is completed even though the start times of jobs Job1 to Job3 are not the same. It has been done. Therefore, the schedule shown in FIG. 10A cannot be executed. On the other hand, in the schedule shown in FIG. 10B created in consideration of synchronization in the present embodiment, the start time of job Job1 is set to the "latest allocation time", so that the start time is later than the "latest allocation time". Jobs Job2 to Job3 are not started before job Job1 is completed. Further, after the job Job1 is completed, the jobs Job4 to Job6 are started at the same time at the "latest release scheduled time" set in accordance with the setting of the "latest allocation time" for the job Job1, and the jobs Job4 to Job6 are also started. Jobs Job4 to Job6 are completed at the same time after the longest working time has elapsed.

On the other hand, FIG. 11A shows an example in which eight jobs Job1 to Job8 are scheduled in unmanned machining without considering the synchronization of work start and completion, and FIG. 11B shows the scheduling according to the present embodiment. An example is shown. The horizontal axis is the time axis, and in the example shown in FIG. 11, the resources Machines A1 to A3 are the same equipment capable of processing, for example, three jobs in parallel or continuously. In this case, for jobs performed using the resources Machines A1 to A3, the start time and the completion time must be synchronized. However, in the example shown in FIG. 11A in which synchronization is not considered, when job Job1 is completed even though job Job2 and job Job3 are not completed among the jobs Job1 to Job3 started at the same time, the job Job4 has been started. Therefore, the schedule shown in FIG. 11A cannot be executed. On the other hand, in the schedule shown in FIG. 11B created in consideration of synchronization in the present embodiment, the completion time of the job Job2 having the longest working time is set to the "latest scheduled release time", so that the resource Machine A1 The next start time of ~ A3 is set after the "latest scheduled release time". Therefore, even though Job Job 2 and Job Job 3 have not been completed, Job Job 4 is not started.

As described above, in the present embodiment, the flag for whether the start time and the completion time need to be synchronized, the latest allocation time, and the latest scheduled release time are defined for each resource to be defined. Also, at the time of the first work allocation to the resource, the start time is recorded at the latest allocation time, and at the time of subsequent work allocation, it is judged whether the start time is the same as the latest allocation time, and if they are the same, allocation is possible or not the same. If it is not possible to assign, all parts can be started at the same time. Further, when the work is started, the scheduled completion time is calculated from the work time of the work and the operation shift, and the latest scheduled release time is recorded. When the work is completed, it is determined whether the completion time is the same as the latest scheduled release time, and if they are the same, the next process can be started immediately, and if they are not the same, the startable time of the next process is set to the latest scheduled release time. By doing so, it is possible to create a schedule so that all parts are considered to be completed at the same time (deemed simultaneous completion is realized). On the other hand, in order to obtain a schedule that can be completed in a shorter time, a process of creating multiple schedules and searching for a better schedule is incorporated under the condition that the job start timing is changed. In the search process, the schedule changes by changing the job start timing, for example, by incorporating a certain part that was in the same batch into another batch.

According to this embodiment, scheduling considering simultaneous start / deemed simultaneous completion constraints is possible, which is not feasible in batch processing such as heat treatment and surface treatment, and in the process of automatically processing a plurality of parts unmanned. It is possible to avoid the work plan and actually perform the work as calculated by the scheduling.

In addition, by incorporating the search process, it is possible to obtain a schedule for completion in a shorter period of time while observing the simultaneous start / deemed simultaneous completion constraint.

Further, in the present embodiment, the following constraint conditions can be considered. One constraint is whether or not it is a start within the work shift. In this case, as a method of considering the constraint condition, it is possible to give the resource the work shift data and check whether the time to be started is within the work shift time. According to this configuration, it is possible to calculate a more accurate schedule considering the work shift.

Further, in the present embodiment, the following constraint conditions can be considered. One constraint is whether or not all the previous steps have been completed. As a method of considering the constraint conditions, the context data between the processes is provided, and a flag is provided during the scheduling calculation as to whether or not the schedule calculation of each process is completed. At the timing of the start, it can be checked that all the previous processes have been completed. According to this configuration, it is possible to calculate a schedule in which the start / end timing is not reversed with the front-back process in consideration of the front-back relationship.

Further, in the present embodiment, the following constraint conditions can be considered. One constraint condition is whether or not the work time constraint (starting within a certain time / or more / or less from the start / completion of the previous process) is satisfied. As a method of considering constraint conditions, it is to consider time constraints, and specifically, to check the following according to the definition. (1) Check that the difference between the start of the front-end process and the start of the back-end process is within a certain period of time / or more / or less. (2) Check that the difference between the start of the front-end process and the scheduled completion of the back-end process is within a certain period of time / or more / or less. (3) Check that the difference between the completion of the pre-process and the start of the post-process is within a certain period of time / or more / or less. (4) Check that the difference between the completion of the front-end process and the scheduled completion of the back-end process is within a certain period of time / or more / or less. According to this configuration, it is possible to calculate a schedule closer to the actual work in consideration of the work time constraint between the previous and next processes.

As described above, according to the present embodiment, scheduling is possible in consideration of the simultaneous start / deemed simultaneous completion constraint, and in batch processing such as heat treatment and surface treatment, and in the process of automatically processing a plurality of parts unmanned. It is possible to avoid infeasible work plans and actually work as the scheduling calculated. In addition, by incorporating the search process, it is possible to obtain a schedule for completion in a shorter period of time while observing the simultaneous start / deemed simultaneous completion constraint.

In the scheduling device 1 shown in FIG. 1, the scheduling unit 2 includes a determination unit 21, a recording unit 22, and an allocation unit 23, and the functions of each unit are as follows. That is, when the determination unit 21 allocates the allocation target job to the allocation target resource, which is one of the groups of resources that need to be synchronized with the start time, the determination unit 21 sets the latest allocation time related to the group of resources. It is determined whether or not the start time of another job allocated to another resource in the group of resources has already been recorded (in step S34 of FIG. 8, it is determined whether or not the latest allocation time is empty). Corresponds to processing). Further, when the recording unit 22 determines that the start time of another job allocated to another resource is not recorded at the latest allocation time related to the group of resources (latest allocation in step S34 of FIG. 8). (Corresponding to the case where it is determined that the time is empty), the allocation target job is allocated to the allocation target resource, and the start time of the allocation target job is recorded as the latest allocation time (corresponding to the process of step S35 in FIG. 8). .. Further, when the allocation unit 23 determines that the start time of another job allocated to the other resource is recorded at the latest allocation time related to the group of resources (latest allocation in step S34 of FIG. 8). (Corresponding to the case where it is determined that the time is not empty), it is determined whether or not the start time of the job to be assigned matches the time recorded as the latest allocation time (matches the latest allocation time in step S34 of FIG. 8). (Corresponding to the process of determining whether or not), and if they match, the allocation target job is allocated to the allocation target resource (corresponding to the process of step S35 in FIG. 8).

Further, when recording the start time of the allocation target job as the latest allocation time, the first completion time, which is the completion time of the allocation target job, is calculated, and the calculated first completion time relates to a group of resources. When it is later than the latest scheduled release time, the recording unit 22 updates the first completion time as the latest scheduled release time (corresponding to the process of step S35 in FIG. 8). Further, the allocation unit 23 sets the start time of the next job of the allocation target job to be allocated to the group of resources to the updated latest scheduled release time (corresponding to the process of step S47 in FIG. 9).

(Computer configuration example)
FIG. 12 is a schematic block diagram showing a configuration example of a computer according to the above-described embodiment. The computer 9 includes a CPU 91, a main storage device 92, an auxiliary storage device 93, and an interface 94. The scheduling device 1 described above includes a computer 9. The operation of each of the above-mentioned processing units is stored in the auxiliary storage device 93 in the form of a program. The CPU 91 reads a program from the auxiliary storage device 93, expands it to the main storage device 92, and executes the above processing according to the program. For example, the scheduling unit 2, the determination unit 21, the recording unit 22, and the allocation unit 23 described above may be the CPU 91. Further, the CPU 91 may secure a storage area corresponding to the above-mentioned database 3 in the main storage device 92 or the auxiliary storage device 93 according to the program.
The programs and data constituting the scheduling device 1 can be distributed in part or in whole via a computer-readable recording medium or communication line. Further, when the natural language processing device 1 is composed of a plurality of computers, the plurality of computers may be distributed and arranged via a network.

As described above, some embodiments of the present invention have been described, but all of these embodiments are presented as examples and are not intended to limit the scope of the invention. These embodiments can be implemented in various other embodiments, and various omissions, replacements, and changes can be made without departing from the gist of the invention. These embodiments and variations thereof are included in the scope of the invention described in the claims and the equivalent scope thereof, as are included in the scope and gist of the invention.

1 Scheduling device 2 Scheduling unit 3 Database 21 Judgment unit 22 Recording unit 23 Allocation unit 31 Job table 32 Resource master 33 Constraint condition table 34 Schedule data

Claims (7)

When allocating a job to be allocated to a resource to be allocated, which is one of the resources in the group that requires synchronization of the start time, the latest allocation time related to the resource in the group is set to the resources in the group. A judgment unit that determines whether or not the start time of another job assigned to another resource has already been recorded, and
When it is determined that the start time of another job allocated to the other resource is not recorded at the latest allocation time related to the group of resources, the allocation target job is allocated to the allocation target resource and the allocation target job is described. As the latest allocation time, a recording unit that records the start time of the job to be assigned, and
When it is determined that the start time of another job allocated to the other resource is recorded in the latest allocation time of the group of resources, the start time of the job to be assigned is recorded as the latest allocation time. The allocation unit that determines whether or not the time matches the time, and allocates the allocation target job to the allocation target resource if the time matches.
Have,
When recording the start time of the allocation target job as the latest allocation time, the first completion time, which is the completion time of the allocation target job, is calculated, and the calculated first completion time is the group. When it is later than the latest scheduled release time related to the resource, the recording unit updates the first completion time as the latest scheduled release time.
The allocation unit sets the start time of the next job of the allocation target job to be allocated to the group of resources to the updated latest scheduled release time.
Scheduling device. The determination unit makes the determination when the start time of the allocation target job is within the work shift time.
The scheduling device according to claim 1 . The determination unit refers to the data indicating the context between the jobs, and makes the determination when all the schedule calculations of the jobs specified as the jobs to be performed before the allocation target job in the data are completed. conduct
The scheduling device according to claim 1 . The determination unit makes the determination when a predetermined working time constraint is satisfied.
The scheduling device according to claim 1 . In the case where any job specified as a job to be performed before the allocation target job in the data showing the context between jobs is set as the previous job and the allocation target job is set as the later job.
The work time constraint is that (1) the difference from the start of the previous job to the start of the later job is within a certain time, a certain time or more or a certain time or less, and (2) the job after the start of the previous job. The difference until the completion schedule is within a certain time, a certain time or more or a certain time or less, and (3) the difference from the completion of the previous job to the start of the later job is within a certain time, a certain time or more or a certain time. It is either less than the time, or (4) the difference from the completion of the previous job to the scheduled completion of the later job is within a certain time, more than a certain time, or less than a certain time.
The scheduling device according to claim 4 . When allocating a job to be allocated to a resource to be allocated, which is one of the resources in the group that requires synchronization of the start time, the latest allocation time related to the resource in the group is set to the resources in the group. A step to determine if the start time of another job assigned to another resource has already been recorded, and
If the start time of the other job allocated to the other resource is not recorded in the latest allocation time related to the group of resources, the allocation target job is allocated to the allocation target resource and the latest allocation time is set. , The step to record the start time of the job to be assigned, and
When the start time of another job allocated to the other resource is recorded in the latest allocation time related to the group of resources, the time when the start time of the job to be allocated is recorded as the latest allocation time. The step of allocating the allocation target job to the allocation target resource and the step of allocating the allocation target job to the allocation target resource.
Have,
In the step of recording the start time of the allocation target job as the latest allocation time, the first completion time, which is the completion time of the allocation target job, is calculated, and the calculated first completion time is the group. When it is later than the latest scheduled release time related to the resource, the first completion time is updated as the latest scheduled release time.
In the step of allocating the allocation target job, the start time of the next job of the allocation target job to be allocated to the group of resources is set to the updated latest scheduled release time.
Scheduling method. When allocating a job to be allocated to a resource to be allocated, which is one of the resources in the group that requires synchronization of the start time, the latest allocation time related to the resource in the group is set to the resources in the group. A step to determine if the start time of another job assigned to another resource has already been recorded, and
If the start time of the other job allocated to the other resource is not recorded in the latest allocation time related to the group of resources, the allocation target job is allocated to the allocation target resource and the latest allocation time is set. , The step to record the start time of the job to be assigned, and
When the start time of another job allocated to the other resource is recorded in the latest allocation time related to the group of resources, the time when the start time of the job to be allocated is recorded as the latest allocation time. The step of allocating the allocation target job to the allocation target resource and the step of allocating the allocation target job to the allocation target resource.
Let the computer run
In the step of recording the start time of the allocation target job as the latest allocation time, the first completion time, which is the completion time of the allocation target job, is calculated, and the calculated first completion time is the group. When it is later than the latest scheduled release time related to the resource, the first completion time is updated as the latest scheduled release time.
In the step of allocating the allocation target job, the start time of the next job of the allocation target job to be allocated to the group of resources is set to the updated latest scheduled release time.
program.

Images