JPH05120294A - Allocation device - Google Patents

Abstract

PURPOSE:To easily perform superior allocation setting matching a resource by setting detailed restriction conditions corresponding to the degree of restrictions in conformity with circumstances that the resource requires. CONSTITUTION:This device is equipped with a job data base 11 wherein jobs having at least attributes of departure time and arrival time are stored and held, a resource data base 12 wherein plural resources are stored and held, a restriction data base 13 wherein restriction conditions of plural levels at the time of allocating the jobs to the resources are stored and held, an inference part 14 which takes the jobs out of the job data base 11 in time order and allocates them to the resources held in the resource data base 12 according to the restriction conditions of the different levels held in the restriction data base 13, and a man-machine interface 15 which rewrites and alters the contents of the restriction conditions held in the restriction data base 13.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an allocation device for effectively allocating a combination of a plurality of jobs and a plurality of resources.

[0002]

2. Description of the Related Art Conventionally, a combination of a plurality of jobs and a plurality of resources has often been assigned and determined under various constraint conditions. For example, the assignment of workers to various jobs is determined according to working conditions and work capabilities (constraints).

Conventionally, such an allocation decision is made solely by manpower, but as the number of jobs and resources becomes large, it becomes difficult to manually make an allocation decision. In addition, in the process of advancing the allocation decision, for example, a resource that can be allocated to a job has already been allocated to another job, and as a result, a contradiction such as the allocation of resources to that job is likely to occur, resulting in a deadlock in the allocation decision process. There are many things. And in this case,
The allocation decision procedure needs to be redone. For this reason, it cannot be denied that it takes a lot of time to determine the allocation of jobs and resources.

Therefore, recently, it has been considered to process this kind of allocation decision using a computer. The processing by this computer basically takes one job out of a plurality of jobs, assigns resources that can be assigned to the fetched job, and assigns allocation conditions to resources that are sequentially taken out of the plurality of resources. Check and ask. Specifically, this check is performed by checking the constraint condition of the allocation and then further checking the dynamic condition thereof. Then, of the resources that satisfy the allocation constraint conditions, for example, the resource found first is assigned to the job, and if no resource that can be assigned to the job is found, the assignment change is performed. To do. The allocation decision is executed by repeating such a processing procedure while removing the jobs and resources for which the allocation decision has been made.

However, in such a processing procedure, it becomes very difficult to determine allocation as the number of jobs and resources increases, and it becomes difficult to create a program for executing the processing.

Therefore, a job database for storing a set of jobs, a resource database for storing a set of resources, and a constraint database for storing various constraints are provided separately from each other, and an inference unit for determining allocation assigns jobs from the job database. A method is considered in which the resources are extracted one by one and assigned to the resources stored in the resource database so as to satisfy the constraints stored in the constraint database.

However, in the method in which the job database, the resource database and the constraint database are separated as described above, and the inference unit sequentially determines allocation based on the contents of these databases, the absolute requirements such as prohibition points stored in the constraint database are simply used. Since an allocation decision is made only based on operational constraints, it is not always possible to obtain an excellent allocation decision. For example, if a job is a work and the resource is a worker, it is difficult for the worker to do a heavy job. It is possible that an allocation decision may be made.

[0008]

As described above, in the prior art, since the allocation decision is made by using only the absolute conditions such as the forbidden requirement as the constraint condition which becomes the reference of the allocation decision, it is not impossible. May result in a resource allocation decision that is not very well-suited to the resource.

The present invention has been made in view of the above circumstances, and an object of the present invention is to set more detailed constraint conditions in accordance with the circumstances required by a resource and to provide an excellent resource suitable for the resource. An object of the present invention is to provide an assigning device capable of easily making an assignment decision.

[0010]

That is, according to the present invention, a job database for storing and storing a plurality of jobs having at least attributes of departure time and arrival time, a resource database for storing and storing a plurality of resources, and a method for assigning jobs to resources A constraint database that stores and saves a plurality of levels of constraint conditions, and a resource that is saved in the resource database in accordance with the multi-level constraint conditions that are stored in the job database by extracting the jobs saved in the job database in chronological order. And a man-machine interface for rewriting and changing the contents of the constraint conditions stored in the constraint database.

[0011]

With the above configuration, more detailed constraint conditions are set according to the circumstances required by the resource according to the degree of the constraint, and an excellent allocation decision suitable for the resource can be easily made. be able to.

