JPH01128161A - Work scheduling system - Google Patents

Abstract

PURPOSE:To perform the quick and proper planning jobs via a computer by using a means which sets the limited items for allocation of jobs to these jobs, a means which sets the date of contract and the working hour bands, a means which allocates a specific job to a specific employee in a specific working hour, and a means which allocates the jobs obtained by a pile breaking means at each time point to the proper employees. CONSTITUTION:The working information setting means 101 sets the min./max. hours and the allocation priority order to the jobs contained in a general job file 111 and stores them into a min./max. hour table 107 and a job allocation priority order table 108 in the prescribed formats respectively. The office attending/retiring time points are set for the employees of an employee file 112 and stored in a presence/absence data table 109. A fixed job allocation means 103 refers to the table 109 to store the fixed jobs of a fixed job file 113 into a job allocation result table 110. A general job allocation means 104 refers to the information on a job load file 114 as well as those tables 107-109 to allocate the proper jobs to the proper employees and stores these jobs into the table 110 to be displayed via an allocation result output means 105. An execution control means 106 controls the execution of each means. In such a constitution, the work planning jobs can be carried out by a computer in a quick and proper way.

Description

[Detailed description of the invention] [Industrial application field] The present invention provides information on each resource (humans, equipment, etc.) and when.

The present invention relates to a scheduling method for allocating work, and particularly to a work scheduling method suitable for those who must consider various constraints when allocating work to employees.

[Conventional technology]

At mass retailers, etc., there is a demand for more efficient store operations and better service by planning each task as precisely as in the manufacturing industry for employees with complex employment patterns such as full-time employees, part-time workers, and part-time workers. big. As one of the technologies aimed at realizing this requirement, for example,
There is an invention of No. 173645. This invention defines the amount of work for each task (hereinafter referred to as load) based on the number of personnel and time required to perform the task, and allocates them to the earliest possible start time for each task. Perform a pile of loads. Next, based on the results, the load at each time is adjusted to a load that can be handled by a predetermined number of personnel (hereinafter, this is referred to as "yamadoshi"). This mountain collapse is intended to smooth out the overall load by changing the start time of each task within a predefined movable range.

Store managers and managers of mass retail stores create work schedules for conventional employees, taking into account various constraints such as the results of the above-mentioned workload collapse, the nature of each work, and the employee's dispatch status and work ability. Was.

[Problems to be Solved by the Invention] The above-mentioned prior art only proposes a mechanism to reduce the initial load pile up so that it falls within a predetermined number of personnel, and does not require employees to perform the work. No consideration was given to computerized allocation. Therefore, a limited number of planners, such as store managers and managers, who understand the nature of each work and the abilities of employees, have to spend a lot of time and effort in planning work schedules for each employee.

An object of the present invention is to computerize the work schedule planning work described above and to formulate an appropriate work schedule in a short time.

c. Means for Solving Problems] The above object is achieved by providing the following four means.

(1) Work information setting means A means for setting the following three constraints for each individual task as reference data when assigning tasks to employees.

(a) Minimum allocated time (hereinafter referred to as minimum time) for which the same work must be allocated to one employee. This minimum time is set to prevent work efficiency from decreasing due to frequent changes in assigned work.

(b) Maximum allocated time allowed for one employee (hereinafter referred to as maximum time). This maximum time is set in order to avoid assigning heavy labor work to one employee for a long time.
Set.

(C) Priority order for work assignment to each employee (2) Personal information setting means A means for setting contract dates, working hours, etc. for each employee as reference data when assigning work to employees.

(3) Fixed work assignment means A means for assigning work that must be done by a predetermined employee at a predetermined time (for example, morning assembly, meeting, etc.) to the predetermined employee with top priority.

(4) Work allocation means Based on the data set by the means of (1) and (2) above and the mountain collapse results in which the optimum load is allocated at the optimum time, tasks other than the fixed allocation work are assigned. , a means of assigning it to the appropriate employee.

[Effect]

