JP2002215216A - Device and method for scheduling and recording medium - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a scheduling device which makes an optimum solution search using GA effectively function under certain specific conditions wherein respective operations are in the same rank. SOLUTION: This device has a schedule generation part 4, a GA processing part 3 which controls the generation of an initial individual schedule and a crossover individual schedule by the schedule generation part 4 to perform genetic algorithm processing, a cut set acquisition part 6, a schedule temporary setting part 7 which schedules tasks of the cut set in a state wherein there is no restriction on machines, an earliest completion task acquisition part 8, a conflict set acquisition part 9, a task restriction adaptation pat 10 which changes the tasks of a conflict set into ones meeting the restrictions by a processing task, a schedule task determination part 11 which determines tasks determining a schedule from the changed conflict set, a cut set update part 12, a processing time matching part 13, a processing machine matching part 14, a processing task matching part 15, and a control part 16.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a scheduling apparatus for adjusting a schedule of a machine process, a scheduling method for adjusting a schedule of a machine process, and a recording medium for executing the method.

[0002]

2. Description of the Related Art In recent years, in the field of manufacturing, unmanned operation has progressed, and a large number of automatic machines and industrial robots for processing and assembly have been introduced. In order to operate these machines efficiently, it is necessary to set an appropriate schedule according to the work process.

In general, when a plurality of jobs are performed by a plurality of machines, a problem of determining a processing order in each machine so as to minimize the completion time of all the jobs is called a job shop scheduling problem. This problem can be considered as a combination optimization problem, but as the number of jobs and machines increases, the executable schedule also increases exponentially, so it is time-consuming to determine the optimal schedule from all combinations. Becomes impossible. For this reason, a method of efficiently finding a sub-optimal solution within a finite time by an approximate solution method is adopted. One of the approximate solutions is a method using a genetic algorithm (hereinafter abbreviated as "GA").
Using an individual that expresses the solution of the problem as a symbol string, imitating the genetic mechanism and natural selection of an organism, an optimal solution search is performed using a set of individuals. In the job shop scheduling problem, a schedule called an active schedule is known as a better set of schedules.
Performing the optimal solution search by A enables more efficient optimal solution search.

FIG. 1 shows a conventional technique of generating an active schedule which is one of scheduling methods in the job shop scheduling problem.
0 and FIG. FIG. 10 is a flowchart showing a conventional technique of an active schedule generation method which is one of scheduling methods.
(A)-(g) is a schedule determination process diagram showing the schedule determination process according to the flowchart of FIG.
FIG. 11A shows scheduling target data,
Scheduling of three work columns of work 1, work 2, and work 3 is performed. Each operation consists of three tasks (machine processing), operation 1 is in the order of machine 1 → machine 2 → machine 3, operation 2 is in the order of machine 2 → machine 3 → machine 1, and operation 3 is machine 1 →
The task sequence is processed in the order of machine 3 → machine 2. The length of each task represents the processing time, and the horizontal axis is the time axis in FIG.

[0005] In FIG. 10, first, a set C (cut set C) of tasks that can be started, which is specified by a processing order or the like, among tasks that are not scheduled, is obtained (S1, FIG. 11B). Next, for each task of the cut set C, the earliest start time and earliest completion time when there is no restriction that each machine can process only one operation at a time is set (S2). Next, a task EC (earliest completed task) having the earliest completion time is obtained from the tasks of the cut set C (S3, FIG. 11C). Next, from the cut set C, a set G (conflict set G) of tasks in which the task EC and the processing machine are the same and the processing time overlaps is determined (S4, FIG. 11D). Next, the conflict set G
, An arbitrary task for determining the schedule is determined (S5, FIG. 11E). Next, the earliest start time and earliest completion time of each task in the cut set are reset based on the task determined in step S5 (S6, FIG. 11).
(F)). Next, the task determined in step S5 is removed from the cut set, and if there is a next task, the task is added to the cut set C (the updated cut set C) (S5).
7, FIG. 11 (g)). Next, if there is an unscheduled task in the cut set C, the process returns to step S3 and continues (S8). If there is no unscheduled task, the active schedule generation processing ends.

[0006] The above-described conventional active schedule generation method corresponds to a general job shop scheduling problem, and does not know the sequence of each operation. However, in the case of industrial robots in the manufacturing field, it is easy to think of a situation where a plurality of products having the same work process are manufactured. In this case, job shop scheduling with a specific condition that the work sequence is the same Can be seen as a problem.

[0007]

However, in the conventional active schedule generation method as a conventional scheduling method, since the above specific conditions are not taken into consideration, the same processing schedule for each machine is generated as a different schedule. When the same schedule is expressed as different individuals, it is difficult to imitate the genetic mechanism of an organism, and the solution space is widened. There was a problem that the solution search became difficult to function effectively.

In the scheduling apparatus, the scheduling method, and the recording medium, even under a specific condition that the arrangement of each work is the same, the optimum work using the GA is performed by using the active schedule generation method focused on the work to be scheduled and the focused operation. Solution search is required to work effectively.

In order to satisfy this requirement, the present invention provides a GA under specific conditions where the sequence of operations is the same.
And a scheduling device that enables the optimal solution search using the GA to function effectively even under a specific condition that the sequence of each task is the same. It is an object to provide a method and a recording medium for executing the scheduling method.

[0010]