[0012]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will be described below with reference to the drawings.

FIG. 1 shows the basic structure thereof.
Is a job database that stores multiple jobs, 12 is a resource database that stores multiple resources, 13 is a constraint database that stores multiple levels of constraint conditions, and 14 is stored in the job database 11 according to the constraint conditions stored in the constraint database 13 above. An estimating unit for allocating and determining the jobs to be stored in the resources stored in the resource database 12, 15 for the user to rewrite each data stored in the job database 11, the resource database 12 and the constraint database 13 It is a man-machine interface.

In the above configuration, for example, operation of a route bus operation as a job and a virtual crew member called work as a resource will be described as an operation.

FIG. 2 exemplifies a part of the operation as a job stored in the job database 11. As shown in the figure, there are a total of 4 "departure time", "departure place", "arrival time" and "arrival place". 1 with data having one attribute
It will be one operation. Here, each operation is the same round-trip operation between the departure place "Tokyo" and the arrival place "Tokyo", and the average handle time per round trip (driving time)
Indicates that it is 50 minutes. Various constraint conditions as shown in FIGS. 3 to 6 for such operation are stored in the constraint database 13.

FIG. 3 exemplifies restrictions imposed as work rules for each type of work. As shown in the figure, the bus companies generally do the work "am" and "pm".
There are 6 types of "day shift,""midnight,""morningincrease," and "afternoon increase," and "constraint time" and "handle time" for each start of work.
Items such as "actual work hours" are imposed as constraints. Hereinafter, each of these individual items will be described, except for those that are obvious.

The "restriction time" indicates the time width during which the crew member is restricted by the work, and the "handle time" indicates the time during which the bus is actually driven during the "restriction time". Further, the "actual work time" indicates the time obtained by adding the "handle time", "preparation time", "arrangement time" in the "restraint time" and a part of the time when the bus stops at the end point. "Preparation time"
The “rearrangement time” indicates the time from the predetermined attendance to the start of bus operation and the time from the end of bus operation to the departure of the crew members, and is the time spent for roll call, inspection, cleaning, etc.

The "number of breaks", "break time (for each type)", and "rest order guide" indicate the number of breaks to be taken in each work and the time for each type. Usually, breaks are not necessary for short work such as "increased work", and for medium length work such as "am" and "pm", "1" should be taken for meals only. .. Further, in a long work such as "day shift", the method of taking a break becomes complicated, and it is necessary to take a break of 30 minutes or more and "2" breaks of 60 minutes or more in any order. The “rest time standard (for each type)” indicates the standard of the time zone for each break, and is only a “standard”, so the degree of restriction is not so high as other items.

The "maximum continuous steering wheel time" indicates the limit of continuous operation beyond this time, and the "continuous steering wheel suspension time" exceeds this time without driving to the "continuous steering wheel suspension place" described later. When stopped, it indicates the time for interrupting the counting of the continuous operation time.

"Outgoing break interval interval guideline", "Break interval interval guideline" and "Break entrance interval interval guideline" are respectively the time from the start of operation to the first break, the time between breaks, and the last break to drive. It indicates a "reference" of the time until the end, and it is a constraint item that is merely a "reference", and the level of constraint is not so high as other items. The “number of resources” indicates how many jobs of that type may be used, and the name is the “resource name”. As mentioned above, as a constraint condition, items that must be strictly adhered to,
The items with a little low degree of restriction, which are attached with "reference", are used together.

FIG. 4 is a diagram exemplifying a constraint condition of time from the end of one work to the start of another work. For example, it is shown that the work of "am" and "pm" uses one bus in succession, so that "10 minutes or more" is required between them. Specifically, this indicates that one resource of the "afternoon" job corresponds to one resource of the "am" job, and at least "10 minutes" is required in the meantime. In this way, as a general rule, the resources for the "afternoon" jobs will correspond to all the resources for the "am" jobs, and if the number of the resources for the "am" and "afternoon" jobs differs, Correspondence becomes unnecessary for a large amount.

Further, since the "afternoon increase work" work is actually operated as an overtime work of the "am" work, it is indicated that an interval of "120 to 180 minutes" is required between them. The same is true between the “morning increase” work and the “pm” work.