In the present invention, first, a store manager, manager, or the like uses the work information setting means to set the minimum and maximum time for each work, the priority order of work assignment to employees, etc. Additionally, the personal information setting means is used to set the dispatch time of each employee.

Furthermore, fixed tasks are assigned to predetermined employees using fixed task assignment means. Thereafter, for each task at each time obtained from the load pile-up results, the task assignment means automatically assigns the task to an appropriate employee who satisfies various constraints such as minimum and maximum time for the task. As a result, work schedules for as many skilled workers as store managers and managers can be drawn up in a short period of time.

〔Example〕

An embodiment of the present invention will be described below with reference to FIGS. 1 to 11. FIG. 1 shows the configuration of the work scheduling system adopted in this embodiment.

In the same figure, the work information setting means 101 sets the minimum and maximum time and priority order of work assignment to conventional workers for each work stored in the general work (work other than fixed work) file 111. Set. The results are shown in the format shown in Figure 2(a) for the former, and in the format shown in Figure 2(b) for the latter.
) in the minimum/maximum time table 107 and work allocation priority table 10B, respectively.

The personal information setting means 102 sets the arrival time and leaving time for each employee stored in the employee file 112, and stores the results in the moving object data table 109 in the format shown in FIG.

Next, the fixed work assignment means 103 assigns the fixed work stored in the fixed work file 113 to an appropriate employee among the dispatched workers in the moving object data table. The results are stored in the work allocation result table 110 in the format shown in FIG.

Then, the general work allocation means 104 extracts the data of the workload file 114 in which the results of the load pile-up are stored, the minimum/maximum time table 1079, the work allocation priority table 108. Based on the respective data in the moving body data table 109, tasks are assigned to appropriate employees for an appropriate amount of time, and the results are stored in the task assignment result table 110.

Finally, the allocation result output means 105 outputs the contents of the work allocation result table 110 to the graphic terminal 115 in a screen format as shown in FIG. Execution control means 106 performs execution control of each means 101 to 105.

Next, details of the fixed work allocation means 103 and the general work allocation means 104, which are the main parts of the present invention, will be described. first,
The former method will be explained using the flowchart of FIG.

The fixed task allocation means 103 first displays a list of fixed tasks in the format shown in FIG.
01). From among them, one fixed task to be assigned is selected, or this means is terminated (process 602).

If one fixed task is selected, the employees who are on duty during the working hours of that fixed task are displayed in the format shown in FIG. 7(b) (process 603). If an employee suitable for assignment is present, the fixed work assignment is performed by specifying the display position of that employee (processes 604, 605). Then, the results are stored in the work allocation result table 110.

Next, details of the general work allocation means will be explained using the flowchart of FIG.

<Step 801>: Initial setting of assignment time t A time t for starting work assignment is set. In this embodiment, the business start time is set at time t.

<Step 802>: Extraction of all general workloads at time t Extracts the tasks that occurred at time t stored in the workload file 114, and stores the results in the assignment target task table (FIG. 9). Incidentally, the employees to be assigned the work are sequentially determined in the following steps.

<Step 803>: If there is a workload within the workload presence determination time, proceed to the next step; otherwise, proceed to step 809.

<Step 804>: Business start time judgment time t at time t
If it does not match the business start time, proceed to the next step.
If they match, the process advances to step 806.

<Step 805>: If there is an employee who is able to continue the work at the assignment time (t-1) of the work to be continuously assigned, that work is assigned.

Specifically, first, unassigned general work S at time t
Focus on Then, at time (t-1), the employee W assigned the general work
If the cumulative value of the work allocation time for the general work S satisfies the maximum time in the minimum/maximum time table 107, the general work S is allocated to the employee W at time t as well. The allocation results are stored in the allocation target work table. At this time, the work allocation time accumulation table (FIG. 10) is also updated. The above process is repeated until all general work within the specified time is completed.

<Step 806>: Extraction of unassigned work Extracts the work to which an employee has not yet been assigned in the assignment target work table, and selects the work to be assigned to the work selection table (Figure 11)
Store in.