In order to solve the above-mentioned problems, a scheduling apparatus according to the present invention comprises: an input unit for inputting data or the like by a user; and scheduling data for storing scheduling target data specified via the input unit. A storage unit, a schedule generation unit that performs a schedule generation process based on the data to be scheduled, a GA processing unit that controls generation of an initial individual schedule and a crossover individual schedule by the schedule generation unit, and performs a genetic algorithm process, A schedule storage unit that stores a scheduling result determined by the unit, a cut set acquisition unit that acquires a cut set that is a set of process startable tasks specified by a processing order among unscheduled tasks, Tasks controlled by machine A provisional schedule setting section that schedules without tasks, an earliest completed task acquisition section that obtains the earliest completed task, which is the task with the earliest completion time, from the tasks in the cut set, and the processing time that is the same as the earliest completed task and the processing machine A conflict set acquisition unit that selects a task of a conflict set that is an overlapping task from a cut set, and a task constraint matching unit that changes a task of the conflict set to only one that satisfies the constraint by the processing task,
A schedule task determination unit that determines a task that determines the schedule from the changed conflict set, a cut set update unit that updates the cut set according to the determined schedule, a processing time matching unit that checks the processing time of each task, A processing machine collating unit for collating the processing machine of each task, a processing task collating unit for collating the processing task, and a control unit for controlling each function, operation between functions, and data flow are provided.

As a result, a scheduling apparatus can be obtained in which the optimal solution search using the GA can function effectively even under a specific condition that the sequence of each task is the same.

In order to solve the above problems, a scheduling method according to the present invention includes a data specifying step of specifying data to be scheduled, a data storing step of storing the specified data to be scheduled, and a schedule based on the data to be scheduled. Generate and G
A scheduling method having a schedule determination step of determining a schedule by performing the processing A, and a schedule storage step of storing the determined schedule, wherein the schedule generation processing in the schedule determination step starts processing specified by a processing order or the like. A cut set determination step for obtaining a cut set, which is a set of possible tasks, a schedule provisional setting step for temporarily setting a schedule for each task in the cut set, and an earliest completed task for acquiring the earliest completed task that is the earliest completion time An acquisition step, a conflict set determination step for finding a conflict set, which is a set of tasks in which the earliest completed task and the processing machine are the same and the processing time overlaps, and only those in which the conflict set task satisfies the constraints of the processing task A narrowing-down step, a schedule determining step of determining one task for determining a schedule from the conflict set, a schedule resetting step of resetting a temporary schedule of each task of the cut set based on the determined task, and a resetting temporary The configuration includes a cut set updating step of updating a cut set based on a schedule, and a task presence / absence confirmation step of confirming the presence / absence of an unscheduled task.

[0013] Thus, a scheduling method can be obtained in which the optimal solution search using the GA effectively functions even under the specific condition that the sequence of each task is the same.

In order to solve the above problems, a recording medium of the present invention has a configuration in which a program for executing each step of the above-mentioned scheduling method is recorded.

Thus, a recording medium for executing the above-mentioned scheduling method is obtained.

[0016]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS A scheduling apparatus according to a first aspect of the present invention includes an input unit for a user to input data and the like, and a scheduling data storage unit for storing scheduling target data specified via the input unit. A schedule generation unit that performs a schedule generation process based on scheduling target data, a GA processing unit that controls generation of an initial individual schedule and a cross individual schedule by the schedule generation unit and performs a genetic algorithm process, and is determined by the GA processing unit. A schedule storage unit for storing a set scheduling result, a cut set obtaining unit for obtaining a cut set that is a set of processing startable tasks specified by a processing order among unscheduled tasks, and a Without any restrictions The schedule temporary setting section to schedule, the earliest completed task acquisition section to acquire the earliest completed task that is the task with the earliest completion time from the tasks in the cut set, and the task where the earliest completed task and the processing machine are the same and the processing time overlaps A conflict set acquisition unit that selects a task of a certain conflict set from the cut set, a task constraint matching unit that changes the tasks of the conflict set to only those that satisfy the constraints of the processing task, and a task that determines the schedule from the changed conflict set Schedule task determination unit to be determined, Cut set update unit to update the cut set according to the determined schedule, Processing time verification unit to verify the processing time of each task, Processing machine verification to verify the processing machine of each task Section, processing task matching section for matching processing tasks, and each function Operation between the functional is obtained by the fact that a control unit for controlling the flow of data.

According to this configuration, the conflict set can be narrowed down by the task constraint matching unit and the processing task matching unit in the scheduling for the tasks in the same work sequence, so that the same schedule is expressed as different individuals. Can be suppressed, and scheduling can be performed in which the optimal solution search by the GA can function effectively.

According to a second aspect of the present invention, there is provided a scheduling apparatus, comprising: an input section for inputting data or the like by a user; a scheduling data storage section for storing scheduling target data specified via the input section; A work type classifying unit, a schedule generating unit for performing a schedule generating process based on scheduling target data, and a GA process for controlling generation of an initial individual schedule and a cross individual schedule by the schedule generating unit and performing a genetic algorithm process Unit, a schedule storage unit that stores a scheduling result determined by the GA processing unit, and a cut set obtaining unit that obtains a cut set that is a set of process startable tasks specified by a processing order among unscheduled tasks. A tentative schedule setting unit that schedules the tasks of the cut set without machine constraints, an earliest completed task acquisition unit that obtains the earliest completed task that is the task with the earliest completion time from the cut set task, A conflict set acquisition unit that selects a conflict set task that is the same task and processing machine but has the same processing time from the cut set, and a task constraint adaptation that changes the conflict set task to only those that satisfy the constraints of the processing task Unit, a schedule task determining unit that determines a task for determining a schedule from the changed conflict set, a cut set updating unit that updates the cut set according to the determined schedule, and a processing time matching unit that matches the processing time of each task Processing machine matching to check the processing machine for each task When the processing task matching unit for matching processing tasks, and work type collating unit for collating the work type of the processing task, each function operation between functional,
And a control unit for controlling the flow of data.