FIG. 5 exemplifies a kind of know-how related to work rules as a constraint condition, although not necessarily in work rules. That is, it indicates from which type the goods are to be delivered and the goods are to be received, depending on the restriction of the restraint time of the type of work and some customs unique to the company. Further, as another constraint condition, there are various items regarding bus routes as illustrated in FIG. 6, and each item will be described below.

The "stop" indicates all the names of the stops that stop the bus, and the "garage" indicates the start and end positions of the work in the above stop. The "rest place" indicates the name of a stop that can take a break corresponding to the "rest time" and "rest time guideline" of the type described in Fig. 3 above, and the "continuous handle suspension place" is described in Fig. 3 above. This indicates the place where the continuous steering wheel time is interrupted if the vehicle is stopped without driving for more than the "continuous steering wheel suspension time".

Next, the job database is stored with the various constraint conditions as described above stored in the constraint database 13.
"Run 1" to "Run 6" as jobs stored in 11
The processing contents of the estimation unit 14 when allocating and allocating two jobs "work 1" and "work 2" as resources stored in the resource database 12 will be described with reference to FIG.

That is, first, the estimation unit 14 retrieves the operation data as a job stored in the job database 11 in order of the earliest time (step A1), and determines whether the retrieved operation is the first operation of the day. It is determined (step A2). This is executed corresponding to "Knowledge 1 / Knowledge about the first operation" as shown in FIG. 9, and the content of the knowledge "The first operation is assigned to the job 1".
Therefore, if it is determined that the taken-out operation is the first operation "Operation 1", this "Operation 1" is directly assigned to the first "Work 1" as a resource (step A3).

FIG. 8 shows the details of the allocation process. At the beginning of the process, it is judged whether or not the allocation satisfies the constraints shown in FIGS. 3 to 6 stored in the constraint database 13 (step B1). ). If it is determined that the condition is satisfied, "operation 1" is assigned to "work 1" here as instructed (step B6), and the assignment process is completed.

At the time when the allocation of "operation 1" is completed, it is judged in FIG. 7 whether there is a next operation that has not been allocated yet (step A11). Repeat.

"Run 2" is retrieved from the job database 11 in the order of earliest time (step A1).
Is not the first operation of the day (Step A2
), The estimation unit 14 then determines whether or not the operation is assigned to only one "work 1" as a result of the assignment so far (step A4). When it is determined that only the "work 1" is allocated, the estimation unit 14 restricts the "interval between breaks" in Fig. 3 when the next operation "operation 2" is not allocated to the "work 1". It is determined whether or not the condition is satisfied (step A5). Here, since the constraint item of "interval between leaving breaks" is not satisfied, this "operation 2" is assigned to "work 1" (step A9).

This is executed in response to "Knowledge 2, knowledge when operation is assigned to only one job" as shown in FIG. If it does not meet the constraint of the interval between shipping breaks unless it is assigned to another job, it is assigned to it. If it does not, it is assigned to an operation that has not been assigned yet. If it is assigned to "work 2", the time from "work 1" to the break will be 50 minutes, and the constraint of the "interval between breaks between shipping breaks" will not be satisfied, so "run 2""Work1"
To be assigned to.

Regarding this allocation processing, referring again to FIG. 8, it is judged at the beginning of the processing whether or not the allocation satisfies the constraints shown in FIGS. 3 to 6 stored in the constraint database 13 (step B1). When it is judged that the condition is satisfied, "operation 2" is assigned to "work 1" here as instructed (step B6), and the assignment process is completed.

At the time when the allocation of "operation 2" is completed, it is judged in FIG. 7 that there is an operation which is not yet allocated (step A11), and the processing from step A1 is repeated again.

Next, the estimation unit 14 retrieves "operation 3" from the job database 11 (step A1), and step A2
If this "Run 3" is not assigned to "Work 1" through the above, it is judged that the constraint items of "Guideline between leaving break intervals" in Fig. 3 above are satisfied (step A5), and then this "Run 3". Is assigned to "work 2" (step A6).

This is executed in response to "Knowledge 2, knowledge when operation is assigned to only one job", as described above. "Run 3" is not assigned to "Job 1". In both cases, if the constraint of "interval between delivery breaks" is satisfied, it is assigned to "work 2" that has not been assigned yet.

At the time when the allocation of "operation 3" is completed, it is determined in FIG. 7 that there is an operation that has not been allocated yet (step A11), and the processing from step A1 is repeated again.