<Step 807>: Extracting employees who can work One employee who can work is extracted for each work in the allocation work selection table. Specifically, first, based on the assignment priority table and the moving object data table, employees who are dispatched at time t and whose work has not been assigned are extracted. Then, for each task in the assigned task selection table, employees who are qualified for the task are selected from among the extracted employees based on the assigned priority order.

At this time, a check is also made to see if the minimum and maximum times are satisfied.

It is assumed that the selection results are sorted in order of work allocation priority. Finally, the selected number of allocatable employees is displayed in the allotment work selection table (Figure 11 (a)), and the specific employee names are displayed in the allocatable employee table (Figure 11 (a)).
b)) respectively. Furthermore, the number of available personnel, which is obtained by subtracting the number of allocatable employees from the manpower actually required to perform the work, is also stored in the allocated work selection table.

<Step 808>: Assignment of unassigned work is performed to employees who have not yet been assigned work. Specifically, first, tasks for which there are few available personnel are extracted from the assigned task selection table. Then, employees are selected from the assignable employee table for the number of people required for the extracted work, and the extracted work is assigned to these employees. At this time, the work allocation time accumulation table for each employee and the number of employees who can be allocated to 2 free manpower in the work selection table with '#J' are updated respectively. The above process is repeated until all the tasks stored in the allocated task selection table are completed.

<Step 809>: At the time of registration in the work allocation result table, the contents of the allocation target work table at Mt are registered in the work allocation result table 110.

<Step 810>: Update the allocation eye time t The allocation eye time t is updated to the time (t+1).

<Step 811): Determination of business end time at time t Whether the updated time t is the business end time or not, this means ends.

Otherwise, the process returns to step 802.

According to this embodiment, a high-quality work schedule that satisfies various constraint items such as minimum and maximum time set for each work can be drawn up in a short time.

〔Effect of the invention〕

According to the present invention, it is possible to formulate an appropriate work schedule that adheres to various constraints such as the minimum and maximum time set for each work and the priority order of assignment to employees.

As a result, we can expect effects such as being able to automatically create work plans for the number of skilled workers such as store managers and managers, and reducing the number of required employees.

[Brief explanation of the drawing]

Figure 1 is a block diagram of the work scheduling system taken up in the embodiment of the present invention, Figure 2 (a) is a minimum/maximum time table diagram, Figure 2 (b) is a work allocation priority table diagram, and Figure 3 is a moving body data table diagram, Figure 4 is a work assignment result table diagram, Figure 5 is a diagram showing an output example of work assignment results, Figure 6 is a flowchart showing the assignment procedure for fixed assignment work, and Figure 7 is a fixed assignment Work allocation is a diagram showing an example of screen output, Fig. 8 is a flowchart showing the general work allocation procedure, Fig. 9 is an allocation target work table, Fig. 10 is a work allocation time accumulation table, and Fig. 11 ( FIG. 11A is a table diagram for selecting assignment work, and FIG. 11B is a table diagram of assignable employees. 101... Work information setting means, 102... Personal information setting means, 103... Fixed work allocation means, 1o4...
・-General work allocation means, 107... Minimum/maximum time tape No. 3 Figure 4 No. S Figure ``V'' Figure (α) l L % 3rd- TART. 801
Nono→Kiharu Kanze '802 Old Ropayiku Liso δ°3 Child Sasumi Time Power Ki 3'' Minoh B

Claims (1)

[Claims] 1. A means of accumulating the amount of work for each task that occurs every day,
In a work planning system consisting of means for collapsing the accumulated results obtained by the above means into a pile within a predetermined number of people on hand, there is a minimum requirement that the same work must be assigned to one employee at least consecutively. A method for setting various constraints related to work assignments to employees, such as allocated time, for each individual work, a method for setting contract dates and working hours for each employee, and a method for setting specific work assignments for specific employees. and a means for allocating each work at each time obtained by the above-mentioned pile-up means to an appropriate employee based on various constraint items set by the above-mentioned setting means. A work scheduling method characterized by the provision of.