With this configuration, the work sequence of the data to be scheduled is classified by the work type classification unit, and the conflict set considering the work type is narrowed down by the task constraint matching unit, the work type matching unit, and the processing task matching unit. Therefore, even when tasks in different work columns coexist, it is possible to suppress the same schedule from being expressed as different individuals, and it is possible to perform scheduling in which the optimal solution search by GA effectively functions. It has the action of:

According to a third aspect of the present invention, in the scheduling method, a data specifying step of specifying data to be scheduled, a data storing step of storing the specified data to be scheduled, and a schedule are generated based on the data to be scheduled. A schedule confirming step of performing a process and confirming a schedule;
And a schedule storing step of storing the determined schedule, wherein the schedule generation process in the schedule determining step includes:
A cut set determination step for obtaining a cut set, which is a set of processing startable tasks specified by a processing order, a schedule temporary setting step for temporarily setting a schedule for each task of the cut set, and a task whose completion time is the earliest. An earliest completed task acquisition step for acquiring the earliest completed task, a conflict set determination step for obtaining a conflict set that is a set of tasks having the same processing machine and the same processing time and overlapping processing times, and restricting the conflict set task by the processing task A narrowing step for narrowing down to only those that satisfy the condition, a schedule determining step for determining one task for determining the schedule from the conflict set, and a schedule resetting step for resetting the provisional schedule of each task of the cut set based on the determined task , And the cut set updating step of updating the cut set based on the provisional schedule has been re-set,
And a task presence / absence confirmation step of confirming the presence / absence of an unscheduled task.

According to this configuration, the conflict set is narrowed down in the scheduling for the tasks in the same work sequence, so that the same schedule can be suppressed from being expressed as different individuals, and the optimal solution search by GA can be performed. This has the effect that scheduling that functions effectively can be performed.

According to a fourth aspect of the present invention, in the scheduling method, a data specifying step of specifying data to be scheduled, a data storing step of storing the specified data to be scheduled, and a work type for setting a work type number to the data to be scheduled A scheduling method comprising: a number setting step; a schedule generation step of generating a schedule based on scheduling target data and performing GA processing to determine a schedule; and a schedule storage step of storing the determined schedule. The schedule generation process in the step includes a cut set determination step of obtaining a cut set that is a set of process startable tasks specified by a processing order, and a schedule for each task of the cut set. A schedule provisional setting step to be set, an earliest completed task acquisition step to obtain the earliest completed task that is the earliest completion time, and a conflict set that is a set of tasks whose processing time is the same as the earliest completed task and the processing machine are the same. A conflict set determination step to be sought, a narrowing step for narrowing down to only those that satisfy the constraints of the processing task in consideration of the work type number in which the tasks of the conflict set are set, and a schedule determination for determining one task for determining the schedule from the conflict set Steps, a schedule resetting step of resetting the provisional schedule of each task of the cut set based on the determined task, a cut set update step of updating the cut set based on the reset provisional schedule, and the presence or absence of unscheduled tasks In which it was decided to have the task existence confirmation step of confirming.

With this configuration, a work type is set in the data to be scheduled, and a conflict set is narrowed down in consideration of the work type. Therefore, even when tasks in different work columns are mixed, the same schedule is expressed as a different individual. Therefore, there is an effect that scheduling can be performed in which the optimal solution search by the GA effectively functions.

A recording medium according to a fifth aspect records a program for executing each step of the scheduling method according to the third or fourth aspect.

According to this structure, claim 3 or claim 4
Has an effect that the general-purpose computer can easily implement the scheduling method described in (1) at an arbitrary place and at an arbitrary time.

Hereinafter, an embodiment of the present invention will be described with reference to FIG.
This will be described with reference to FIG.

(Embodiment 1) FIG. 1 is a block diagram showing a scheduling apparatus according to Embodiment 1 of the present invention.

In FIG. 1, reference numeral 1 denotes an input unit for inputting data or the like by a user, 2 denotes a scheduling data storage unit for storing data to be scheduled specified via the input unit 1, and 3 denotes a schedule generation unit 4 described later. A GA processing unit that controls the generation of the initial individual schedule and the cross individual schedule and performs GA processing, 4 is a schedule generation unit that generates and processes a schedule based on the scheduling target data, and 5 is a scheduling result determined by the GA processing unit 3. Schedule storage unit to store,
Reference numeral 6 denotes a cut set acquisition unit for acquiring a cut set, which is a set of processing startable tasks specified by a processing order or the like among unscheduled tasks, and 7 schedules the tasks of the cut set without machine restrictions. A schedule temporary setting unit, 8 is an earliest completed task obtaining unit that obtains the task with the earliest completion time (earliest completed task) from the tasks in the cut set, and 9 is a task that has the same processing machine and the same processing time as the earliest completed task. A conflict set acquisition unit that selects from the cut set, a task constraint matching unit that changes the tasks of the conflict set to only those that satisfy the constraints of the processing task, and a schedule task determination that determines a task that determines the schedule from the conflict set And 12, the schedule determined by the scheduled task determination unit 11. A cut set updating unit that updates a cut set according to a module, 13 is a processing time matching unit that matches processing time of each task, 14 is a processing machine matching unit that matches processing machines of each task, and 15 is a processing task matching unit A processing task collating unit 16 is a control unit that controls each function, operation between functions, and data flow.

FIG. 2 is an apparatus block diagram showing a scheduling apparatus according to Embodiment 1 of the present invention.

