JP7193431B2 - Scheduling device, scheduling method and storage medium - Google Patents

Description

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

In a production site such as a factory, scheduling that determines the work order and product placement is important in order to efficiently perform a large number of tasks with limited resources.

Non-Patent Literature 1 is known as a technology related to production site scheduling. Non-Patent Document 1 describes the placement of machines and products during one scheduling period at a production site where multiple facilities, multiple machines, and products are used by sharing multiple work spaces spatially and temporally. A method for deriving appropriate scheduling by dynamically changing is described.

R. Kamoshida, “Concurrent Optimization of Job Shop Scheduling and Dynamic and Flexible Facility Layout Planning”, 5th International Conference on Industrial Engineering and Applications, pp.289-293, 2018.

In the actual production site, in addition to the work space required to process the machine and product process, there are machines between one process and the next process, between the arrival of goods and the start of work, and between the completion of the final process and the shipment. And a temporary storage space for temporarily storing the product is required.

If a temporary storage space is retained in the workspace after processing the process in the workspace, the temporary storage space will overlap with the workspace required to process the subsequent processes of other machines and products. Scheduling may collapse.

On the other hand, if a dedicated space for temporary storage space is secured in advance at the production site, and the processes are processed in the work space and then moved to the dedicated space for temporary storage space, the scheduling will not be disrupted, but the work space on the production site will not be disrupted. There is a problem that the production efficiency decreases due to the decrease in the space that can be used as

In addition, there is a problem that the movement cost is high because movement is required each time the process is performed. In Patent Literature 1, the spatial exclusivity of work spaces for a plurality of machines and products is ensured, but the temporary storage space cannot be considered, so the above problem cannot be solved.

SUMMARY OF THE INVENTION Accordingly, it is an object of the present invention to provide a scheduling apparatus and method that includes a layout plan for temporary storage spaces.

The present invention is a scheduling method for generating a schedule for executing one or more jobs in which one or more processes are set in chronological order, in a predetermined space, using a computer having a processor and a memory, wherein the computer comprises one or more including one or more jobs in which the processes are set in chronological order, and the required space used for each process, the work time required for the work of the process, and the chronological order of the processes are set. a storage step of storing information, space information in which a plurality of work spaces for performing the process are set in advance, and size information in which a size used for temporary placement is set in advance for each job; The computer reads the work information, selects the work space that satisfies the time-series order and satisfies the space request value for each of the processes from the space information, and selects the work space from the space information. determining the chronological order and arrangement in the space, calculating a schedule of a temporary storage space that satisfies the required value of the space using the size information, and adding blocking information to the schedule of the temporary storage space; a process order list generating step of reflecting the blocking information in the arrangement in the space and then canceling the blocking information given to the schedule of the temporary storage space to generate a process order list; The information is information representing possible start times of other processes in order to exclude the addition of new processes and temporary placements to the temporary placement space. When the blocking information is assigned to the schedule, by assigning the maximum value that can be set as the blocking information, the addition of a new process or temporary placement to the temporary storage space is eliminated, and the blocking information is set. When a new process is added to the temporary storage space, the blocking information is replaced with the end time of the preceding process only for the process following the preceding process, thereby permitting cancellation of the blocking information. .

Therefore, according to the present invention, it is possible to secure a temporary storage space without disrupting the schedule by applying blocking. Since the space can be used as a work space, it is possible to provide a scheduling method and apparatus that improve the efficiency of a production site such as a factory.

The details of at least one implementation of the subject matter disclosed in this specification are set forth in the accompanying drawings and the description below. Other features, aspects, and advantages of the disclosed subject matter will become apparent from the following disclosure, drawings, and claims.

BRIEF DESCRIPTION OF THE DRAWINGS It is a top view which shows Example 1 of this invention and shows an example of a factory, an installation, and a free space. BRIEF DESCRIPTION OF THE DRAWINGS It is a block diagram which shows Example 1 of this invention and shows an example of a scheduling apparatus. It is a figure which shows Example 1 of this invention and shows an example of a work list. It is a figure which shows Example 1 of this invention and shows an example of a space list. It is a figure which shows Example 1 of this invention and shows an example of a size list. It is a figure which shows Example 1 of this invention and shows an example of a schedule table. It is a schedule generation flowchart which shows Example 1 of this invention and shows an example of the scheduling process performed with a scheduling apparatus. It is a figure which shows Example 1 of this invention and shows an example of the Gantt chart which is a schedule display, and a layout transition diagram. It is a schedule improvement flowchart which shows Example 1 of this invention and shows an example of the schedule improvement process performed with a scheduling apparatus. It is a schedule evaluation flowchart which shows Example 1 of this invention and shows an example of the schedule evaluation process performed with a scheduling apparatus. FIG. 4 is a sequence diagram showing Embodiment 1 of the present invention and showing an example of scheduling processing performed by the scheduling device; It is a figure which shows Example 1 of this invention and shows the period from order reception to shipment with respect to the ratio of the evacuation space for exclusive use. It is a figure which shows Example 2 of this invention and shows an example of a work list. It is a figure which shows a conventional example and shows the arrangement|sequence and layout plan which manage a space. It is a figure which shows Example 3 of this invention and shows the arrangement|sequence and layout plan which manage a space. It is a figure which shows Example 3 of this invention and shows the arrangement|sequence and layout plan which manage a space. It is a figure which shows Example 3 of this invention and shows the arrangement|sequence and layout plan which manage a space. It is a figure which shows Example 3 of this invention and shows the arrangement|sequence and layout plan which manage a space. It is a figure which shows Example 3 of this invention and shows the arrangement|sequence and layout plan which manage a space. FIG. 10 is a diagram showing a fourth embodiment of the present invention, showing an arrangement for reserving space, an arrangement for managing space, and a layout plan; FIG. 10 is a schedule generation flow chart showing Example 4 of the present invention and showing an example of scheduling processing performed by the scheduling device. FIG. It is a figure which shows Example 1 of this invention and shows the arrangement|sequence and layout plan which manage a space.

An embodiment of the present invention will be described below with reference to the accompanying drawings. In this embodiment, as an example of a scheduling device, an example of a scheduling device including a temporary storage space layout plan will be described.

Embodiment 1 FIG. 1 is a plan view showing an example of a factory to which a scheduling device is applied, showing Embodiment 1 of the present invention.

The factory 100 has a passage 101 for workers to walk and transport articles, machines and products 10-1 to 10-4, fixed installations 102-1 to 102-3 for fixed work, and movable work. It has free spaces (movable work spaces) 103-1 to 103-3. In the following description, when describing the machines and products 10-1 to 10-4 as a whole, the symbol "10" omitting "-" is used. The same applies to the codes of other constituent elements.

In the first embodiment, the fixing work involves fixing the arrangement of the machine and the product 10 with the fixing facility 102 to perform a predetermined process. The fixed equipment 102-1 is fixed in a predetermined layout, and processes that can be handled by the fixed equipment 102-1 are performed.

On the other hand, the mobile work arranges the machine and the product 10 in the free space 103 and performs a process that can be handled in the free space 103 . The free space 103 allows the free layout of machines and products 10 within a range (space constraint) within the free space 103 .

As long as the movable work satisfies the space constraint, it is possible to arrange the machine and product 10 to perform the process at the same time as other machines and products, and the constraint that the equipment cannot be used at the same time (equipment constraint). not set.

Note that the space constraint condition in the first embodiment means that the size (or or area) is used to place the machines and products 10 so that they do not overlap.

On the other hand, since fixed work can only perform predetermined work that can be handled by the equipment installed in the fixed equipment 102, there is no space constraint, but there is an equipment constraint.