Next, the estimation unit 14 retrieves "operation 4" from the job database 11 (step A1), and step A2
, A4 to determine whether there is a work taking a break (step A7). Since "work 1" is taking a break at the time corresponding to "run 3", this "run 4" is assigned to "work 1" (step A10).

This is executed corresponding to "Knowledge 3, knowledge when operation is assigned to both jobs" as shown in FIG. If so, assign it to it. ”
Since "work 1" has a break here, this "operation 4" is assigned to "work 1".

In this allocation process, again in FIG. 8, it is judged whether the allocation satisfies the constraints shown in FIGS. 3 to 6 stored in the constraint database 13 at the beginning of the process (step B1). When it is judged that the condition is satisfied, "operation 4" is assigned to "work 1" here as instructed (step B6), and the assignment process is completed.

At the time when the allocation of "operation 4" is completed, it is determined in FIG. 7 that there is an operation that has not been allocated yet (step A11), and the processing from step A1 is repeated again.

Next, the estimation unit 14 retrieves "operation 5" from the job database 11 (step A1), and step A2
If it is determined that there is a work that can take a break through step A4 (step A7), this "operation 5" is assigned to "work 1" (step A10).

In this allocation process, again in FIG. 8, it is judged whether the allocation satisfies the constraints shown in FIGS. 3 to 6 stored in the constraint database 13 at the beginning of the process (step B1). Here, it is judged that the constraint of the "constraint time" in FIG. 3 is violated, and the contents "corresponding to the knowledge 4 / common knowledge" as shown in FIG. It is determined whether or not the constraint is satisfied when this "run 5" is assigned to another assignment "work 2" (step B2). In this case, it is judged that the constraint is not satisfied again in the item “interval between leaving breaks”, and the constraint that is not satisfied when the “operation 5” according to the instruction in step A10 above is assigned to “work 1” It is judged whether or not the item is only a "standard" having a low degree as a constraint condition (step B3). Here, the constraint items that are not satisfied by the assignment as instructed are the items of "constraint time" as judged in step B1 above, and are not "reference", so another assignment, that is, "Run 5" When it is assigned to "work 2", it is judged whether or not the constraint items that are not satisfied are only "standards" having a low degree of constraint condition (step B4). In this case, the constraint items that are not satisfied are the “intervals between leaving breaks” and only the “reference”. Therefore, different from the instruction in step A10, “operation 2” is set to “operation 5”. Is assigned (step B9), and the process is completed.

At the time when the allocation of "operation 5" is completed, it is determined in FIG. 7 that there is an operation that is not yet allocated (step A11), and the processing from step A1 is repeated again.

Next, the estimation unit 14 retrieves "operation 6" from the job database 11 (step A1), and step A2
When it is judged that there is a work that can take a break through step A4 (step A7), this "operation 6" is assigned to "work 1" (step A10).

In this allocation process, again in FIG. 8, it is judged whether the allocation satisfies the constraints shown in FIGS. 3 to 6 stored in the constraint database 13 at the beginning of the process (step B1). Here, it is determined again that the constraint of the “restricted time” in FIG. 3 is violated, and next, when another assignment, that is, this “operation 6” is assigned to “work 2”, it is determined whether the constraint is satisfied. (Step B2).
In this case, it is determined that the constraint is satisfied for "Run 6", and then "Run 6" is assigned to "Work 2" different from the instruction in Step A10 (Step B7). This process ends.

In this way, at the time when the allocation of the "operation 6" is completed, it is judged that there is no operation which is not allocated in FIG. 7 (step A11), and the allocation processing is completed.

As a result of performing the allocation process as described above,
As shown in FIG. 12, "work 1" is "run 1""run2"
Finally, "operation 4" and "operation 2" are finally assigned and decided as "operation 3", "operation 5" and "operation 6". In this case, as shown in the time flow of the above allocation in FIG. 13, "work 1" is a constraint item of "interval between breaks and receipt intervals", and "work 2" is "standard of interval between leaving and taking breaks as described above. It means that each constraint item does not satisfy the constraint. However, all of the constraint items that do not meet are only the “standard”, which has a low degree as a constraint condition, and the items such as “constraint time”, which has a high degree of constraint condition, are satisfied. It can be considered a good allocation decision.