In FIG. 2, 17 is a keyboard, 18 is a central processing unit (CPU), 19 is a read only memory (ROM), 20 is a random access memory (RAM), 21 is a CD-ROM or the like. Recording medium 22
Disk drive that reads data from

Here, the correspondence between FIG. 1 and FIG. 2 will be described. The input unit 1 shown in FIG. 1 is realized by a keyboard 17, and the scheduling data storage unit 2 and the schedule storage unit 5 are realized by a RAM 20. Also, GA
Processing unit 3, schedule generation unit 4, cut set acquisition unit 6, temporary schedule setting unit 7, earliest completed task acquisition unit 8, conflict set acquisition unit 9, task constraint adaptation unit 1
0, a schedule task deciding unit 11, a cut set updating unit 12, a processing time collating unit 13, a processing machine collating unit 14, a processing task collating unit 15, and a control unit 16.
R while exchanging data with RAM 19 and RAM 20
This is realized by executing a control program stored in the OM 19. Note that in the present embodiment, the CPU
Although the control program 18 is controlled by executing a program stored in a ROM 19, the control program recorded on a computer-readable recording medium 22 is read from a disk drive 21 and the RAM 2
After being developed on 0, the CPU 18 may execute the program. By adopting such a mode, the present embodiment can be easily realized by a general-purpose computer.

The operation of the thus configured scheduling device will be described with reference to FIGS. FIG. 3 is a flowchart showing the operation of the scheduling device according to the first embodiment of the present invention. FIG. 4 is a flowchart showing an active schedule generating process (schedule generating step) according to the first embodiment of the present invention. FIGS. 5A to 5D are schedule determination process diagrams showing a schedule determination process according to the flowchart of FIG.

In FIG. 3, first, the input unit 1 designates the data to be scheduled by the user (S
11, data designation step). The control unit 16 stores the scheduling target data specified in step S11 in the scheduling data storage unit 2 (S12, data saving step). Next, the GA processing unit 3 generates an initial individual schedule by the schedule generation unit 4, generates a cross individual schedule by designating a parent individual in the schedule generation unit 4, and performs a GA process of obtaining a sub-optimal solution while performing generation switching. To determine the schedule (S13, schedule determination step). Next, the control unit 16 saves the schedule determined in step S13 in the schedule storage unit 5 and ends the process (S14, schedule saving step).

Next, the active schedule generation process in step S13 performed by the schedule generation unit 4 on the data in the scheduling data storage unit 2 will be described with reference to the flowchart in FIG.

In FIG. 4, first, a set C of tasks that can be started by the cut set obtaining unit 6 among tasks that are not scheduled and specified by the processing order and the like.
(Cut set C) is obtained (S21, cut set confirmation step). Next, the temporary schedule setting unit 7 sets the earliest start time and earliest completion time for each task of the cut set C when there is no restriction that each machine can process only one operation at a time (S22, schedule temporary). Configuration steps). Next, the earliest completed task acquisition unit 8
The processing time collating unit 13 refers to the earliest completion time of each task of the cut set C, and obtains the task EC having the earliest completion time (S23, earliest completed task acquisition step). Next, the conflict set obtaining unit 9 checks each task of the cut set C by the processing time checking unit 13 and the processing machine checking unit 14, and sets the task G and the processing set G (the conflict set) of the same processing machine. Set G)
(S24, conflict set determination step).
Next, the task constraint matching unit 10
When the plurality of tasks in the conflict set are determined to be the same tasks in different work queues, and the processing time matching unit 13 determines that the startable times are the same, a specific condition such as the smallest (or larger) work number To narrow down the conflict set with only one conflict set task (S25, narrowing step). Next, the schedule task determination unit 11 determines one task for determining the schedule from the conflict set G by referring to the parent individual or arbitrarily selecting from the conflict set (S26, schedule determination step). Next, the provisional schedule setting unit 7 determines in step S2
6, the earliest start time and earliest completion time of each task of the cut set C are reset (S2).
7, schedule resetting step). Next, the task determined in step S26 is removed from the cut set C by the cut set updating unit 12, and if there is a next task, the task is added to the cut set C (the updated cut set C) (S28, cut). Set update step). Next, if there is an unscheduled task in the cut set C, the process returns to step S23 to continue the processing (S29, task existence confirmation step). If there are no unscheduled tasks,
The active schedule generation processing ends.

FIG. 5 shows a specific example of a change in the conflict set due to the narrowing of the conflict set performed in step S25.

The scheduling is performed on the data shown in FIG. 5A, and tasks 11, 21, 31, 41, 12, 5
1 is determined, and the cut set after updating the cut set in step S28 is shown in FIG. 5B (cut set: 13,
22, 32, 42, 52). The conflict set acquired in step S23 is compared with the earliest completed task 22 and the conflict set acquired in step S24 is shown in FIG. 5C (conflict set: 22, 32, 42, 52). In step S25,
The tasks 22, 32, and 42 of the conflict set are tasks in the same processing sequence in the work 2, the work 3, and the work 4 and have the same startable time. Only the conflict set task is set (FIG. 5D).