Note that in the first embodiment, a job is a group of one or more processes having an order (operation #) necessary for manufacturing one product, and includes work content (process name) of each process, work time, It includes the equipment to be used and the size required to carry out the work. A plurality of jobs can be executed in parallel in the factory 100 .

Moreover, in Example 1, it is allowed to use both the free space 103 and the fixed equipment 102 in one process. That is, it allows a portion of the machine and product 10 to be processed in stationary operation in stationary installation 102 during mobile operations using free space 103 in one process. In this case, a work plan is formulated so as to satisfy the facility constraint and the space constraint in one process.

Likewise, during fixed operations that use the equipment of fixed installation 102 in one process, it allows a portion of machines and products 10 to be processed in free space 103 .

In addition, in Example 1, the work for moving the free space 103 and the work for fixing the fixed equipment 102 are works that do not spatially overlap.

FIG. 2 is a block diagram including functional elements of the scheduling device 200 including layout plans of temporary storage spaces. The scheduling device 200 is a computer including a CPU 201 , a memory 202 , a storage device 203 , an input device 204 and an output device 205 . The input device 204 includes a mouse, keyboard, and touch panel, and the output device 205 includes a display.

The memory 202 holds a process candidate identification unit 210, a work time identification unit 211, a usage time identification unit 212, a blocking unit 213, a schedule determination unit 214, an input unit 215, and an output unit 216. .

Specifically, the process candidate identification unit 210 to the output unit 216 are functions realized by, for example, causing the CPU 201 to execute a program stored in the memory 202, which is a storage device on the computer.

The CPU 201 operates as a functional unit that provides a predetermined function by processing according to the program of each functional unit. For example, the CPU 201 functions as the process candidate identification unit 210 by performing processing according to a process candidate identification program. The same is true for other programs. Furthermore, the CPU 201 also operates as a functional unit that provides functions of multiple processes executed by each program. A calculator is a device that includes these functional units.

The storage device 203 stores a work list 310, a space list 320, a size list 330, a schedule table 340, and a plan evaluation result 350 table. Details of each table will be described later.

FIG. 3 shows an example of a work list 310 for scheduling according to the first embodiment. The work list 310 is work information generated by the input unit 215 from one or more jobs in which one or more processes are set in chronological order by the user of the scheduling device 200 via the input device 204 .

The work list 310 includes an ID 311 that is a unique value assigned to each process of the work plan in the factory 100, a job # 312 that is the number of each job, a work # 313 that is the work order of the processes included in the job, This is a table defining a process name 314 indicating work content, a facility to be used 315 required for the process, a work time 316 required to complete the process, and a required width 317 and required depth 318 of the space required for the process.

The processes included in the job must be processed in the order of work #313 (precedence order constraint). For example, the process with ID 311 of "2" has operation #313 of "2", the process of ID 311 of "1" has operation #313 of "1", and the process of ID 311 of "2" has ID 311 of "1". Work can only be started after the work in step 1 has been completed.

In the embodiment, an example in which one job is composed of 3 to 5 processes has been shown, but the number of processes of each job is not limited. In addition, although the input values of the facility to be used 315 and the required width 317 and required depth 318 are blank (-) when they are not required, other input values that can be understood when they are not required may be used.

The work list 310 includes one or more jobs 312 in which one or more processes are set in chronological order, and includes at least one of a required width 317 and a required depth 318, or at least one of a required width 317 and a required depth 318. Any information in which time is set is not limited to the above.

FIG. 4 is a diagram showing an example of the space list 320. As shown in FIG. The space list 320 is space information generated by the input unit 215 from the free space 103 of the factory 100 input by the user of the scheduling device 200 via the input device 204 .

The space list 320 includes the space name 321 of each free space included in the free space 103, the maximum available space width 322, the maximum available space depth 323, and the position of the free space 103 in the factory 100. It includes a factory location 324 .

Note that the space list 320 is not limited to the above as long as the information includes one or more free spaces 103 and the size (or area) of the free spaces 103 . Also, the space names 321=“S1” to “S3” correspond to the free spaces 103-1 to 103-3 in FIG.

FIG. 5 is a diagram showing an example of the size list 330. As shown in FIG. The size list 330 is preset size information (required values for space) indicating sizes required for temporary placement of machines and products 10 for each job #312 of the work plan in the factory 100, and corresponds to the job #312. Job # 331 , temporary placement width 332 and temporary placement depth 333 required for temporary placement are included.

FIG. 6 is a diagram showing an example of a schedule table 340 representing a work plan for each process. The scheduling device 200 uses each table included in the storage device 203 as input data via the input unit 215, and outputs a schedule generated by each functional unit to the storage device 203 via the output unit 216 as a schedule table showing a work plan. store 340;

The schedule table 340 includes an ID 341 corresponding to the ID 311 of the work list 310, a job #342 that is the same as the job #311, a work #343 that is the same as the work #312, a start time 344 that is the scheduled start time of the work, and a work schedule. It is an end time 345 that is a scheduled end time, a use facility 346 that is the same as the use facility 315, a use space 347 that indicates the space name 321 used by the process, and a placement starting point of the machine and the product 10 in the free space of the use space 347. It includes a position in space 348 and a size 349 that indicates the amount of space usage allowed for placement of the machine and product 10 .

In the first embodiment, the schedule table 340 includes at least one of an ID 341 that can identify a process or a job # 342 and an operation # 343 , a start time 344 and an end time 345 for each process, and indicates that the process is directed to the free space 103 . When the arrangement is required, the information is not limited to the above as long as it includes the available space 347 indicating the arrangement method, the position in the space 348, and the size 349. FIG.

In addition, an ID "7'" that is not included in the ID 311 of the work list 310 is added to the ID 341 of the schedule table 340, which means the layout plan of the temporary storage space. The generation method will be described with reference to a schedule generation flow chart described later.

FIG. 7 is a schedule generation flowchart showing an example of scheduling processing of the schedule determination unit 214 performed in the scheduling device 200. As shown in FIG.

The input unit 215 reads the work list 310 to the size list 330 shown in FIG. 2, and the process candidate identification unit 210 extracts process candidates that can be processed from the work list 310 and generates a candidate list (step S101). Here, the candidate list is the set of steps that satisfy the precedence order constraint. Next, in step S102, the blocking unit 213 cancels blocking as described later.

Next, among the processes included in the candidate list, for processes that require placement in the free space 103, the available time specifying unit 212 determines the possible placement schedule and possible start time so as to satisfy the space constraint conditions. is calculated (step S103). Here, the layout plan includes the space name 321 (utilized space 347) of the free space 103, the position within the space 348, and the size 349 allowed for the layout of the machine and product 10 as information.

Next, for the processes included in the candidate list, the working time specifying unit 211 determines the conditions for each process so that the equipment constraint conditions are satisfied, and the processes that require placement in the free space 103 are after the startable time. The start time 344 is calculated, the end time 345 is calculated from the start time 344 and the work time 316, and candidates for the work plan are presented (step S104). Here, the work plan includes a start time 344 and an end time 345, and includes the utilization facility 346 as information for fixed work and the layout schedule as information for movable work.

Next, the work time identification unit 211 selects a process from the processes included in the work plan candidates, and removes the selected process from the candidate list (step S105). Here, the selection of processes is performed, for example, at random.

Next, the work time identification unit 211 records the layout schedule and work plan of the selected process in the schedule table 340 of the storage device 203 via the output unit 216 (step S106). The reflection of blocking information will be described later.

Next, using the temporary placement width 332 and the temporary placement depth 333 of the corresponding job #331 given in the size list 330 for the selected process, the usage time specifying unit 212 determines so as to satisfy the space constraint conditions. The arrangement schedule and possible start time of the space required for temporary placement are calculated, and the blocking unit 213 generates blocking information for the temporary placement space (step S107).

The blocking information excludes the addition of new processes and temporary placements to the space for which the blocking information is set.

Here, generation of blocking information means, for example, generation of blocking information that sets the possible start time of the free space 103 corresponding to the temporary space to the maximum value that can be set. By setting the allowable start time to the maximum value that can be set, the usage time specifying unit 212 can know the allocation schedule of the temporary storage space, so that it is possible to prevent the temporary storage space from being used by other processes.

In the first embodiment, the possible start time is treated as an integer, and the settable maximum value is used as the blocking information. For example, when the start time is represented by 32 bits, FFFFFFFFh (hexadecimal notation), which is the maximum value that can be set, becomes the blocking information. Note that the blocking information is not limited to numerical values, and may be expressed in characters.

Next, if there is a process for which the work plan has not been determined, the utilization time specifying unit 212 returns to step S101 to continue the scheduling process, and if the work processes of all the processes have been determined, the process proceeds to step S109 (step S108). .

If there is a process for which the work plan has not been determined, in step S101 a candidate list is generated by excluding the process for which the work plan has been determined. If there is the blocking information generated in step S102, the blocking information is released using the blocking unit 213 (step S102).

Here, the cancellation of the blocking information means, for example, replacing the blocking information of the preceding process with the end time 345 of the preceding process on the precedence order constraint of the processes included in the candidate list.

By replacing the blocking information with the end time 345 , the temporary storage space becomes a usable space at the end time 345 . As a result, in step S103, the usage time specifying unit 212 satisfies the space constraint condition for the free space 103 that includes the temporary storage space of the preceding process and excludes other temporary storage spaces on the prior order constraint of the processes. In this way, it is possible to calculate the possible arrangement schedule and start possible time.

In addition, since the blocking information of the preceding process on the preceding order constraint is released only for the subsequent process on the preceding order constraint, blocking information is retained for processes other than the succeeding process on the preceding order constraint. , the temporary placement space cannot be used by processes other than those that follow due to the precedence order constraint.

In step S102, the processes of steps S103 to S105 are performed for each process in the candidate list including the process for which the blocking information has been released, thereby selecting the process and removing the selected process from the candidate list.

Then, using the blocking unit 213 and the usage time specifying unit 212, the temporary placement arrangement schedule and work plan of the preceding process on the precedence order constraint are generated from the start time 344 of the selected process and the blocking information, and the selected process are recorded in the schedule table 340 of the storage device 203 via the output unit 216 together with the arrangement schedule and the work plan (step S106).

Here, if the start time 344 and end time 345 of the work plan for temporary placement are the same, it is not necessary to record the layout schedule and work plan for temporary placement.

If there is a process following the selected process under the precedence order constraint, the temporary placement width 332 and temporary placement depth 333 of the corresponding job #331 given in the size list 330 are used for the selected process. Then, the utilization time specifying unit 212 calculates the allocation schedule of the space required for temporary placement so as to satisfy the space constraint. The blocking unit 213 generates blocking information for the temporary space, and the blocking information for the unselected steps is returned to the blocking information before the cancellation (step S107).

When the work process of all the processes has been determined, the schedule determination unit 214 evaluates the schedule table 340 under predetermined conditions in step S109 and stores the evaluation result as the plan evaluation result 350 via the output unit 216. The predetermined condition is, for example, the maximum value of the end time 345, and the smaller the value, the better the plan evaluation result.

Using the tables of FIGS. 3 to 5 as input data, the schedule table 340 shown in FIG. FIG. 8 shows the work plan screen 800 displayed in .

The work plan screen 800 in FIG. 8 indicates that the process E20-1 of job #2 will be fixed work by the fixed facility 1 from time "t0" to time "t2". Here, the numbers in the process rectangles refer to the numbers at the end of the utilization equipment name 315 of the fixed equipment 102 .

In step E20-2, moving work is performed from time "t2" to time "t5". The movable work of step E20-2 uses the space name 321 of the free space 103 "S2", and the space permitted for the work is positions "0" to "4" in the space name 321 "S2".

Further, the process E20-2' is a process of temporary placement after the work of the process E20-2, and the process E20-2' is located at the position "0" in the space name 321 "S2" from the time "t5" to the time "t7". ” to “4” are used to perform the movable work.

Similarly, the process E10-1 performs fixed work with the fixed facility 1 from the time "t2" to the time "t4", and the process E10-2 performs the space name 321 "S1" from the time "t4" to the time "t6". Positions '0' to '2' in the space name 321 'S1' are used to perform the movable work, and the process E10-3 is performed from time 't6' to time 't7'. is used to perform the moving work, the process E10-4 performs the fixing work with the fixed facility 1 from the time "t7" to the time "t12", and the process E10-5 performs the fixed facility from the time "t12" to the time "t14" The fixed work is performed in 2, and the process E20-3 uses the movable work and the fixed facility 2 by using the positions "0" to "3" in the space name 321 "S2" from the time "t7" to the time "t10". and fixed work is performed, the process E30-1 performs the fixed work at the fixed facility 1 from the time "t4" to the time "t5", and the process E30-2 performs the fixed work at the fixed facility 2 from the time "t5" to the time "t7". Fixed work is performed, and the process E30-3 uses positions "0" to "3" in the space name 321 "S3" from time "t7" to time "t8" and uses movable work and fixed equipment 3 The fixed work is performed, the process E30-4 performs the movable work using the positions "0" to "3" in the space name 321 "S3" from the time "t8" to the time "t12", and the process E30-5 From time "t12" to time "t14", the fixed installation 1 performs fixing work.

FIG. 9 is a schedule improvement flowchart showing an example of schedule improvement processing of the schedule determination unit 214 performed in the scheduling device 200. As shown in FIG.

By performing the processing of steps S101 to S108 described in the schedule generation flowchart, one schedule table 340 (FIG. 6) and plan evaluation result 350 are generated, and the schedule determination unit 214 determines the process processing order of the generated schedule table 340 A list of IDs (process order list) obtained by excluding the temporary placement process from the ID 341, which is the initial solution. Moreover, let the obtained plan evaluation result 350 be a provisional evaluation result (step S201).

Next, the schedule determination unit 214 generates one or more different process order lists by permuting the order of the process order list of the initial solution within a range that satisfies the precedence order constraint, and uses them as neighboring solutions (step S202).

Next, the schedule determination unit 214 processes one or more process order lists included in the neighborhood solution according to the procedure of the schedule evaluation flowchart described later, and outputs a plurality of neighborhood plan evaluation results via the input unit 215. A schedule table of a plurality of neighboring solutions is associated and acquired (step S203).

Next, the schedule determination unit 214 selects one plan evaluation result under a predetermined condition from the obtained plan evaluation results of the neighboring solutions, and sets it as a comparative evaluation result. Also, the process order list corresponding to the comparative evaluation result is set as a new initial solution, and the nearby schedule table corresponding to the comparative evaluation result is set as a comparative schedule table (step S204). Here, the predetermined condition is, for example, comparing plan evaluation results of a plurality of neighboring solutions and selecting the best plan evaluation result.

Next, the schedule determining unit 214 compares the comparative evaluation result with the provisional evaluation result, and if the comparative evaluation result is better than the provisional evaluation result, it determines that the storage condition is satisfied and proceeds to step S206 to obtain the comparative evaluation result. If the provisional evaluation result is better, the process proceeds to step S207 (step S205).

In step S206, the schedule determination unit 214 stores the comparison schedule table in the storage device 203 via the output unit 216 as the best schedule table.

In step S207, the schedule determination unit 214 determines whether the schedule improvement process satisfies the termination condition, and if not satisfied, proceeds to step S202 to generate a neighborhood from a new initial solution.

The schedule determination unit 214 ends the schedule improvement process when the end condition is satisfied, and displays the work plan on the output device 205 from the best schedule table via the output unit 216 . The end condition is, for example, counting the number of times the neighborhood solution is generated in step S202, and determining whether or not the number of times given in advance matches the number of times the neighborhood solution is generated.

FIG. 10 is a schedule evaluation flowchart showing an example of schedule evaluation processing performed by the scheduling device 200. As shown in FIG.

The input unit 215 reads the work list 310 to the size list 330, and obtains one or more neighboring process order lists generated in step S202 of the schedule improvement flowchart. The first ID in the process order list and the ID 311 in the work list 310 are collated to acquire the work content of the corresponding process (step S301).

Next, if the work content of the relevant process requires placement in the free space 103, the available time specifying unit 212 calculates candidates for the process that can be placed and possible start times so as to satisfy the space constraint ( step S303). If there are multiple candidates for the process that can be placed and possible start times, one pair is selected at random.

Next, for the work content of the corresponding process, the work time specifying unit 211 determines the start time 344 of the process so that the equipment constraint conditions are satisfied, and the process requiring placement in the free space 103 is after the startable time. is calculated, and the end time 345 is calculated from the work time 316 (step S304).

Next, the work time identification unit 211 removes the ID of the corresponding process from the process order list (step S305).

Next, the working time specifying unit 211 records the content of the corresponding process in the schedule table 340 of the storage device 203 via the output unit 216 (step S306).

Next, if there is a subsequent process on the precedence order constraint of the process, the temporary placement width 332 and the temporary placement depth 333 of the corresponding job #331 given in the size list 330 are used for the process. , the utilization time specifying unit 212 calculates the allocation schedule and possible start time of the space required for temporary placement so as to satisfy the space constraint, and the blocking unit 213 generates blocking information for the temporary placement space (step S307). .

Next, if there is an ID in the process order list (step S308), the utilization time specifying unit 212 returns to step S301, acquires the first ID in the process order list and the work details of the corresponding process, and then obtains the preceding ID of the process. If there is blocking information generated in the preceding step on the order constraint, the blocking unit 213 cancels the blocking information (step S302).

Steps S303 to S307 are performed for the process, and if the process requires placement in the free space 103, the utilization time specifying unit 212 calculates and selects candidates for the process that can be placed ( S303), calculate the start time 344 and end time 345 of the relevant process (S304), remove the ID of the relevant process from the process order list (S305), and determine the provisional placement schedule of the preceding process on the precedence order constraint. A work plan is generated and recorded in the schedule table 340 together with the layout schedule of the process and the work plan (S306), and the blocking section 213 generates blocking information (S307).

Next, if there is a process in the candidate list, the utilization time identification unit 212 returns to step S301 to continue the above process, and if the process order list is an empty set, the process proceeds to step S309 (step S308).

The usage time identification unit 212 evaluates the last recorded schedule table 340 under predetermined conditions, and stores the evaluation result as the plan evaluation result 350 via the output unit 216 (step S309). The predetermined condition is, for example, the maximum value of the end time 345, and the smaller the value, the better the plan evaluation result.

FIG. 11 shows a sequence diagram of the scheduling device 200 according to the first embodiment. The client 1011 is composed of the input device 204 and the output device 205 of the scheduling device 200 .

The input/output unit 1012 is composed of the input unit 215, the output unit 216, and the storage device 203 shown in FIG. The schedule generation unit 1013 includes the process candidate identification unit 210, the work time identification unit 211, the usage time identification unit 212, the blocking unit 213, the schedule determination unit 214, the input unit 215, and the output unit shown in FIG. 216 and the storage device 203 . The schedule improvement unit 1014 and the schedule evaluation unit 1015 include the work time identification unit 211, the usage time identification unit 212, the blocking unit 213, the schedule determination unit 214, the input unit 215, and the output unit 216 shown in FIG. , and the storage device 203 .

The client 1011 performs work and space information input 1016 for inputting work information and space information input by the user of the scheduling device 200 using the input device 204 into the scheduling device 200 .

The input/output unit 1012 receives work and space information 1017 input from the client 1011 and performs work and space information storage 1018 for storing the work and space information 1017 in the storage device 203 .

Upon receiving an optimization request 1019 sent from the client 1011 to the input/output unit 1012 , the input/output unit 1012 sends work and space information 1020 to the schedule generation unit 1013 . The schedule generation unit 1013 stores the schedule table 340 and the plan evaluation result 350 in the storage device 203 using the received work and space information 1020 by the method described in the schedule generation flow chart of FIG. The schedule generation unit 1013 performs an initial solution generation process 1021 for generating schedule information 1022 consisting of the schedule table 340 and the plan evaluation result 350 and sends the schedule information 1022 to the schedule improvement unit 1014 .

Using the received schedule information 1022, the schedule improvement unit 1014 acquires the provisional evaluation results by the method described in step S201 of the schedule improvement flowchart, and performs process order list generation processing 1023 for generating a process order list.

The schedule improvement unit 1014 performs neighborhood solution generation processing 1024 for generating a neighborhood from the process order list by the method described in step S202 of the schedule improvement flowchart, and one or more process order lists included in the neighborhood solution are used as process order information 1025. Send to schedule evaluation unit 1015 .

The schedule evaluation unit 1015 uses the received process order information 1025 to generate a schedule table 340 and plan evaluation results 350 for one or more process order lists by the method described in the schedule evaluation flowchart of FIG. Neighborhood evaluation processing 1026 for storing in the storage device 203 is performed.

Then, the schedule evaluation unit 1015 sends the generated one or more schedule tables 340 and the plan evaluation result 350 to the schedule improvement unit 1014 as the schedule information 1027 . The schedule improvement unit 1014 uses the received schedule information 1027 to perform an improvement process 1029 for updating the schedule table 340 and the plan evaluation result 350 by the method described in steps S203 to S206 of the schedule improvement flowchart in FIG.

A series of loop processing 1028 performed by the schedule improvement unit 1014 and the schedule evaluation unit 1015 performs end determination by the method described in step S207 of the schedule improvement flowchart.

When the loop processing 1028 satisfies the termination condition, the schedule improvement unit 1014 sends the schedule table 340 and the plan evaluation result 350 last updated by the improvement processing 1029 to the input/output unit 1012 as the optimization information 1030 .

The input/output unit 1012 uses the received optimization information 1030 to perform schedule display processing 1031 for displaying the work plan of FIG. 8 from the schedule table 340 of FIG. The client 1011 uses the output device 205 to perform schedule information output 1033 for presenting the work plan to the user based on the received display information 1032 . The user can know the work plan of the factory 100 from the output result.

As described above, in the scheduling device 200 of the first embodiment, when the work times of the processes to be connected are discontinuous due to the precedence order constraint, the machines and products 10 are temporarily placed so that the work times are continuous. A temporary placement process is generated to secure a temporary placement space in the free space 103 . Then, the scheduling apparatus 200 generates blocking information for the temporary placement process to prevent other processes from using the temporary placement space, and cancels the blocking information to precede the process using the temporary placement space. It is possible to calculate the arrangement schedule in the free space 103 including the temporary storage space for the subsequent process on the order constraint.

Then, the scheduling device 200 generates a temporary placement schedule and a work plan from the information at the time of releasing the blocking, thereby making it possible to secure the temporary placement space without disrupting the schedule. As a result, since it is not necessary to secure a dedicated space for the temporary storage space in the factory 100 in advance, it is possible to secure a large space to be used as a work space, and as a result, the productivity of the factory 100 can be improved.

As an example for explaining the effect of the first embodiment, the turn around time from receiving an order to shipping with respect to the ratio of the usable area in the factory 100 used for the dedicated evacuation space and the free space 103 to the dedicated evacuation space is shown. 12.

Since the lower the ratio between the usable area and the dedicated evacuation space, the higher the production efficiency of the factory, the scheduling technology of the first embodiment that does not require an evacuation space is compared to the conventional scheduling technology that requires a dedicated evacuation space. The invention can shorten the period from receipt of an order to shipment, and has the effect of improving production efficiency.

As described above, the scheduling apparatus 200 according to the first embodiment reads the work list 310, the space list 320, and the size list 330, and the process candidate identification unit 210 generates a candidate list of processes that satisfy the precedence order constraint, and In the process of (2), the utilization time specifying unit 212 derives placement candidates that satisfy the space constraint and the possible placement start time, and the work time specifying unit 211 determines the work time that satisfies the precedence order constraint and the facility constraint after the possible placement start time. Then, using the size list 330, the working time specifying unit 211, the usage time specifying unit 212, and the blocking unit 213 generate blocking information, derive an arrangement schedule and a work plan reflecting the blocking information, and cancel the blocking information, The schedule determining unit 214 calculates the plan evaluation result 350 for the layout schedule and work plan, performs schedule improvement processing, and determines the schedule from the plan evaluation result 350 .

Due to such features, the use of the scheduling device 200 makes it possible to improve the efficiency of production work and repair work in the factory 100 .

Example 2 shows another example of the scheduling device 200 of the present invention. Embodiment 2 describes a method of setting the amount of space (size) to be used for temporary placement by designating the size of the machine and product 10 required for temporary placement in the work list 310 .

The temporary storage space described in Example 1 is uniquely determined for each job, but in scheduling where the required size varies depending on the work, it is necessary to specify the size required for the temporary storage space for each process. Cases exist.

For example, when a product is disassembled in the first process and then disassembled in the second process following the precedence order constraint, the size determined for each job as in the first embodiment and the Temporary placement in a disassembled state is preferred because it requires less work than temporary placement in a disassembled state. Also, if it is not possible to assemble after disassembly, it is necessary to specify for each process.

FIG. 13 shows an example of a work list 310 for scheduling according to the second embodiment. The work list 310 is work information generated by the input unit 215 from one or more jobs in which one or more processes are set in chronological order by the user of the scheduling device 200 via the input device 204 .

The work list 310 includes an ID 351 that is a unique value assigned to each process of the work plan in the factory 100, a job # 352 that is the number of each job, a work # 353 that is the work order of the processes included in the job, A process name 354 indicating the work content, a facility to be used 355 required for the process, a work time 356 required to complete the process, a required width 357 and a required depth 358 of the space required for the process, and a required space required for temporary placement. The table defines the width 359 and depth 35a of the space to be used.

As in the first embodiment, the scheduling device 200 reads the work list 310 and the space list 320, and the process candidate identification unit 210 generates a candidate list of processes that satisfy the precedence order constraint. The identifying unit 212 derives placement candidates that satisfy the space constraint and the possible placement start time, the work time specifying unit 211 derives the work time that satisfies the precedence order constraint and the facility constraint after the possible placement start time, and the work list 310 . and the space list 320, the working time specifying unit 211, the usage time specifying unit 212, and the blocking unit 213 generate blocking information, store the work plan reflecting the blocking information, and cancel the blocking information. A plan evaluation result 350 is calculated for a schedule and a work plan, and a schedule improvement process is performed to determine a schedule from the plan evaluation result 350. FIG.

When the work time specifying unit 211, the usage time specifying unit 212, and the blocking unit 213 generate blocking information and store a work plan that reflects the blocking information, it is necessary to temporarily place it in the process (process name 354) of the work list 310. When the space information (width 359 and depth 35a) is set as , the temporary storage space is set not by the size information of the size list 330 but by the space information (width 359 and depth 35a).

As described above, by specifying the size required for the temporary storage space for each process, it is possible to reduce the labor of the work, and it is possible to create a schedule with excellent production efficiency.

Example 3 shows another example of the scheduling device 200 of the present invention. In the third embodiment, a method of creating and canceling blocking and storing a work plan reflecting blocking information using an array used when the usage time specifying unit 212 derives an allocation schedule will be described.

Since the calculation cost can be reduced by integrating the arrays used for the placement plan with the arrays used for blocking, it is possible to reduce the time required for schedule generation.

14A to 14F show examples of using arrays in the conventional example and Example 3. FIG. FIG. 14A shows a conventional example, and FIGS. 14B to 14F show Example 3 of the present invention. In FIG. 14A, the step (1)-2 succeeding the step (1)-1 on the preceding order constraint, the step (2)-1 of a job different from the steps (1)-1 to 2, and the step (1)-1 )-1 to 2 and step (3)-1 of the job, which is different from step (2)-1, there are four operations.