The contents of "Knowledge 2, knowledge when operation is assigned to only one job" shown in FIG. 9 are as shown in FIG. 10 "Take breaks to jobs already assigned." If it is possible, it can be rewritten by the man-machine interface 15 such as "assign to a job that has not been assigned yet." The allocation decision finally obtained by the rewriting change is shown in FIG.
It becomes either one shown in (b). In this case, "work 1" will take an early break, and "work 2" will be a long break corresponding to "run 3" and "run 4" (Fig. 14 (a)). Alternatively, both "work 1" and "work 2" have to take a break twice (Fig. 14 (b)), so it cannot be said that the allocation decision is excellent.

Similarly, the contents of "Knowledge 2, knowledge when operation is assigned to only one job" shown in FIG. 9 are as shown in FIG. If it is impossible, it is assigned to it. If it is not possible, it is assigned to a job that has not been assigned yet. "When the rewriting is performed by the man-machine interface 15, the finally obtained assignment decision is as shown in FIG. become. In this case, "work 1" is continuously assigned to "run 1" to "run 3" and "work 2" is sequentially assigned to "run 4" to "run 6", and the delivery of "work 2" is delayed. Therefore, it is still not a very good allocation decision.

Further, by using the contents of "knowledge 2" shown in FIG. 11, the constraint items of "work start time" are shown in FIG. 3 from "05:00 or later" to "05:00 or later and before 07:30." If you rewrite it as ",""operation3" is changed to "work 1"
However, since the constraint condition of “work start time” of “work 2” is not satisfied, this “operation 3” can be assigned to “work 2”, as shown in FIGS. 12 and 13 above. Similar results are obtained. However, in this case, it is not considered to re-execute "Run 2".

Although the above explanations show examples of allocating in order from early morning operation to time, on the contrary, the same result can be obtained by allocating operation time backward and allocating sequentially from late night. Also, if you want to take multiple breaks,
Similar processing can be performed for the break intervals.

[0051]

As described above in detail, according to the present invention, a job database storing and storing a plurality of jobs having at least the departure time and arrival time attributes, a resource database storing and storing a plurality of resources, and a job as a resource. A constraint database that stores and saves multiple levels of constraint conditions at the time of allocation, and jobs that are saved in the job database are retrieved in the order of time and saved in the resource database according to the multiple levels of constraint conditions that are saved in the constraint database. The inference unit assigned to the resource and the man-machine interface that rewrites and changes the content of the constraint condition stored in the constraint database are provided, so that more detailed constraint conditions can be set according to the circumstances required by the resource. Set according to the degree of constraint, The assignment decision may provide assignments apparatus capable of easily performing.

[Brief description of drawings]

FIG. 1 is a block diagram showing a configuration according to an embodiment of the present invention.

FIG. 2 is a diagram illustrating a part of jobs stored in a job database shown in FIG.

FIG. 3 is a diagram showing an example of constraint conditions stored in a constraint database shown in FIG.

FIG. 4 is a view exemplifying constraint conditions stored in a constraint database of FIG.

5 is a diagram exemplifying constraint conditions stored in the constraint database of FIG. 1. FIG.

FIG. 6 is a diagram showing an example of constraint conditions stored in the constraint database of FIG.

7 is a flowchart showing the processing contents of allocation determination by the estimation unit in FIG.

8 is a flowchart showing a subroutine of allocation processing of FIG.

FIG. 9 is a diagram exemplifying knowledge as a reference of an algorithm of an estimation unit.

FIG. 10 is a diagram showing another example of the knowledge of FIG.

FIG. 11 is a diagram showing another example of the knowledge of FIG. 9.

12 is a diagram showing an allocation result obtained by the processing of FIG.

13 is a diagram showing an allocation result obtained by the processing of FIG.

FIG. 14 is a diagram showing another example of the allocation result.

FIG. 15 is a diagram showing another example of the allocation result.

[Explanation of symbols]

11 ... Job database, 12 ... Resource database,
13 ... Constraint database, 14 ... Estimator, 15 ... Man-machine interface.

Claims (1)

[Claims] 1. A job database section for storing and storing a plurality of jobs having attributes of at least a departure time and an arrival time, a resource database section for storing and storing a plurality of resources, and constraint conditions for assigning jobs to resources at a plurality of levels. Constraint database part to be stored and stored, and jobs to be stored in the job database part are extracted in chronological order and assigned to the resources stored in the resource database part according to the multi-level constraint conditions stored in the constraint database part. And an altering unit for rewriting and altering the contents of the constraint conditions stored in the constraint database unit.