As described above, according to the present embodiment, the input unit 1 for the user to input data and the like, the scheduling data storage unit 2 for storing the data to be scheduled specified through the input unit 1, A schedule generation unit 4 that performs a schedule generation process based on the target data; a GA processing unit 3 that controls generation of an initial individual schedule and a crossed individual schedule by the schedule generation unit 4 and performs a genetic algorithm process;
A schedule storage unit 5 that stores the scheduling result determined by the A processing unit 3, and a cut set obtaining unit 6 that obtains a cut set that is a set of process startable tasks specified by a processing order among unscheduled tasks. And a provisional schedule setting unit 7 that schedules the tasks of the cut set without machine restrictions
And an earliest completed task acquisition unit 8 that obtains the earliest completed task having the earliest completion time from the tasks in the cut set, and a conflict set task that is the same processing task as the earliest completed task and has the same processing time. From the cut set, a conflict set acquisition unit 9 for selecting a task from the cut set, a task constraint adaptation unit 10 for changing only the task of the conflict set to one satisfying the constraint by the processing task, and a schedule for determining a task for fixing the schedule from the changed conflict set A task determining unit 11, a cut set updating unit 12 for updating a cut set according to a determined schedule, a processing time matching unit 13 for matching processing time of each task, and a processing machine matching for matching processing machines of each task Unit 14 and processing task matching unit 15 for matching processing tasks
And a control unit 16 for controlling each function, operation between functions, and data flow, so that the task constraint matching unit 10 and the processing task matching unit 15 perform conflict setting in scheduling for tasks in the same work sequence. Can be narrowed down, so that the same schedule can be suppressed from being represented as different individuals,
Scheduling in which the optimal solution search by the GA effectively functions can be performed.

(Embodiment 2) FIG. 6 is a block diagram showing a scheduling apparatus according to Embodiment 2 of the present invention.

6, an input unit 1, a scheduling data storage unit 2, a GA processing unit 3, a schedule generation unit 4, a schedule storage unit 5, a cut set acquisition unit 6, a temporary schedule setting unit 7, and an earliest completed task acquisition unit 8 The conflict set acquiring unit 9, the task constraint conforming unit 10, the scheduled task determining unit 11, the cut set updating unit 12, the processing time matching unit 13, the processing machine matching unit 14, the processing task matching unit 15, and the control unit 16 are the same as those in FIG. They are the same, are given the same reference numerals, and description thereof is omitted. Reference numeral 23 denotes a work type classification unit that classifies the data to be scheduled by work type, and reference numeral 24 denotes a work type comparison unit that compares the work types of the processing tasks.

Since the device block diagram of the scheduling device in this embodiment is the same as that of FIG. 2, the relationship with each block will be described with reference to FIG. CPU 18 is ROM 19
And ROM while exchanging data with RAM 20
This is realized by executing a control program stored in the control program 19. Other components are the same as those in FIG. In the present embodiment, the CPU 18 has a ROM
19 shows a form in which control is performed by executing a program stored in a storage medium 19. After reading a control program recorded in a computer-readable recording medium 22 from a disk drive 21 and expanding it on a RAM 20, The embodiment may be executed by the CPU 18.
By adopting such a mode, the present embodiment can be easily realized by a general-purpose computer.

The operation of the scheduling apparatus configured as described above will be described with reference to FIGS.
FIG. 7 is a flowchart showing the operation of the scheduling device according to the second embodiment of the present invention. FIG. 8 is a flowchart showing an active schedule generating process (schedule generating step) according to the second embodiment of the present invention. FIGS. 9 (a) to 9 (e) are schedule determination process diagrams showing a schedule determination process according to the flowchart of FIG.

In FIG. 7, first, the user designates the data to be scheduled by the input unit 1 (S
31, data designation step). The control unit 16 stores the data specified in step S31 in the scheduling data storage unit 2 (S32, a data saving step). Next, the work type classification unit 23 compares the work sequences of the data to be scheduled in the scheduling data storage unit 2 and classifies the work types that classify the work sequences different from each other. (S33, work type number setting step). Next, the GA processing unit 3 includes a schedule generation unit 4
To generate a crossover individual schedule by designating a parent individual in the schedule generation unit 4, perform a GA process to obtain a sub-optimal solution while changing generations, and determine a schedule (S34, schedule determination step) ). Next, the control unit 16 determines in step S34
Is stored in the schedule storage unit 5 and the process ends (S35, schedule storage step).

Next, S3 is performed by the schedule generation unit 4 on the data in the scheduling data storage unit 2.
The active schedule generation process of No. 4 will be described with reference to the flowchart of FIG.

After setting the work type number in step S33 in FIG. 7, first, in FIG. 8, a set of tasks that can be started by the cut set obtaining unit 6 among tasks that are not scheduled but are specified by a processing order or the like. C
(Cut set C) is obtained (S41, cut set confirmation step). Next, the temporary schedule setting unit 7 sets the earliest start time and earliest completion time for each task of the cut set C when there is no restriction that each machine can process only one operation at a time (S42, schedule temporary). Configuration steps). Next, the earliest completed task acquisition unit 8
The processing time collating unit 13 refers to the earliest completion time of each task in the cut set, and sets the task E whose completion time is the earliest.
C (earliest completed task EC) is obtained (S43, earliest completed task acquisition step). Next, the conflict set acquisition unit 9 collates each task of the cut set by the processing time collating unit 13 and the processing machine collating unit 14, and sets the task EC and the processing set G (the conflict set G) G) (S44, conflict set determination step). Next, the task constraint matching unit 10 checks the tasks of the conflict set by the work type matching unit 24 and the processing task matching unit 15, and the plurality of tasks in the conflict set are the same task in the work column having the same work type number. If the processing time collating unit 13 determines that the startable times are the same, narrow down the conflict set in which only one conflict set task is set under a specific condition such as the smallest (or largest) work number. (S45, narrowing step). Next, the schedule task determination unit 11 determines one task for determining the schedule from the conflict set G by referring to the parent individual or arbitrarily selecting from the conflict set (S46, schedule determination step). Next, the provisional schedule setting unit 7 resets the earliest start time and earliest completion time of each task in the cut set based on the task determined in step S46 (S47, schedule resetting step). Next, the task determined in step S46 is removed from the cut set by the cut set updating unit 12,
If there is a next task, the task is added to the cut set C (updated cut set C) (S48, cut set updating step). If there is an unscheduled task in the cut set C, the process returns to step S43 to continue the processing (S49, task existence confirmation step). If there is no unscheduled task, the active schedule generation processing ends.