The space size required for the operation of step (1)-1 is "4", and the space size required for the operation of step (1)-2 is "2". The space size required for the work of step (2)-1 is "2", and the space size required for the work of step (3)-1 is "5".

The work time required for the work of process (1)-1 is "1", the work time required for the work of process (1)-2 is "2", and the work required for the work of process (2)-1 The time is "2", the work time required for the work of the process (3)-1 is "1", and the process (1)-2 and the process (2)-1 use the same fixed facility 102. Assuming that work is to be performed, process (2)-1 is a process that has been confirmed as a work plan, process (3)-1 can start work after time "t1", and process (1) is a process candidate. )-1 work plan is derived.

FIG. 14A is a work plan according to the prior art. After deriving the work plan and the layout schedule using the work time identification unit 211 and the usage time identification unit 212, the arrangement for managing the space is determined regardless of the layout of the process (1)-1 and the process (2)-1. element is "0", the element related to the arrangement of step (1)-1 is "1" corresponding to "t1" of the end time 345 of step (1)-1, step (2)-1 is "2" corresponding to "t2" of the end time 345 of step (2)-1.

When process (1)-1 is confirmed as a work plan, the work plan and layout schedule for process candidates process (1)-2 and process (3)-1 can be planned by the dashed rectangle in the figure, and process (3 )-1 from time "t1", it is necessary to evacuate process (1)-1 at time "t1".