FIG. 9 shows a specific example of a change in the conflict set due to the narrowing of the conflict set performed in step S45.

FIG. 9B shows data in which the operation sequence of the data to be scheduled in FIG. 9A is compared and the operation type number is set in step S33. Since all three tasks of work 1, work 2, and work 3 are the same task, I is set to the work type number. Work 4, Work 5
Is the same task sequence that is different from this task sequence, and therefore, the task type number is set to II. Tasks 11, 21, 3
The cut sets after the cut sets 1, 12, 41 and 51 are determined and the cut sets are updated in step S48 are shown in FIG. 9C (cut sets: 13, 22, 32, 42 and 52). The conflict set acquired in step S43 is compared with the earliest completed task 22 acquired in step S43, and the conflict set acquired in step S44 is shown in FIG.
(Conflict sets: 22, 32, 42, 5
2). In step S45, task 2 of the conflict set
The tasks 2 and 32 have the same task type number I, have the same processing order in the task sequence, and have the same task start time. Therefore, only the task 22 with the smallest task number is set as a conflict set task. The tasks 42 and 52 of the conflict set do not match the conflict narrowing restriction because the task type numbers are different from those of the task 22. The tasks 42 and 52 have the same work type number but different work start times, and thus do not match the conflict narrowing restriction. FIG. 9E shows the conflict set narrowed down in step S45.

As described above, according to the present embodiment, the input unit 1 for the user to input data and the like, the scheduling data storage unit 2 for storing the data to be scheduled specified via the input unit 1, A work type classification unit 23 for classifying the target data by work type, a schedule generation unit 4 for performing a schedule generation process based on the scheduling target data, and control of generation of an initial individual schedule and a cross individual schedule by the schedule generation unit 4; GA processing unit 3 that performs genetic algorithm processing, schedule storage unit 5 that stores the scheduling results determined by GA processing unit 3, and a set of tasks that can be started and that are specified by the processing order among unscheduled tasks To obtain the cut set A set acquisition unit 6, a provisional schedule setting unit 7 for scheduling the tasks of the cut set without the restrictions of the machine, and an earliest completion that obtains the earliest completed task having the earliest completion time from the tasks of the cut set. A task acquiring unit 8, a conflict set acquiring unit 9 for selecting a conflict set task, which is a task having the same processing machine as the earliest completed task and having the same processing time, from the cut set, and restricting the conflict set task by the processing task. A task constraint conforming unit 10 that changes only those that satisfy the condition, a schedule task determining unit 11 that determines a task that determines the schedule from the changed conflict set, and a cut set updating unit 12 that updates the cut set according to the determined schedule. A processing time collating unit 13 for collating the processing time of each task; A processing machine collating unit 14 for collating a processing machine of a disk; a processing task collating unit 15 for collating a processing task; a work type collating unit 24 for collating a work type of the processing task; The task type classification unit 23 classifies the work sequence of the data to be scheduled, and the task constraint matching unit 10, the work type matching unit 24, and the processing task matching unit 15 Since it is possible to narrow down the conflict set considering the type,
Even when tasks in different work columns coexist, it is possible to suppress the same schedule from being expressed as different individuals, and it is possible to perform scheduling in which the optimal solution search by GA functions effectively.

[0049]

As described above, according to the scheduling apparatus according to the first aspect of the present invention, the input unit into which the user inputs data and the like, and the data to be scheduled specified through the input unit are stored. A scheduling data storage unit, a schedule generation unit that performs a schedule generation process based on the scheduling target data, a GA processing unit that controls generation of an initial individual schedule and a crossed individual schedule by the schedule generation unit and performs a genetic algorithm process, A schedule storage unit that stores a scheduling result determined by the GA processing unit; a cut set acquisition unit that acquires a cut set that is a set of processing startable tasks specified by a processing order among unscheduled tasks; Set task of machine A tentative schedule setting section that schedules without any approximation, an earliest completed task acquisition section that obtains the earliest completed task that is the task with the earliest completion time from the tasks in the cut set, and the processing time when the earliest completed task and the processing machine are the same A conflict set acquisition unit that selects a conflict set task that is a duplicate task from the cut set, and a task constraint matching unit that changes the conflict set task to only those that satisfy the constraint by the processing task,
A schedule task determination unit that determines a task that determines the schedule from the changed conflict set, a cut set update unit that updates the cut set according to the determined schedule, a processing time matching unit that checks the processing time of each task, By having a processing machine collating unit for collating the processing machine of each task, a processing task collating unit for collating the processing task, and a control unit for controlling each function, operation between functions, and data flow, the same work sequence In task scheduling, the conflict set can be narrowed down by the task constraint conforming unit and the processing task matching unit, so that the same schedule can be suppressed from being represented as different individuals, and optimization by GA The advantageous effect that the solution search can perform effective scheduling It is.

According to the scheduling device of the second aspect, the input unit for the user to input data and the like, the scheduling data storage unit for storing the data to be scheduled specified through the input unit, A work type classification unit for classifying by work type,
A schedule generation unit that performs a schedule generation process based on the scheduling target data; and a G that controls generation of an initial individual schedule and a crossed individual schedule by the schedule generation unit and performs a genetic algorithm process.
A processing unit, a schedule storage unit that stores a scheduling result determined by the GA processing unit, and a cut set that acquires a cut set that is a set of processing startable tasks specified by a processing order among unscheduled tasks An acquisition unit, a schedule provisional setting unit that schedules the tasks of the cut set without machine restrictions, and an earliest completed task acquisition unit that obtains the earliest completed task that is the task with the earliest completion time from the cut set task. A conflict set acquisition unit that selects a conflict set task that is the same processing task as the earliest completed task and has the same processing time from the cut set, and changes the conflict set task to only one that satisfies the constraint of the processing task Task constraint conforming part and changed conflict set And scheduled tasks determination unit that determines a task to determine a schedule, the cut sets updating unit for updating the cut sets in accordance with the finalized schedule, the processing time collating unit for collating the processing time of each task,
A processing machine matching unit that matches the processing machine of each task, a processing task matching unit that matches the processing task, a work type matching unit that matches the work type of the processing task, each function, operation between functions, and data flow Having a control unit that controls the work sequence of the data to be scheduled in the work type classification unit, a task constraint matching unit, a work type matching unit,
In the processing task matching unit, it is possible to narrow down the conflict set in consideration of the work type, so even when tasks in different work columns are mixed, it is possible to suppress the same schedule from being expressed as different individuals. Yes, GA
Has an advantageous effect that scheduling can be performed in which the optimal solution search according to the above can function effectively.

According to the scheduling method of the third aspect, a data specifying step of specifying data to be scheduled, a data storing step of storing the specified data to be scheduled, and a schedule is generated based on the data to be scheduled. A scheduling method comprising: a schedule determination step of determining a schedule by performing a GA process; and a schedule storage step of storing the determined schedule, wherein a schedule generation process in the schedule determination step is a process specified by a processing order or the like. A cut set determination step for obtaining a cut set which is a set of startable tasks; a temporary schedule setting step for temporarily setting a schedule for each task in the cut set; The earliest completed task acquisition step of obtaining completed tasks, the conflict set determination step of obtaining a conflict set that is a set of tasks that have the same processing time as the earliest completed task and the processing machine, and the conflict set task are restricted by the processing tasks. A refinement step of narrowing down to only those that satisfy, a schedule determination step of determining one task for determining a schedule from the conflict set, and a schedule resetting step of resetting the provisional schedule of each task of the cut set based on the determined task, By having a cut set update step of updating the cut set based on the reset provisional schedule and a task presence / absence confirmation step of checking the presence / absence of an unscheduled task, scheduling for tasks in the same work queue can be performed. Since the conflict set is narrowed down, the same schedule can be suppressed from being expressed as different individuals, and the advantageous effect that the optimal solution search by the GA can function effectively can be performed. .

According to the scheduling method of the fourth aspect, a data specifying step of specifying data to be scheduled, a data storing step of storing the specified data to be scheduled, and a work type number are set in the data to be scheduled. A scheduling method comprising: a work type number setting step; a schedule generation step of generating a schedule based on the scheduling target data; and performing a GA process to determine the schedule; and a schedule storage step of storing the determined schedule. The schedule generation processing in the schedule determination step includes a cut set determination step for obtaining a cut set that is a set of processing startable tasks specified by a processing order, and a schedule for each task in the cut set. Is a set of tasks that temporarily set a schedule, a task that acquires the earliest completed task that is the task with the earliest completion time, and a task that has the same processing machine and the same processing time as the earliest completed task. A conflict set determination step for finding a conflict set, a refinement step for narrowing down to only those satisfying the constraints of the processing task in consideration of the work type number for which the task of the conflict set has been set, and one task for determining the schedule from the conflict set A schedule setting step to perform, a schedule resetting step to reset a temporary schedule of each task of the cut set based on the determined task, a cut set updating step to update the cut set based on the reset temporary schedule, and an unscheduled task With the task presence / absence confirmation step of confirming the presence / absence, the task type is set in the data to be scheduled, and the conflict set is narrowed down in consideration of the task type. Can be suppressed from being expressed as different individuals, and the advantageous effect that the optimal solution search by the GA can be effectively performed can be performed.

According to the recording medium of the fifth aspect, a program for executing each step of the scheduling method of the third or fourth aspect is recorded. An advantageous effect is obtained in that the described scheduling method can be easily realized by a general-purpose computer at an arbitrary place and at an arbitrary time.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a scheduling device according to a first embodiment of the present invention.

FIG. 2 is a device block diagram illustrating a scheduling device according to the first embodiment of the present invention.

FIG. 3 is a flowchart showing an operation of the scheduling device according to the first embodiment of the present invention.

FIG. 4 is a flowchart showing an active schedule generation process according to the first embodiment of the present invention.

FIG. 5 is a schedule determination process diagram showing a schedule determination process according to the flowchart of FIG. 4;

FIG. 6 is a block diagram showing a scheduling device according to a second embodiment of the present invention.

FIG. 7 is a flowchart showing an operation of the scheduling device according to the second embodiment of the present invention.

FIG. 8 is a flowchart showing an active schedule generation process according to the second embodiment of the present invention.

FIG. 9 is a schedule determination process diagram showing a schedule determination process according to the flowchart of FIG. 8;

FIG. 10 is a flowchart showing a conventional technique for generating an active schedule, which is one of the scheduling methods.