On the other hand, FIG. 14B is an example of the third embodiment, in which the integrated arrangement and placement plan for managing the space are generated after the blocking information is generated in step S107 of the schedule generation flowchart or step S309 of the schedule evaluation flowchart of the first embodiment. show.

In the integrated array that manages the space, elements unrelated to the placement of steps (1)-1 and (2)-1 are "0", and elements related to the placement of step (1)-1 can be set. is the maximum value "MAX" (X in the figure), and the element related to the arrangement of step (2)-1 is "2" corresponding to "t2" of the end time 345 of step (2)-1 be.

Here, the integrated array will be described. FIG. 17 is a diagram showing an example of integrated arrangement. The integration array compares the elements in the same space position between the space management array that manages the space after deriving the work plan and placement schedule, and the blocking management array that prohibits the addition of processes and temporary placements in the space. is an array that adopts the larger value.

In FIG. 17, the space management array and blocking management array are arrays for dividing the free space 103 of FIG. The blocking management array is information that specifies partitions in which addition of a process or temporary storage space is prohibited. The integrated array is information indicating jobs to be assigned to each partition in the free space 103 and partitions to which assignment is prohibited. The divisions in the free space 103 may be set in each of the width direction and the depth direction, or may be set in a predetermined area.

"X" in the blocking management array indicates the maximum value "MAX" that can be set, and "1" and "2" in the space management array indicate the values of the job end time 345. FIG.

Below, when the process (1)-1 is confirmed as a work plan, the process (3)-1 is indicated by the dashed rectangle as being unplanable, and the process candidate process (1)-2 is indicated by the dashed rectangle as being planable. I will explain how.

FIG. 14C shows an integrated array and layout plan for managing space when the work plan and layout schedule are derived using the working time identifying unit 211 and the utilization time identifying unit 212 for the process candidate process (3)-1. show.

The allocation schedule that can start work after the allocation start time "t1" of the process candidate process (3)-1 has five consecutive "1" or less of the required size of the integrated array element that manages the space. Therefore, it cannot be derived and planning becomes impossible.

FIG. 14D shows an integrated array and layout plan for managing space when the work plan and layout schedule are derived using the working time identifying unit 211 and the utilization time identifying unit 212 for the process candidate process (1)-2. show.

Since process (1)-1 and process (1)-2 are the same job, blocking cancellation is applied in step S102 of the schedule generation flow chart or step S302 of the schedule evaluation flow chart in the first embodiment to manage the space. In the integrated sequence, elements not corresponding to steps (1)-1 and (2)-1 are "0", and elements corresponding to step (1)-1 are "MAX" to step (1)-1. It is replaced with "1" corresponding to the end time 345, and the element corresponding to the process (1)-1 becomes "1" corresponding to the end time 345 of the process (1)-1.

For this reason, the placement schedule that can start work at the placement start time "t2" of the process candidate process (1)-2 has two consecutive elements of the size required for the integrated array and is "2" or less. It can be derived and planning becomes possible.

FIG. 14E shows an integrated array and layout plan for managing space when the work plan and layout schedule are derived using the working time identifying unit 211 and the utilization time identifying unit 212 for the process candidate process (1)-2. show.

In step S106 of the schedule generation flowchart of the first embodiment or step S306 of the schedule evaluation flowchart, the temporary placement schedule and work plan of step (1)-1 are scheduled from the blocking information and the start time 344 of step (1)-2. Record in table 340. In the temporary placement schedule of the process (1)-1, the element related to the temporary placement of the process (1)-1 is set to "2" corresponding to "t2" of the start time 344 of the process (1)-2. By doing so, it will be reflected in the integrated array. In the temporary placement work plan of process (1)-1, "t2" of the end time 345 of process (1)-1 is from the start time of temporary placement, and the start time 344 of process (1)-2 is temporarily placed. 't2' from the end time of step (1)-1, and generated from the position and size in the space used in the placement of step (1)-1.

FIG. 14F shows an integrated array and layout plan for managing space when the work plan and layout schedule are derived using the working time identifying unit 211 and the utilization time identifying unit 212 for the process candidate process (1)-2. show.

Blocking generation is applied in step S107 of the schedule generation flow chart or step S307 of the schedule evaluation flow chart in the first embodiment, and the integrated array that manages the space can set the element corresponding to step (1)-2 from "2". is replaced with "MAX" which is the maximum value.

In the third embodiment, an example has been described in which the position in the space to be blocked, which is the temporary storage space, is arranged in the space used in the preceding process on the precedence order constraint. Blocking in the space used in the preceding step saves the trouble of moving, and thus has the effect of improving productivity.

If the position to be blocked is a position where it can be placed, there is an effect that the space can be effectively used without requiring a dedicated temporary storage space, so it is not always necessary to block the used space. In addition, if it is possible to arrange, the space within the specified range specified by the work information may be blocked.