11 is a schedule determination process diagram showing a schedule determination process according to the flowchart of FIG. 10;

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 Input part 2 Scheduling data storage part 3 GA processing part 4 Schedule generation part 5 Schedule storage part 6 Cut set acquisition part 7 Schedule temporary setting part 8 Earliest completed task acquisition part 9 Conflict set acquisition part 10 Task constraint adaptation part 11 Schedule task determination Unit 12 Cut set updating unit 13 Processing time matching unit 14 Processing machine matching unit 15 Processing task matching unit 16 Control unit 17 Keyboard 18 Central processing unit (CPU) 19 Read only memory (ROM) 20 Random access memory ( RAM) 21 disk drive 22 recording medium 23 work classification unit 24 work classification unit

Claims (5)

[Claims] 1. An input unit for a user to input data or the like, a scheduling data storage unit for storing scheduling target data specified via the input unit, and a schedule for performing a schedule generation process based on the scheduling target data. A generation unit, a GA processing unit that controls generation of the initial individual schedule and the crossover individual schedule by the schedule generation unit and performs a genetic algorithm process, and a schedule storage unit that stores a scheduling result determined by the GA processing unit. A cut set acquisition unit that acquires a cut set that is a set of processing startable tasks specified by a processing order among unscheduled tasks, and a schedule provisional unit that schedules the tasks of the cut set without machine restrictions. Setting section and An earliest completed task acquisition unit that acquires the earliest completed task that is the earliest completion time from the tasks in the cut set, and a conflict set task that is a task that has the same processing machine and the same processing time as the earliest completed task. A conflict set acquisition unit that selects from the cut set, a task constraint matching unit that changes the tasks of the conflict set to only those that satisfy the constraints of the processing task, and a schedule that determines a task that determines a schedule from the changed conflict set A task determining unit, a cut set updating unit that updates the cut set according to the determined schedule, a processing time matching unit that matches processing time of each task, and a processing machine matching unit that matches processing machines of each task And a processing task matching unit that matches processing tasks, and each function and function Operation, scheduling apparatus characterized by a control unit for controlling the flow of data. 2. An input unit for inputting data or the like by a user, a scheduling data storage unit for storing data to be scheduled specified via the input unit, and a work type classification for classifying the data to be scheduled by work type. Unit, a schedule generation unit that performs a schedule generation process based on the scheduling target data,
A GA processing unit that controls generation of an initial individual schedule and a crossed individual schedule by the schedule generation unit and performs a genetic algorithm process; a schedule storage unit that stores a scheduling result determined by the GA processing unit; A cut set acquisition unit that acquires a cut set that is a set of process startable tasks specified by a processing order among tasks,
A tentative schedule setting unit that schedules the tasks of the cut set without machine restrictions, an earliest completed task acquisition unit that obtains the earliest completed task that is the task with the earliest completion time from the cut set task, A conflict set acquisition unit that selects a task of a conflict set, which is a task having the same processing time as a task and a processing machine, from the cut set, and a task of changing the conflict set task to only a task that satisfies the constraint of the processing task A constraint matching unit, a schedule task determining unit that determines a task for determining a schedule from the changed conflict set, a cut set updating unit that updates a cut set according to the determined schedule, and a processing time of each task is compared. Processing time collating unit to collate processing machines for each task A processing machine collating unit, a processing task collating unit for collating the processing task, a work type collating unit for collating the work type of the processing task, and a control unit for controlling each function, operation between functions, and data flow. A scheduling device comprising: 3. A data specifying step of specifying data to be scheduled, a data storing step of storing the specified data to be scheduled, and generating a schedule based on the data to be scheduled.
A scheduling method comprising: a schedule determination step of determining a schedule by performing a GA process; and a schedule storage step of storing the determined schedule, wherein the schedule generation processing in the schedule determination step is specified by a processing order or the like. A cut set determination step for obtaining a cut set that is a set of process startable tasks, a schedule provisional setting step for temporarily setting a schedule for each task of the cut set, and an earliest completed task that is the task with the earliest completion time is acquired. An earliest completed task acquisition step, a conflict set determination step of finding a conflict set that is a set of tasks in which the earliest completed task and the processing machine are the same and whose processing time overlaps, Narrowing down to only those satisfying the following constraints, a schedule determining step of determining one task for determining a schedule from the conflict set, and resetting a temporary schedule of each task of the cut set based on the determined task. A scheduling method, comprising: a schedule resetting step; a cut set updating step for updating the cut set based on the reset temporary schedule; and a task presence / absence confirmation step for confirming presence / absence of an unscheduled task. 4. A data specifying step of specifying data to be scheduled, a data storing step of storing the specified data to be scheduled, a work type number setting step of setting a work type number to the data to be scheduled, A scheduling method comprising: generating a schedule based on scheduling target data; and performing a GA process to determine a schedule; and a schedule storing step of storing the determined schedule. The generation processing includes a cut set determination step of obtaining a cut set that is a set of process startable tasks specified by a processing order and the like, and a schedule for temporarily setting a schedule for each task of the cut set. Tentative setting step of a module, an earliest completed task obtaining step of obtaining an earliest completed task which is the earliest completion time, and a conflict set which is a set of tasks having the same processing machine and the same processing time as the earliest completed task is obtained. A conflict set determination step, a narrowing step of narrowing down the tasks of the conflict set to only those satisfying the restriction by the processing task in consideration of the set work type number, and determining one task for determining a schedule from the conflict set. A schedule fixing step, a schedule resetting step of resetting a temporary schedule of each task of the cut set based on the determined task, and a cut set updating step of updating the cut set based on the reset temporary schedule. , Not scheduled Scheduling method and having a task existence confirmation step of confirming the presence or absence of Rutasuku. 5. A recording medium on which a program for executing each step of the scheduling method according to claim 3 or 4 is recorded.