In Example 3, blocking was described as a method of realizing blocking by setting the element of the integrated array that manages the space to the maximum value "MAX", but any value that indicates that blocking is applied If so, it is not limited to "MAX", which is the maximum value that can be set.

For example, by setting the element of the integrated array that manages the space to a character corresponding to job #352, it is possible to determine that the element is blocked if the element is a character, and at the same time to know job #352 from the character. This eliminates the need to memorize which element of the integrated array that manages the space corresponds to the blocking performed by job #352, so that the calculation time can be reduced.

As another method, by subtracting job #352 from the settable maximum value "MAX", blocking can be realized and at the same time job #352 can be known from the value of the element of the integrated array. Since there is no need to manage characters corresponding to job #352, resources of the scheduling device 200 can be effectively utilized.

As in the first embodiment, the scheduling device 200 reads the work list 310 and the space list 320, the process candidate identification unit 210 generates a candidate list of processes that satisfy the precedence order constraint, and uses it for the processes of movable work. The time specifying unit 212 derives placement candidates that satisfy the space constraint and the placement start time, and the work time specifying unit 211 derives the work time that satisfies the precedence order constraint and the facility constraint after the placement start time. 3, the work list 310, the space list 320, and the size list 330, the work time specifying unit 211, the usage time specifying unit 212, and the blocking unit 213 generate blocking information and store a work plan reflecting the blocking information. Then, the schedule determining unit 214 calculates the plan evaluation result 350 for the layout schedule and the work plan, performs schedule improvement processing, and determines the schedule from the plan evaluation result 350 .

As described above, it is possible to improve the productivity of the factory by using the dedicated space of the temporary storage space as the work space.

Embodiment 4 shows another example of the scheduling device 200 of the present invention. Embodiment 4 describes a method of presenting a schedule without failure for products on backorder for which work can be started later than the earliest start time in the schedule table 340 shown in FIG.

By introducing an array that manages product placement after arrival separately from the integrated array, it is possible to generate a work plan that takes into consideration the temporary storage space after arrival.

A scheduling method that considers backordered products will be described with reference to FIG. FIG. 15 shows an integrated arrangement for dividing and managing the free space 103 after deriving the work plan and layout schedule for the process (1)-1 and the process (2)-1, and reserving the space for the backordered products. The arrangement (space reservation arrangement) and the arrangement plan of the processes in the free space 103 are shown.

Here, the process (3)-2 succeeding the process (3)-1 on the precedence order constraint, the process (1)-1 of the job different from the processes (3)-1 and 2, and the process (1) Process (2)-1 of a job different from -1 and process (3)-1 to 2, and a job different from process (1)-1 and process (2)-1 and process (3)-1 to 2 There are five operations in all of step (4)-1 of .

The space size required for the work of process (1)-1 is "4", the space size required for the work of process (2)-1 is "2", and the space required for the work of process (3)-1 The size is "4", the space size required for the operation of step (3)-2 is "2", and the space size required for the operation of step (4)-1 is "2".

The work time required for the work of process (1)-1 is "1", the work time required for the work of process (2)-1 is "2", and the work required for the work of process (3)-1 The time is "1", the work time required for the work of step (3)-2 is "2", and the work time required for the work of step (4)-1 is "3".

Of the above, the process (2)-1 and the process (3)-2 are fixed work using the same fixed equipment 102, and the process (2)-1 is a process confirmed as a work plan. 4)-1 is a backordered product for which work can be started after time "t2" (arrival time), and process candidates are process (3)-2, process (3)-1, and process (4). )-1 exists.

FIG. 16 shows a flow chart of schedule generation corresponding to scheduling of backordered products. At step S401 of the schedule generation flow chart, the blocking unit 213 generates the space reservation array shown in FIG. In the space reservation array generated here, the element corresponding to process (4)-1 is "2" from arrival time t2 of process (4)-1, and the other elements are "0".

Next, when deriving a work plan and a layout schedule using the work time identification unit 211 and the utilization time identification unit 212 for the process (3)-1 as a process candidate, in step S404 the space reservation array and the process (3)-1 The possible arrangement completion time "t1" is calculated from the possible arrangement start time "t0" of -1 and the work time "1".

Then, since all the elements of the space reservation array are four consecutive elements of the required size and are equal to or less than "1" of the placement completion possible time t1, the utilization time specifying unit 212 '0' to '4' can be derived, and the work plan start time 't0' and end time 't1' can be derived in step S405.

Next, the usage time specifying unit 212 selects step (3)-1 in step S406, and the blocking unit 213 determines whether deadlock occurs in step S407. In this case, since no blocking information is generated, no determination is made, and the process proceeds to step S408.

Next, in steps S408 to S40a, the blocking unit 213 stores the placement schedule and work plan of step (3)-1 and generates blocking, updates the integrated array with the maximum value that can be set, and generates the next candidate list. do.

Next, the blocking unit 213 unblocks the process (3)-2 as a process candidate in step S403. 3) Deriving the start time "t2" and the end time "t4" of -2, and selecting step (3)-2 in step S406.

Next, the blocking unit 213 determines deadlock occurrence in step S407. Here, the determination method is to derive the layout schedule and work plan of the temporary storage space in step (1)-1 from the start time and blocking information of step (3)-2, and integrate the arrangement corresponding to the layout position of the temporary storage space. is set to "2" from the start time t2 of step (3)-2. If the values of the elements of the space reservation array other than "0" are greater than or equal to the values of the corresponding elements of the integration array, it is determined that deadlock does not occur.

If the values of the elements of the space reservation array other than "0" are less than the values of the corresponding elements of the integrated array, it is determined that a deadlock has occurred, and the utilization time identification unit 212 The allocation schedule and work plan for steps (3)-1 and (3)-2 are deleted from the schedule table 340 of the storage device 203, and the process returns to step S402.

The blocking unit 213 may count the number of occurrences of deadlocks in order to prevent deadlocks from continuing to occur. When the count number reaches a predetermined number or more, the blocking unit 213 sets the values of the elements of the space reservation array corresponding to the positions "1" to "3" in the space as the values of the elements of the integrated array, and the elements of the reserved array. is set to "0", the deadlock can be eliminated.

Also, the blocking unit 213 does not generate blocking information for the last process of each job, so that the values of the elements of the integrated array do not become the maximum values that can be set. Since the used space can be used by other jobs, productivity can be improved.

Next, for the process (4)-1 as a process candidate, the work plan start time "t2" and end time "t2" and the end time " t5” and the positions “1” to “3” in the space to be arranged are derived, and when step (4)-1 is selected, no deadlock occurs in step S407, and step (4)-1 in step S408. from the start time and the space reservation array to generate a temporary placement schedule and a work plan after arrival, and record them in the schedule table 340 together with the placement schedule and work plan of step (4)-1.

As described above, in the scheduling device 200 of the fourth embodiment, the work list 310 and the space list 320 are read, the blocking unit 213 generates a space reservation array, and the process candidate identification unit 210 generates a candidate list of processes that satisfy the precedence order constraint. , and in the moving work process, the utilization time specifying unit 212 uses the space reservation array and the integrated array to derive placement candidates that satisfy the space constraint and the placement start time, and the work time specifying unit 211 can start placement. Work time that satisfies the precedence order constraint and facility constraint after the time is derived, deadlock occurrence is determined for the selected process, and the work time identification unit 211 uses the work list 310, the space list 320, and the size list 330 The usage time identification unit 212 and the blocking unit 213 generate blocking information, store the work plan reflecting the blocking information, and cancel the blocking information. And using the space reservation array, the temporary storage arrangement schedule and work plan after arrival are stored, and the schedule determination unit 214 calculates the plan evaluation result 350 for the arrangement schedule and work plan, performs schedule improvement processing, and from the plan evaluation result 350 Decide on a schedule.

As described above, the scheduling device 200 stores the product arrangement after arrival in the schedule table 340, thereby avoiding the failure of the schedule table 340 and presenting the schedule for the products waiting for arrival. .

<Conclusion>
As described above, the scheduling method of the scheduling device 200 of the first to fourth embodiments can be configured as follows.

(1) A computer (scheduling device 200) having a processor (CPU 201) and a memory (202), in which one or more jobs in which one or more processes are set in chronological order are stored in a predetermined space (fixed facility 102, free space 103) to generate a schedule (schedule table 340), wherein the computer (200) includes one or more jobs in which one or more steps are set in chronological order, and the step (314) Work information in which the required values of the space to be used (required width 317, required depth 318), the work time required for the work of the process (316), and the chronological order of the process (work #313) are set. (work list 310), space information (space list 320) in which a plurality of work spaces for performing the processes are set in advance, and size information (size list) in which sizes to be used for temporary placement are set in advance for each job 330), and a storage step (input/output unit 1012) of storing in the memory (202), and the computer (200) reads the work information (310) and stores the time-series order The work space that satisfies (313) and satisfies the required values (317, 318) of the space is selected from the space information (320), and the chronological order of each process and the arrangement in the space. is determined, the size information (330) is used to calculate a temporary storage space schedule that satisfies the space request values (317, 318), blocking information is added to the temporary storage space schedule, and the blocking A process order list generation step (process order list generation processing 1023) for generating a process order list by releasing the blocking information assigned to the schedule of the temporary storage space after the information is reflected in the arrangement in the space; A scheduling method comprising:

With the above configuration, the scheduling device 200 generates blocking information for a temporary placement process to prevent other processes from using the temporary placement space, and cancels the blocking information to use the temporary placement space. It is possible to calculate the arrangement schedule in the free space 103 including the temporary storage space for the subsequent process on the precedence order constraint.

By applying blocking, it is possible to secure a temporary storage space without disrupting the schedule, eliminating the need to secure a dedicated temporary storage space at the production site in advance, and using the dedicated temporary storage space as a work space. Therefore, it is possible to provide a scheduling method that improves the efficiency of a production site such as a factory.

(2) In the scheduling method described in (1) above, the computer (200) generates the process order list as an initial solution, calculates the evaluation of the initial solution as a plan evaluation result (350), An initial solution generation step (initial solution generation processing 1021) that holds the plan evaluation result (350) as a provisional evaluation result, and a range in which the computer (200) satisfies the time-series order for the process order list of the initial solution to generate one or more different process order lists, generate these process order lists as neighborhood solutions, and generate plan evaluation results (350) of the neighborhood solutions for each of the process order lists a neighborhood solution generation step (neighborhood solution generation processing 1024) for holding the plan evaluation result (350) of the process order list that satisfies a predetermined condition as a comparative evaluation result; (200) further includes a schedule generation step of generating a schedule based on the process order list of the provisional evaluation result and the comparative evaluation result that satisfies a predetermined condition.

With the above configuration, the scheduling device 200 generates a plurality of neighborhood solutions in which the order of the steps is changed according to the precedence order constraint based on the process order list generated as the initial solution and the provisional evaluation result, and from the evaluation value of the neighborhood solution A plan evaluation result 350 is calculated. Then, the schedule determination unit 214 selects the plan evaluation result with the best plan evaluation result (for example, the lowest evaluation value) as the comparative evaluation result, and the comparative evaluation result has a better value (lower evaluation value) than the provisional evaluation result. Then, it is possible to generate a comparison schedule table of neighboring solutions corresponding to the comparative evaluation result as the best schedule table 340 .

(3) In the scheduling method described in (1) above, the process order list generation step (1023) includes charts or layouts (work plan screen 800) showing the chronological order of the processes and the arrangement in the space. and the temporary placement space is a temporary placement process connecting the processes not included in the work information (310).

With the above configuration, when one process is divided into a plurality of time periods, the scheduling device 200 generates a temporary placement process for temporarily placing the machine and the product 10 in order to connect the one process. A temporary storage space can be secured in the free space 103. - 特許庁

(4) In the scheduling method described in (1) above, the work information (310) includes variable space information (width 359, depth 35a) presetting the size of the temporary storage space for each process. , the process order list generation step (1023), when the variable space information (359, 35a) is set in the work information (310), regardless of the size information (330), the variable space information A scheduling method, wherein the temporary storage space is set with a value of (359, 35a).

With the above configuration, by designating the size required for the temporary storage space for each process, it is possible to reduce work and effort, and to realize schedule generation with excellent production efficiency.

(5) The scheduling method according to (1) above, wherein the space includes a free space (103) that can be used by designating a position for executing the job, and the process order list generating step (1023) designates a partition for which the blocking information is set using management information for dividing the free space (103) into predetermined partitions for management, and the management information is a space for managing the jobs allocated to the partitions. The above A scheduling method comprising jobs to be assigned to each partition and integrated information (integrated array) indicating partitions to which assignment is prohibited.

With the above configuration, it is possible to improve the productivity of the factory by using the space dedicated to the temporary storage space within the free space 103 as the work space.

(6) In the scheduling method described in (1) above, the process order list generation step (1023), when adding blocking information to the schedule of the temporary storage space, A scheduling method, wherein the blocking information is added to the space, the blocking information is reflected in the layout of the space, and then the blocking information added to the schedule of the temporary space is released.

With the above configuration, when arranging the position in the space to be blocked as a temporary storage space in the space used in the preceding process on the precedence order constraint, it is not possible to block in the space used in the preceding process , there is an effect of saving the trouble of moving and improving productivity.

(7) In the scheduling method described in (1) above, in the process order list generation step (1023), when adding blocking information to the schedule of the temporary storage space, the work information (310) A scheduling method, wherein the blocking information is set in the specified space.

With the above configuration, by specifying the space set in the work list 310, it is possible to reduce the time and effort of the work, and it is possible to create a schedule with excellent production efficiency.

(8) The scheduling method according to (5) above, wherein the work information (310) includes a step of handling backordered products for which work can be started later than the earliest start time of the schedule. , the process order list generation step (1023) generates, from the work information (310), a schedule for allocating a process including a backordered product to the section as reservation management information (space reservation array), and the reservation management information and A scheduling method, wherein, using the integrated information, the arrangement of the processes for handling the products on backorder after arrival is determined.

With the above configuration, the scheduling apparatus 200 stores the product arrangement after arrival in the schedule table 340, thereby avoiding the schedule table 340 from being broken and making it possible to present the schedule for the products on the waiting list.

(9) The scheduling method described in (5) above, characterized in that the integrated information is set by subtracting a job identifiable value (job #342) from a settable maximum value (MAX). scheduling method.

With the above configuration, by subtracting job #352 from the maximum value that can be set, "MAX", blocking can be realized and at the same time job #352 can be known from the value of the element of the integration array. Since there is no need to manage characters corresponding to 352, resources of the scheduling device 200 can be effectively utilized.

In addition, the present invention is not limited to the above-described embodiments, and includes various modifications. For example, the above embodiments are described in detail for easy understanding of the present invention, and are not necessarily limited to those having all the described configurations. In addition, it is possible to replace part of the configuration of one embodiment with the configuration of another embodiment, and it is also possible to add the configuration of another embodiment to the configuration of one embodiment. In addition, addition, deletion, or replacement of other configurations for a part of the configuration of each embodiment can be applied singly or in combination.

Further, each of the above configurations, functions, processing units, processing means, and the like may be realized by hardware, for example, by designing them in an integrated circuit. Further, each of the above configurations, functions, etc. may be realized by software by a processor interpreting and executing a program for realizing each function. Information such as programs, tables, and files that implement each function can be stored in recording devices such as memories, hard disks, SSDs (Solid State Drives), or recording media such as IC cards, SD cards, and DVDs.

Further, the control lines and information lines indicate those considered necessary for explanation, and not all control lines and information lines are necessarily indicated on the product. In practice, it may be considered that almost all configurations are interconnected.

100 factory 102 fixed facility 103 free space 200 scheduling device 201 CPU
202 memory 203 storage device 210 process candidate identification unit 211 work time identification unit 212 usage time identification unit 213 blocking unit 214 schedule determination unit 310 work list 320 space list 330 size list 340 schedule table 350 plan evaluation result

Claims (15)

A scheduling method for generating a schedule for executing one or more jobs, in which one or more processes are set in chronological order, in a predetermined space using a computer having a processor and a memory, comprising:
The computer includes one or more jobs in which one or more processes are set in chronological order, a request value of the space used for each of the processes, a work time required for the work of the process, and a time series of the work of the process. Work information in which an order is set, space information in which a plurality of work spaces for performing the processes are set in advance, and size information in which a size used for temporary placement is set in advance for each job are stored in the memory. a storage step of storing;
The computer reads the work information, selects the work space that satisfies the time-series order and satisfies the space request value for each of the processes from the space information, and selects the work space from the space information. determining the chronological order and arrangement in the space, calculating a schedule of a temporary storage space that satisfies the required value of the space using the size information, and adding blocking information to the schedule of the temporary storage space; a process order list generation step of generating a process order list by reflecting the blocking information on the arrangement in the space and then canceling the blocking information assigned to the schedule of the temporary storage space;
including
The blocking information is information representing a possible start time for another process in order to exclude the addition of a new process or temporary placement to the temporary placement space,
In the process order list generation step,
When assigning the blocking information to the schedule of the temporary storage space, by assigning the maximum value that can be set as the blocking information, the addition of a new process or temporary storage to the temporary storage space is eliminated,
When adding a new process to the temporary storage space to which the blocking information is set, the blocking information is replaced with the end time of the preceding process only for the process following the preceding process. A scheduling method characterized by allowing release of information . The scheduling method of claim 1, comprising:
an initial solution generation step in which the computer generates the process order list as an initial solution, calculates an evaluation of the initial solution as a plan evaluation result, and holds the plan evaluation result as a provisional evaluation result;
The computer generates one or more different process order lists by permuting the order of the processes in the process order list of the initial solution within a range that satisfies the chronological order, and converts these process order lists into neighboring solutions. , calculating the plan evaluation result of the neighborhood solution for each process order list, and holding the plan evaluation result of the process order list where the value of the plan evaluation result satisfies a predetermined condition as a comparative evaluation result. When,
a schedule generation step in which the computer generates a schedule based on the process order list of the provisional evaluation result and the comparative evaluation result, whichever satisfies a predetermined condition;
A scheduling method, further comprising: The scheduling method of claim 1, comprising:
The process order list generation step includes:
The chronological order of the steps and the arrangement in the space are output as a chart or layout, and the temporary placement space is a temporary placement step that connects the steps not included in the work information. Scheduling method. The scheduling method of claim 1, comprising:
the work information includes variable space information that presets the size of the temporary storage space for each process;
The process order list generation step includes:
A scheduling method, wherein, when the variable space information is set in the work information, the temporary storage space is set with the value of the variable space information regardless of the size information. The scheduling method of claim 1, comprising:
The space is
including a free space available by designating a location to perform the job;
The process order list generation step includes:
Designating a partition for setting the blocking information using management information for dividing the free space into predetermined partitions and managing them;
The management information is
space management information for managing the jobs assigned to the partitions; blocking management information for specifying partitions to which addition of the process or the temporary storage space is prohibited; and the product of the space management information and the blocking management information. A scheduling method comprising jobs to be assigned to each partition and integrated information indicating partitions to which assignment is prohibited. The scheduling method of claim 1, comprising:
The process order list generation step includes:
When the blocking information is added to the schedule of the temporary storage space, the blocking information is added to the space used in the preceding step, and the blocking information is reflected in the layout of the space. A scheduling method characterized by canceling blocking information attached to a schedule of a temporary storage space. The scheduling method of claim 1, comprising:
The process order list generation step includes:
A scheduling method, wherein, when adding blocking information to a schedule of the temporary storage space, the blocking information is set to the space specified by the work information. A scheduling method according to claim 5, wherein
The work information includes a process of handling backordered products that can start work later than the earliest start time of the schedule,
The process order list generation step includes:
A schedule for allocating a process including a backordered product to the section is generated from the work information as reservation management information, and the reservation management information and the integrated information are used to arrange the process for handling the backordered product after arrival. A scheduling method characterized by determining A scheduling method according to claim 5, wherein
The integrated information includes:
A scheduling method that is set by subtracting a value that can identify a job from the maximum value that can be set. A scheduling device having a processor and a memory and generating a schedule for executing one or more jobs in which one or more processes are set in chronological order in a predetermined space,
The processor includes one or more jobs in which one or more steps are set in chronological order, a request value of the space used for each of the steps, a work time required for the work of the step, and a time series of the steps. Work information in which an order is set, space information in which a plurality of work spaces for performing the processes are set in advance, and size information in which a size used for temporary placement is set in advance for each job are stored in the memory. store and
The processor reads the work information and selects, from the space information, the work space that satisfies the chronological order and satisfies the space request value for each of the steps, determining the chronological order and arrangement in the space, calculating a schedule of a temporary storage space that satisfies the required value of the space using the size information, and adding blocking information to the schedule of the temporary storage space; After reflecting the blocking information on the arrangement in the space, executing a process order list generation process for generating a process order list by canceling the blocking information given to the schedule of the temporary storage space ,
The blocking information is information representing a possible start time for another process in order to exclude the addition of a new process or temporary placement to the temporary placement space,
In the process order list generation process,
When assigning the blocking information to the schedule of the temporary storage space, by assigning the maximum value that can be set as the blocking information, the addition of a new process or temporary storage to the temporary storage space is eliminated,
When adding a new process to the temporary storage space to which the blocking information is set, the blocking information is replaced with the end time of the preceding process only for the process following the preceding process. A scheduling device characterized by permitting release of information . A scheduling device according to claim 10,
The processor receives the process order list as an initial solution, calculates an evaluation of the initial solution as a plan evaluation result, and executes an initial solution generation process of holding the plan evaluation result as a provisional evaluation result,
The processor generates one or more different process order lists by permuting the order of the processes in the process order list of the initial solution within a range that satisfies the order of the time series, and converts these process order lists into neighboring solutions. , the plan evaluation result of the neighborhood solution is calculated for each process order list, and the plan evaluation result of the process order list where the value of the plan evaluation result satisfies a predetermined condition is held as a comparison evaluation result. and run
The scheduling apparatus, wherein the processor generates the schedule based on the process order list that satisfies a predetermined condition out of the provisional evaluation result and the comparative evaluation result. A scheduling device according to claim 10,
The process order list generation process includes:
The chronological order of the steps and the arrangement in the space are output as a chart or layout, and the temporary placement space is a temporary placement step that connects the steps not included in the work information. scheduling device. A scheduling device according to claim 10,
the work information includes variable space information that presets the size of the temporary storage space for each process;
The process order list generation process includes:
A scheduling device, wherein when the variable space information is set in the work information, the temporary storage space is set with the value of the variable space information regardless of the size information. A scheduling device according to claim 10,
The space is
including a free space available by designating a location to perform the job;
The process order list generation process includes:
Designating a partition for setting the blocking information using management information for dividing the free space into predetermined partitions and managing them;
The management information is
space management information for managing the jobs assigned to the partitions; blocking management information for specifying partitions to which addition of the process or the temporary storage space is prohibited; and the product of the space management information and the blocking management information. 1. A scheduling device, comprising jobs to be assigned to each partition and integrated information indicating partitions to which assignment is prohibited. A storage medium storing a program for causing a computer having a processor and a memory to execute one or more jobs in which one or more processes are set in chronological order in a predetermined space,
It includes one or more jobs in which one or more processes are set in chronological order, and the required space to be used for each process, the work time required for the work of the process, and the chronological order of the processes are set. a storage step of storing, in the memory, the work information obtained by the process, space information in which a plurality of work spaces for performing the process are set in advance, and size information in which a size used for temporary placement is set in advance for each job; When,
reading the work information, for each of the steps, selecting from the space information the work space that satisfies the time-series order and satisfies the space requirement value, and the time-series order of each step; and determine the arrangement in the space, calculate a schedule of a temporary storage space that satisfies the required value of the space using the size information, add blocking information to the schedule of the temporary storage space, and add the blocking information to the schedule of the temporary storage space a process order list generating step of generating a process order list by canceling blocking information assigned to the schedule of the temporary storage space after reflecting it in the arrangement in the space;
including
The blocking information is information representing a possible start time for another process in order to exclude the addition of a new process or temporary placement to the temporary placement space,
In the process order list generation step,
When assigning the blocking information to the schedule of the temporary storage space, by assigning the maximum value that can be set as the blocking information, the addition of a new process or temporary storage to the temporary storage space is eliminated,
When adding a new process to the temporary storage space to which the blocking information is set, the blocking information is replaced with the end time of the preceding process only for the process following the preceding process. A non-temporary, computer-readable storage medium storing a program for causing the computer to execute allowing release of information .

Images