JP6682223B2 - Plan management system and plan management method - Google Patents

Description

  The present invention relates to a plan management system and a plan management method, and specifically enables a suitable and flexible work plan to be created by allocating workers with good accuracy, regardless of the presence or absence of skill information of workers. Regarding technology.

  There is a situation in which a limited number of workers carry out regular maintenance work and trouble countermeasures for a large number of devices distributed over a wide range. In that case, work planning and management work that systematically assigns workers to each work in each period is essential.

  As such a technique, for example, for each target device, a device information storage unit that stores device information including a device code indicating the type of the target device and an installation location code indicating the installation location, and for each worker, A skill information storage unit that stores skill information that indicates whether a worker has the skills to perform fault recovery work or maintenance inspection work on target devices, and fault recovery of target devices assigned to each worker A schedule information storage unit that stores time schedules for work and maintenance inspection work as schedule information, and an assignment processing unit that assigns workers in response to worker assignment requests for fault recovery work and maintenance inspection work of target devices, And the allocation processing unit includes the type and installation of the target device according to the allocation request acquired from the device information stored in the device information storage unit. Location, the skill information of the worker stored in the skill information storage unit, and the schedule information of the worker stored in the schedule information storage unit, are used for the failure recovery work and the maintenance inspection work of the target device. An information processing apparatus (see Patent Document 1) and the like for allocating a number has been proposed.

JP, 2014-179837, A

  According to the related art, it is possible to realize the worker assignment to each work based on the accumulated skill and schedule information of each worker. However, if the skill information of each worker is not managed in advance, it is not possible to realize suitable worker assignment.

  On the other hand, there is a case where the work plan is manually drafted by a planner without adopting such a work plan drafting technique. The planning content obtained in that case is based on the personal know-how and experience of the person in charge of planning, and the planning accuracy tends to be unstable. Further, in actuality, it is difficult to optimally allocate a worker unless other factors such as the work record of the worker, the area in charge, and the like are also taken into consideration in addition to the skill of the worker.

  In addition, even if there is a situation in which the planned work plan should be corrected, it is necessary to make a correction so that the assigned contents are consistent among a large number of workers, which is a heavy burden on the planner. On the other hand, if such a modification is made easily, there is a concern that the contents of the assignment will be different among the respective workers and the work plan as a whole will fail.

  Therefore, an object of the present invention is to provide a technique capable of making a suitable and flexible work plan by assigning workers with good accuracy regardless of the presence or absence of skill information of workers.

A plan management system of the present invention which solves the above-mentioned problems, a storage device which stores information of a predetermined work, work record information of each worker engaged in the work, and work shift information of each worker, a plan Based on the information of each target work and the work record information of each worker, the suitability for each work of each worker is estimated by a predetermined algorithm, and according to the estimated high degree of suitability. Specify a worker candidate to be assigned to each work, a work plan, which is a set of work groups that is a group of the worker candidates of each work , integrates a work pair that is a pair of the work group of the work group. and an arithmetic unit to create by repeating be determined from the set integration, the arithmetic unit, when determining the working pair for the repeated integrated from the set of the working group, the work An objective function related to the set of work groups, which includes at least as a variable a total of the movement costs of all the worker candidates who perform work to be assigned to a work group forming a set of groups as a variable. By repeating the calculation of the value of and the work pair that maximizes the reduction amount of the value of the objective function after integration with respect to the value of the objective function before integration, thereby determining the work pair to be integrated. When the pair of the determined work groups is integrated, the worker candidate assigned to each work of the work group to be integrated is a deadline for the work of the work group to be integrated indicated by the information of the predetermined work. thereby identified by the worker with assignable work shifts to the information in the work shift within, to the integrated By selecting the compatible high worker to each work of the working groups preferentially, it is to identify, characterized in that.

In addition, the plan management method of the present invention is an information processing system including a storage device that stores information about a predetermined work, work record information about each worker engaged in the work, and work shift information about each worker. However, based on the information of each work to be planned and the work performance information of each worker, the suitability of each worker to each work is estimated by a predetermined algorithm, and the estimated suitability is high. According to the degree, the worker candidate to be assigned to each work is specified, and the work plan, which is a set of work groups that is a group of the worker candidates for each work , is integrated into a work pair that is a pair of the work group. Created by repeating determination and integration from a set of work groups, and when determining the work pair to be repeatedly integrated from the set of work groups, configure the set of work groups. Calculating the value of the objective function related to the set of the work groups, which includes at least the transfer cost of all the worker candidates who perform the work to be assigned to the work group as a variable. The work pair to be integrated is determined by repeatedly specifying the work pair that maximizes the decrease amount of the value of the objective function after integration with respect to the value of the previous objective function. A work shift in which , when integrating a pair of work groups that have been integrated, the worker candidates assigned to each work of the work group to be integrated can be assigned within the deadline for the work of the work group to be integrated indicated by the information of the predetermined work. together identified by the operator by referring to the information of the work shift with, for each working working group of the integrated By selecting the serial highly compatible worker priority, it is to identify, characterized in that.

  According to the present invention, it is possible to make a suitable and flexible work plan by assigning workers with good accuracy, regardless of the presence or absence of worker skill information.

It is a figure which shows the network structural example containing the plan management system of this embodiment. It is a block diagram which shows the structural example of the terminal in this embodiment. It is a figure which shows the structural example of the server system and client PC in the plan management system of this embodiment. It is a figure which shows the structural example of the database in the server system of this embodiment. It is a figure which shows the data structural example of the work data in this embodiment. It is a figure which shows the data structural example of the work plan data in this embodiment. It is a figure which shows the data structural example of the work result data in this embodiment. It is a figure which shows the data structural example of the work shift data in this embodiment. It is a figure which shows the data structural example of the work shift template data in this embodiment. It is a figure which shows the data structural example of the worker estimation result data in this embodiment. It is a figure which shows the example 1 of a flow of the plan management method in this embodiment. It is a figure which shows the example 2 of a flow of the plan management method in this embodiment. It is a figure showing an example of the processing concept of worker presumption in this embodiment. It is a figure which shows the example 3 of a flow of the plan management method in this embodiment. It is a figure which shows the conceptual example of the group in this embodiment. It is a figure which shows the conceptual example of group integration in this embodiment. It is a figure which shows the conceptual example of worker integration in this embodiment. It is a figure which shows the example 1 of a display screen in this embodiment. It is a figure which shows the example 2 of a display screen in this embodiment. It is a figure which shows the example 3 of a display screen in this embodiment. It is a figure which shows the example 4 of a flow of the plan management method in this embodiment. It is a figure which shows the conceptual example of Gantt chart correction in this embodiment. It is a figure which shows the conceptual example 1 of the reflection process to the map at the time of Gantt chart correction in this embodiment. It is a figure which shows the conceptual example 2 of the reflection process to the map at the time of Gantt chart correction in this embodiment. It is a figure which shows the example 5 of a flow of the plan management method in this embodiment. It is a figure which shows the example of a concept of plan correction on the map in this embodiment. It is a figure which shows the conceptual example 1 of the reflection process to a Gantt chart at the time of plan correction on a map in this embodiment. It is a figure which shows the conceptual example 2 of the reflection process to a Gantt chart at the time of plan correction on a map in this embodiment. It is a figure which shows the example 4 of a display screen in this embodiment. It is a figure which shows the example 5 of a display screen in this embodiment.

--- Network configuration ---
Embodiments of the present invention will be described below in detail with reference to the drawings. FIG. 1 is a network configuration diagram including a server system 100 that is a plan management system of this embodiment. A server system 100 (hereinafter referred to as a server system 100), which is a plan management system shown in FIG. 1, is a computer that enables a suitable and flexible work plan to be created by allocating workers with good accuracy, regardless of the presence or absence of skill information of workers. System.

  In the present embodiment, the worker targets a group of target devices that are installed in a wide range, such as an automatic teller machine installed in a bank or the like. Further, the work performed by the worker is assumed to be periodic maintenance work for such a target device group, troubleshooting, etc. Therefore, the work plan drafted by the server system 100 is a plan showing at what timing and which worker is assigned to the maintenance work of each target device distributed in each region.

  The server system 100 shown in FIG. 1 is communicably connected to a plurality of mobile information terminals 200 and client PCs 300 via an appropriate network 10 such as the Internet. The mobile information terminal 200 is a mobile terminal such as a smartphone or a tablet carried by a worker who carries out work in various places. Further, the client PC 300 is a PC for operating a planner who uses the server system 100 to input instructions and data necessary for the work planning process in the server system 100, and for browsing the process result. Become.

  Of these, only three portable information terminals 200 are shown in FIG. 1, but the number is not limited. The number of portable information terminals 200 corresponds to the number of workers who perform work.

--- Hardware configuration ---
Next, the hardware configuration of each device including the server system 100 of this embodiment will be described. FIG. 2 is a block diagram showing a configuration example of the mobile information terminal 200 in this embodiment. The mobile information terminal 200 shown here includes a wireless communication device 201, a display device 202, a position information acquisition device 203, a photographing device 204, a CPU (Central Processing Unit) 205 as an arithmetic device, an input device 206, and a memory 207. .

  Of these, the wireless communication device 201 is a wireless communication unit that executes wireless communication processing according to the protocol of the network 10 and exchanges data with the server system 100.

  The display device 202 is a display device that presents various processing results such as a work plan obtained from the server system 100 via the wireless communication device 201 to the user.

Further, the position information acquisition device 203 acquires position information from the GPS satellite 208 in the sky.
It is a PS unit. The position information acquisition device 203 is composed of a satellite radio wave reception circuit and the like, and calculates the position information of the latitude and longitude where the portable information terminal 200 is located based on the radio wave received from the GPS satellite 208.

  The image capturing device 204 is an appropriate image capturing device such as a digital still camera.

  The input device 206 is an input interface such as a button or a touch panel on which an operator who is a user performs an input operation.

  In addition, the memory is a non-volatile storage device such as a flash memory that stores data held in advance by the mobile information terminal 200 itself or data obtained from the server system 100.

  FIG. 3 is a block diagram showing a configuration example of the server system 100 and the client PC 300 in this embodiment.

  Among them, the server system 100 is a CPU 101 which is an arithmetic unit for controlling the entire apparatus, a network interface 102 for connecting to another device via the network 10, an I / O 103 for connecting to an external device such as a USB, and a work plan. A storage device 104 for storing necessary worker and map data, work plans, work results, etc., an input device 105 such as a keyboard and a mouse for a user to input, and a display device for displaying processing results, logs, etc. 106 and a memory 107 which is a non-volatile storage device. These components 101 to 107 are connected by a data bus 108.

  Further, the above-mentioned memory 107 stores a worker estimation program 110, a work plan program 111, and a plan correction program 112. These programs are executed by the CPU 101, and the functions necessary for the plan management system are installed.

  On the other hand, the client PC 300 has a CPU 301 for controlling the entire apparatus, a network interface 302 for communicating with the server system 100 via the network 10, an I / O 303 for connecting with an external device such as a USB, and a planner for inputting. An input device 305 such as a keyboard and a mouse, a display device 306 for displaying processing results and logs, and a memory 304 which is a non-volatile storage device. These components 301 to 306 are connected by a data bus 307.

  In the present embodiment, the server system 100 transmits the work plan and the work content of the day stored in the storage device 104 to each mobile information terminal 200 via the network 10. The worker carrying the portable information terminal 200 refers to the information transmitted from the server system 100 and carries out the work according to the work plan. Further, this worker inputs the work result on the portable information terminal 200 and uploads it to the server system 100 via the network 10. The server system 100 stores such work results in the work result data 402 of the database 1041.

--- Data structure example ---
Next, a data configuration example of the database 1041 held in the storage device 104 by the server system 100 of this embodiment will be described. FIG. 4 shows a configuration example of the database 1041 held in the storage device 104 by the server system 100 of this embodiment. The database 1041 includes work data 400, work plan data 401, work result data 402, worker estimation result data 403, work shift data 404, work shift template data 405, and map data 406.

  FIG. 5 is a diagram showing a data configuration example of the work data 400 according to the present embodiment. The work data 400 of this embodiment uses a work ID 500 that uniquely identifies each work to be planned, as a key, a work type 501 that indicates the type of work such as periodic inspection and troubleshooting, and a device that indicates the type of target equipment for the work. Type 502, customer ID 503 that identifies the customer in which the target device is installed, address (latitude) 504 that indicates the address in which the target device is installed, address (longitude) 505, customer that indicates the customer's business type such as a retail store or a bank Type of industry 506, amount of work 507 indicating work time of work, urgency 508 of target work, importance 509, start date 510 indicating start deadline for work, start time 511, end date 512, and end time Each value of 513 is a set of associated records.

  The data structure of the work data 400 is not limited to that illustrated in FIG. 5, and data items may be added as necessary. This point also applies to other data in the database 1041.

  The data 514, 515, 516, 517, and 518 in the work data 400 of FIG. 5 are examples of the stored data of the work data 400. For example, the data 514 is data related to the work ID 100, which is the “regular inspection” work for the “equipment A” installed in the customer of the bank with the customer ID “C912”, the work amount “90 minutes”, and the emergency. The degree is “ordinary” and the degree of importance is also “ordinary”, and the work may be performed during one month from “2014/6/1” to “2014/6/31”. Further, regarding the data 515, 516, 517, and 518, similarly, data regarding each work is stored.

  Further, the work plan data 401 stores a work plan prepared by the work plan program 111 of the server system 100. As its configuration, a work ID that uniquely identifies the target work, the allocation start date, allocation start time, allocation end date, allocation end time, and corresponding Includes worker ID, etc.

  FIG. 6 shows an example of the data structure of the work plan data 401 described above. The work plan data 401 in FIG. 6 has a start ID 601, an allocation start time 602, an allocation end date 603, and an allocation end time, which are allocated by the work planning program 111, using the work ID that uniquely identifies the work as a key. 604, a worker ID 605 of the assigned worker is a collection of associated records.

  In the work plan data 401 illustrated in FIG. 6, data 606, 607, and 608 indicate an example of the stored data of the work plan data 401. Among them, for example, the data 606 is work plan data regarding the work ID “100” indicated by the data 514 in the work data 400 of FIG. According to the data 514, the amount of work is “90 minutes” and “2014/6/15” for the work that needs to be performed during one month from “2014/6/1” to “2014/6/31”. Are assigned from “10:00” to “11:30”, and the assigned worker is “CE001”. Further, regarding the data 607 and 608, similarly, work plan data regarding each work is stored. The process of the work plan program 111 that creates a work plan will be described later.

Further, the work result data 402 stores work IDs that uniquely identify the work and information regarding the execution result of each work. FIG. 7 shows a data configuration example of the work result data 402. The work result data 402 illustrated here uses the work ID 700 that uniquely identifies a work as a key, with respect to the allocation start / end date and the allocation start / end time stored in the work plan data 401 of FIG. The actual start date 701, the actual start time 702, the actual end date 703, and the actual end time 704 at which the assigned worker actually started the work are stored, and the assigned worker's worker ID 705, actual Is a set of records in which values such as a work time 706 indicating a required time of the work and a memo during the work are associated with each other.

  The server system 100 transmits the work plan data 401 in FIG. 6 to the mobile information terminal 200 owned by each worker. On the other hand, the worker who operates the portable information terminal 200 refers to the work plan and the contents, and carries out the daily work in which he / she is the assigned worker at each place. When the assigned worker finishes his / her work, he / she operates the portable information terminal 200 to record the work result, and sends it to the server system 100. Thus, the work result data obtained by the server system 100 is stored in the work result data 402 illustrated in FIG. 7.

  In the work result data 402 in FIG. 7, data 708, 709, and 710 indicate an example of the stored data of the work result data 402. Among them, for example, the data 708 is the work result data regarding the work ID “100”, the assigned worker is “CE001”, and the work is started at the time “10:05” on “” 2014/6/15, and the same day. The work is finished at the time “11:25”, and the work time is “80 minutes”. As for the work with the work ID “100”, as shown in FIG. 5, the work amount is “90 minutes”, and the work may be performed within one month of “2014/6/1” to “2014/6/31”. In FIG. 6, the assigned workers are assigned to “CE001” from “10:00” to “11:30” of “2014/6/15”, and “CE001” is assigned to this plan. Actually started work at time “10:05” on “2014/6/15” and finished work at time “11:25” on the same day, and the work time is “80 minutes”. .

  Further, the work shift data 404 stores a worker ID 800 that uniquely identifies a worker and information regarding the work shift of each worker. FIG. 8 shows a data configuration example of the work shift data 404. The work shift data 404 illustrated in FIG. 8 is a set of records in which the worker ID 800 is used as a key, and the name 801, the target date 802, and the values of the work form 803 corresponding to the date are associated with each other. Has become.

  Data 804, 805, 806, 807, and 808 in the work shift data 404 indicate an example of data stored in the work shift data 404. Of these, for example, the data 804 is data of work shifts relating to the worker with the worker ID “CE001”, and “normal” is stored as the work form of “2014/6/1”. Further, the data 806 is data relating to the worker with the worker ID “CE002”, and “am / ann vacation” is stored as the work form of “2014/6/1”. Similarly, regarding the data 805, 807, and 808, the work patterns of each worker and date are also stored.

  Further, the work shift template data 405 stores work start time, end time, break time, and the like of each shift in association with each work form managed by the work shift data 404 described above. FIG. 9 shows a data configuration example of the work shift template data 405. The work shift template data 405 in FIG. 9 is a set of records in which the values of the work start time 901, the work end time 902, the break start time 903, and the break end time 904 are associated with the work form 900 as a key. ing.

  Data 905, 906, and 907 in the work shift template data 405 in FIG. 9 are examples of data stored in the work shift template data 405. Of these, for example, the data 905 stores the start time “9:00”, the end time “17:00”, the break start time “12:00”, and the break end time “13:00” as data related to “normal” work. Has been done. Further, as for the data 906 and 907, the working hours related to the working hours of the annual leave and the variable work are stored, respectively.

  Further, the worker estimation result data 403 stores a work ID for uniquely identifying the work and information about the estimated worker (worker candidate) for the target work estimated by the worker estimation program 110 in FIG. .

  The worker estimation result data 403 is the worker ID 1001 of the worker estimated by the worker estimation program 110 to be assigned to the work using the work ID 1000 that uniquely identifies the work as a key, and its estimated probability 1002 (fitness). ) Is a collection of associated records.

  The worker estimation program 110 of the server system 100 uses the work data 400 and the work result data 401 to estimate the suitability of each worker for the target work as an estimated probability, and specifies a worker candidate according to the result. Then, the result is stored in the worker estimation result data 403. The processing of the worker estimation program 110 will be described later.

  Data 1005, 1006, 1007, 1008, 1009, and 1010 in the worker estimation result data 403 in FIG. 10 show an example of stored data of the worker estimation result data 403. Of these, for example, data 1005, 1006, and 1007 are the worker estimation results for the work ID “501”, the data 1005 is the worker “CE001”, the estimated probability is “0.6”, and the data 1006 is the worker “CE004. , Estimated probability “0.2”, data 1007 stores worker “CE005”, estimated probability “0.15”.

  The higher these estimated probabilities, the higher the probability that the worker will be assigned to the work “501” from the past work record. Similarly, regarding the data 1008, 1009, and 1010, the worker estimation result regarding the work ID 502 is stored.

Although not particularly shown, the map data 406 includes general GIS (Graphics).
l Information System) Similar to the storage device, the location information of roads, buildings, etc. is stored. The data is based on existing technology, and detailed explanations are omitted.

--- Flow example 1 ---
The actual procedure of the plan management method according to this embodiment will be described below with reference to the drawings. Various operations corresponding to the plan management method described below are realized by the programs 110 to 112 that the server system 100 reads into a memory or the like and executes. The program is composed of codes for performing various operations described below.

  FIG. 11 is a diagram showing a flow example 1 of the plan management method according to the present embodiment, and specifically, a diagram showing the entire flow. Here, it is assumed that each process in the portable information terminal 200 is executed and controlled by the CPU 205, and each process in the server system 100 is executed and controlled by the CPU 101. Further, it is assumed that each process of work plan planning in the server system 100 can be started by an appropriate trigger given to the server system 100 by the planner via the client PC 300.

  In this case, the planner operates the client PC 300 to access the server system 100, input the year and month of the plan on the predetermined screen 1608 provided by the server system 100, and the corresponding deadline of the work data 400 is planned. Request a search for work groups that match the target month.

FIG. 18 is a diagram showing an example of the main screen 1600 of the Web browser screen displayed on the display device 306 by the client PC 300, and FIG. 19 is a diagram showing an example of the planning screen 1608. A main screen 1600 shown in FIG. 18 is a screen for a planner to confirm a work plan and a work progress situation. The planner operates the client PC 300 to select the sales office where the work target device is installed on the interface 1602 on the main screen 1600. The server system 100 receiving this selection via the client PC 300, for example, stores the customer ID indicating the corresponding sales office, the worker ID of the worker who belongs to the sales office, etc. Search is performed on the work data 400 and the work plan data 401 with the key), and the client PC 300 displays the work plan and work data managed by the sales office.

  The client PC 300 displays the information of the work data 400 thus obtained from the server system 100 in the area 1603, and displays the information about the worker of the sales office in the area 1604. The client PC 300 also displays information such as a work plan on the map 1601 indicated by the map data 406. Similarly, the client PC 300 also displays information such as the work plan described above on the Gantt chart 1605. Details of the map 1601 and the Gantt chart 1605 will be described later.

  On the other hand, as described above, the screen for the planner to enter the planning target year / month is the planning screen 1608. The planner presses the schedule creation button 1606 on the main screen 1600 of FIG. 18 to transition the screen to the planning screen 1608.

In addition, the planner inputs the target year in the input field 1608 and the target month in the input field 1609 of the planning screen 1608 illustrated in FIG. 19, and presses the search button 1610.
In the server system 100 that receives this pressing via the client PC 300, the target year / month input by the planner in the input fields 1608 and 1609 is the target of planning, that is, the target year in which the corresponding deadline of the work data 400 is input. The database 1041 is searched for a work group included in the month, and information on the work group is returned to the Web browser of the client PC 300 (step 1100).

  On the other hand, the client PC 300 receiving this displays the information of the work group as the search result in the area 1613 of the above-mentioned planning screen 1608 displayed by the Web browser browser. The planner who has browsed the information of this work group operates the client PC 300 and presses the worker estimation button 1611 on the planning screen 1608 to instruct the server system 100 to execute the worker estimation process.

  On the other hand, the server system 100 receives the instruction of the worker estimation process from the client PC 300 and executes the worker estimation program 110 (step 1101). Accordingly, the server system 100 uses the work data 400 and the work result data 402 corresponding to the work group described above to estimate the worker candidates for the work to be planned and return the estimation result to the client PC 300. It is also stored in the worker estimation result data 403 (step 1102).

  The planner browses the information of the worker estimation result returned from the server system 100 on the client PC 300. Then, the planner confirms the priority order among the respective worker candidates in the worker estimation result, and if necessary, the client PC 300 instructs the server system 100 to modify the priority order (eg, worker). Send a candidate priority order replacement instruction) and confirm the correction result.

  On the other hand, the server system 100 receives the above-mentioned correction instruction transmitted from the client PC 300, and executes the processing such as the replacement of the priority order among the corresponding workers in the worker estimation result data 403 (step 1103). .

  The planner who confirms the completion of the above correction operates the client PC 300 and presses the plan making button 1612 on the above-mentioned plan making screen 1608.

  The server system 100 receives the event of pressing the plan planning button 1612 via the client PC 300, executes the work planning program 111, and executes the work planning process (step 1104).

  In step 1104, the server system 100 uses the worker estimation result data 403, the work data 400, the work shift data 404, and the work shift template data 405 to create a work plan for the planning target year and month.

  The server system 100 stores the work plan created by executing step 1104 in the work plan data 401 (step 1105). Detailed processing contents of step 1104 by the work planning program 111 will be described later.

  In addition, the server system 100 transmits the work plan thus created to the client PC 300 and displays it on the display device 306 (step 1106). In step 1106, the client PC 300 displays the created work plan on the map 1615 and the Gantt chart 1614 of the plan making screen 1608. The details of this display process will also be described later.

  On the other hand, the above-mentioned planner browses and confirms the work plan created by the server system 100 on the planning screen 1608 of the client PC 300. As a result, if there is a portion to be changed, the client PC 300 is operated to perform an appropriate change operation such as moving the object of the target event (work, worker) on either the map 1615 or the Gantt chart 1614.

  On the other hand, the server system 100 accepts such a change operation via the planning screen 1608 of the client PC 300, and the change operation for the object on either the map 1615 or the Gantt chart 1614 is performed on the map 1615 or the Gantt chart 1614. It is reflected as a change operation of the arrangement of the predetermined object on the other side (step 1107), and the process is ended.

  For example, the planner can confirm the work plan displayed on the map 1615 or the Gantt chart 1614 on the planning screen 1608 and move the object in either one of them to change the work plan. . For example, when the planner performs a switching operation between certain work bars (objects corresponding to the work) on the Gantt chart 1614, the plan correction program 112 of the server system 100 operates and the corresponding work on the map 1615 is displayed. Dynamically update the display position of the icon (object corresponding to the work). Alternatively, when the planner changes the position of the icon on the map 1615, the plan correction program of the server system 100 operates to dynamically update the display position of the work bar of the corresponding work on the Gantt chart 1614. In this way, the server system 100 interactively dynamically modifies and updates the work plans displayed on the Gantt chart 1614 and the map 1615. Detailed processing of the plan modification program 112 will be described later.

--- Flow example 2 ---
Next, the worker estimation process (step 1102) and the worker estimation result correction process (step 1103) in the above flow example 1 will be described. FIG. 12 is a diagram showing a flow example 2 of the plan management method in the present embodiment, and specifically, a detailed flow of the worker estimation process (step 1102).

  In this case, first, the server system 100 searches the work data 400 and the work result data 402 for data of the work that has already been completed and before the planned year and month (step 1200). Further, the server system 100 stores the work data and the work result data obtained by the search in step 1200 in the memory 107 in association with each other using the work ID as a key (step 1201).

  Here, the “completed” work means a work in which data is registered in the work result data 402 and data such as the actual start date, the actual end date, etc. is input. In addition, the data "before the planned target month" means that the actual start date and the actual end date have been implemented before the target date when the work plan to be the next target is drafted. means.

  In this way, a table in which the search result 1301 of the work data and the search result 1300 of the work result data are combined using the work ID as a key is shown as a data table 1307 in FIG. This data table 1307 is a table in which attribute information of work excluding date and time is extracted from work data and work result data.

  Subsequently, the server system 100 sets work data and work result data, which are associated with the work ID as a key in step 1201 described above, as work record data, and inputs the data to identify a discriminator that estimates a worker candidate. (Step 1202).

  In this embodiment, a discriminator that estimates a worker candidate in a work is specified by using a statistical method called a quantification theory type 2. This quantification theory type 2 is a discriminant analysis targeting categorical variables, and when it is clear that the data groups given in advance are divided into different groups, when a new data group (sample data) is obtained. In addition, it is a method for obtaining a criterion (discriminator) for discriminating which group to enter. Since this method is a general method, detailed description is omitted.

  Subsequently, the server system 100 inputs the work data to be planned into the discriminator identified in step 1202 described above, and identifies a worker candidate from the output (step 1203). In steps 1202 and 1203, the server system 100 identifies the worker candidate in each work by inputting the data table 1307 created in step 1201 and the work data table 1303 to be planned.

  A specific example of identifying worker candidates will be described based on the example of FIG. 13. For example, the data table 1307 based on the work record data created in step 1201 stores attribute information of past work data and information of workers actually assigned. Further, in this data table 1307, the work attribute information is composed of categorical variables.

  The server system 100 uses the past work record data table 1307 as input data and applies the quantification theory 2 to obtain the discriminator described above. That is, a classifier for determining to which worker group the work having what attribute belongs is obtained from the huge past work record. The server system 100 calculates the probability value 1304 belonging to each worker group by inputting the work data 1303 of the planning target to which the worker is not yet assigned to the determined discriminator 1302. That is, the discriminator 1302 equipped with the algorithm based on the quantification theory 2 can calculate the probability value 1304. The larger the probability value, the higher the possibility of being assigned to the target work from the past work record.

For example, when the work data 1305 with the work ID “501” is input to the discriminator 1302, the estimation result 1306 is obtained as a result. In this estimation result 1306, for the work with the work ID “501”, the worker “CE001” has an estimated probability “0.5” and the worker “CE004”.
Is estimated probability “0.2”, worker “CE005” is estimated probability “0.15” ... In this case, the worker “CE001” has the highest probability of being assigned to the attribute information of the work ID “501” from the work record. The server system 100 stores this estimation result in the worker estimation result 404 in the database 1041. When allocating workers for work, not only skills, but also factors such as experience of workers, achievements, compatibility between visiting customers and workers, areas in charge, etc. are considered in a composite manner. Although it is necessary, by using the quantification theory type 2, it is possible to assign the most preferable worker in consideration of various factors based on the work record including the know-how of the planner.

--- Details of correction of worker estimation results ---
Next, step 1103 for correcting the worker estimation result will be described. When the planner presses the worker estimation execution button 1611 on the plan drafting screen 1608 shown in FIG. 19, the server system 100 which receives it via the client PC 300 executes the worker estimation process described above.

  In this process, the server system 100 estimates a worker candidate that is most likely to be assigned to the work to be planned based on the work record, and prioritizes the worker candidates based on the work record. In the server system 100 in this process, the higher the above-mentioned estimated probability among the worker candidates, the higher the priority.

  However, this priority order is not completely fixed, and corrections from the planner can be accepted. FIG. 20 shows an example of the confirmation / correction screen 1700 for the worker estimation result.

  After executing the worker estimation process (step 1102), the server system 100 causes the client PC 300 to display the worker estimation result confirmation / correction screen 1700 shown in FIG. The planner browses the screen 1700 on the client PC 300. When the planner performs, for example, a selection operation of a predetermined work in the work information display field 1701, the server system 100 receiving this operation displays the worker estimation result for the work in the area 1703.

  On the screen 1700 of FIG. 20, the work ID “501” is selected, and the worker estimation result regarding the work “501” is displayed in the area 1703.

  The recommended rank in the area 1703 is a rank that is defined such that the probability value of each worker candidate included in the worker estimation result is higher to higher rank. On the other hand, the planner can arbitrarily change the rank among the worker candidates that can be recognized from the worker estimation result.

  For example, on the screen 1700 of FIG. 20, the planner assigns the worker “CE001” (data 1704) having the first recommended rank and the worker “CE030” (data 1705) having the same fourth rank with a mouse or the like. It is replaced by operating the input device. The planner presses the OK button 1706 when the order change by such an operation is completed.

  The server system 100 that receives this pressing via the client PC 300 determines the priority order (after replacement) of the relevant worker candidate in the worker estimation result data 403. It should be noted that when the planner presses the cancel button 1707, the order change by the operation up to that point is canceled.

As a normal operation in the server system 100 of the present embodiment, a worker who has the most comprehensive record of various attribute information of the target work based on the work record is given a high priority. However, when it is desired to assign a worker having a poor work record as an assigned worker for the purpose of education, it is possible to change the order such as increasing the priority of the worker.

--- Flow example 3 ---
Next, the planning process (step 1105) in the flow example 1 will be described with reference to FIGS. FIG. 14 is a diagram showing a flow example 3 of the plan management method in the present embodiment, and specifically, a detailed flow of the plan planning process (step 1105).

  In this planning process, the server system 100 first takes an approach of generating an initial work group set and then integrating the work groups included in this set in order to obtain a final work plan. It should be noted that a group of worker candidates who perform a series of actions, which departs from a certain sales office and perform one predetermined work, and returns to the above-mentioned sales office, is associated with the corresponding work as one work. Make a group.

  At this time, the server system 100 determines the integration priority for each work group pair, and based on this priority, integrates the work groups in order from the one with the smaller predetermined objective function. This finally outputs a work plan that minimizes the objective function.

  In this embodiment, the above-mentioned objective function is expressed by Expression (1). F1 in the equation (1) is a term indicating the total work cost, and by minimizing this term, a work plan with the minimum cost can be obtained. Specifically, the worker departs from the sales office, works while moving between the equipments to be worked, and finally returns to the sales office. The cost of the work group is the sum of the cost of this movement and the cost of the work. The sum of all work groups is f1. In the present embodiment, the business office is departed and always returns to the business office, but each worker may depart from the home and return to the home.

  Further, f2 in the equation (1) represents the standard deviation of the daily work amount, and by minimizing this term, the daily work amount can be leveled. Similarly, f3 indicates the standard deviation of the amount of work for each worker, and by minimizing this term, the amount of work for each worker can be leveled.

  In Expression (1), the objective function is obtained by multiplying f1, f2, and f3 by weighting factors w1, w2, and w3, respectively, and taking the sum. The planner may change the weighting factor according to which of these three terms is weighted to create the work plan.

  Under such a premise, the server system 100 obtains a work plan that minimizes the above-mentioned objective function, that is, a set of work groups, in the work plan planning process.

The planning process will be described below according to the steps of the flowchart. First, the server system 100 generates an initial work group set (step 1400). It is assumed that the server system 100 in step 1400 constitutes one work group by one work. That is, the state in which the worker departs from the sales office, carries out one work, and returns to the sales office is the initial work group. The initial group set is as shown in FIG. The information on the worker candidates obtained by the worker estimation process is associated with each work group. For example, in work A (1501), worker candidates A, B, C, D, and E are in work B (1502).
The worker candidates B, E, G, A, and C are associated with.

  Next, the server system 100 calculates the integration priority of each work group with the neighboring work groups, and creates an integration priority list (step 1401). In this case, the server system 100 calculates the integration priority Δ for each work group gi included in the initial work group set with other nearby work groups, and creates an integration priority list. A work group in the vicinity of the work group gi is sufficient as the work group for calculating the integrated priority Δ. The integrated priority Δ (gi) of the work group gi can be calculated by the equation (2).

  Here, ηi indicates the spatial neighborhood of the work group gi. Further, Δfgi-k shown in Expression (2) is the difference between the objective functions before and after the integration of the work groups gi and gk. When obtaining the integration priority of the work group gi, which of the work groups in the spatial neighborhood ηi of the group gi the server system 100 integrates with, which expression (1) that is the objective function becomes the minimum. To calculate. When the difference before and after the integration (= integration priority) is positive, the integration function of the two groups reduces the objective function. On the other hand, if the difference between before and after the integration is negative, the integration does not reduce the objective function. The server system 100 sets the combination of groups having the largest reduction amount of the objective function and the reduction amount of the work groups in the spatial neighborhood ηi of the group gi as the integrated priority of the work group gi.

  The group of integration candidates is limited to the neighborhood ηi of the group gi. If the integration candidate group gk is the entire jurisdiction area, the combination of groups with small cost reduction due to integration is calculated, and the search range becomes enormous, which is not realistic. Absent. Therefore, the integrated candidate group gk is limited to the neighborhood ηi of the target group gi.

  The server system 100 calculates integrated priorities for all groups gi included in the work group set G, and creates an integrated priority list in the memory based on the result.

  Next, the server system 100 integrates the two groups having the highest priority from the above integrated priority list (step 1402). By this group integration, the objective function is actually reduced by the value held by the integration priority. A specific example of the group integration process will be described with reference to FIGS.

  As a result of creating the integrated priority list in the initial group set illustrated in FIG. 15, it is assumed that the integrated priority of the work group A (1501) and the work group B (1502) is the highest. In this case, the server system 100 integrates the two groups.

  The work group A (1501) has a deadline of “2015/4/4 to 2015/4/8”, and as a result of the worker estimation process, the worker candidates are ranked from top to bottom by workers A, B, C, and D. It is E. Further, the work group B (1502) has a deadline of “2015/4/4 to 2015/4/5”, and as a result of the worker estimation processing, the worker candidates are in order from the top workers B, E, G, and A. , C.

FIG. 17 also shows the worker candidates of the above work groups A and B and the concept of group integration. Before the group integration, the worker candidate having the largest probability value is the assigned worker of the corresponding work, and the assigned worker of the work group A (1501) is the worker “A”, while the assigned work of the work group B (1502) is The member is a worker "B".

  When the two groups are integrated, the worker estimation results of the two groups are integrated to obtain the assigned workers of the combined groups AB. In this case, if the product of the probability values of the common worker candidates in the two groups is calculated and rearranged in descending order of the value, the worker “B” has a probability “0.15” and the worker “A” has a probability “0”. .025 ", the worker" E "has a probability" 0.003 ", and the worker" C "has a probability" 0.0015 ". Note that the worker G, who is a worker candidate for the group B, is not included in the group A and cannot take charge of the work for the group A. Therefore, the workers are excluded from the group A-B worker candidates. Similarly, the worker D, who is a worker candidate of the group A, is not included in the group B and cannot be in charge of the work of the group B. Therefore, the workers are excluded from the group A-B worker candidates. As a result of collating the worker candidates of the two groups, if there is no common worker, that is, no worker candidate that can be integrated, the two groups cannot be integrated.

The server system 100 performs a logical product of two groups regarding the correspondence deadline when the groups are integrated. In the example of FIG. 15, the response deadline “2015/4/4 to 2015/4/8” of the work group A (1501) and the response deadline “2015/4/4 to 2015/4 /” of the work group B (1502). By taking the logical product with “5”, the corresponding deadline of the work group AB (1503) after integration is “2015/4/4 to 2015/4/5”. As a result of taking the logical product of the correspondence deadlines, if there is no candidate date, the two groups cannot be integrated.
By carrying out group integration in this way, the final implementation date of the work group will be determined. While the implementation date is thus determined, the server system 100 searches the work shift information of the implementation date for the worker candidates of each work group from the work shift data 404 and the work shift template 405 of the database 1041, On the implementation day, determine whether the corresponding worker is available.

  When the corresponding work cannot be dealt with due to a year off or a difference in shift, even a worker candidate having the highest probability value cannot be assigned to the corresponding work. Therefore, the server system 100 decides an assigned worker by lowering the priority of such a worker. In addition, when not only the date but also the time is specified for each work, the order of movement and the route are calculated at the time of group integration so that the movement cost is minimized while complying with the time designation of each work.

  Since the server system 100 becomes a new work group by integrating the two groups as described above, the integration priority of the new work group after integration is calculated and reflected in the integration priority list (step 1403).

  Further, the server system 100 updates the integration priority of the work groups near the work group after the integration because the configuration of the work group has changed after the group integration (step 1404).

  The server system 100 repeats the above processing for all work groups until the integration priority is 0 or less (1405: True), that is, until the objective function does not become small due to the integration of the groups, thereby making a final work plan. It can be created (step 1405).

In this way, by calculating the integration priority for the combination of work groups and determining the work group to be integrated using the calculated integration priority, it is possible to reliably determine the work group that will reduce the cost. Further, by updating the integration priority of the work groups in the vicinity of the work group to be integrated, it is possible to accurately determine the influence of the integration on the vicinity. Further, by integrating the work groups, it is possible to efficiently obtain a work plan capable of significantly reducing the cost as a whole. Further, by limiting the search range to the spatial neighborhood, high-speed processing can be achieved.

--- Flow example 4 ---
Next, step 1107 in the flow example 1 will be described with reference to FIGS. 18, 21, 22, 25, and 26. The step 1107 is executed by the plan correction program 111 in the server system 100.

  It is assumed that the work plan is created by the work plan program 111 described above, and the created work plan is displayed on the map 1615 and the Gantt chart 1614 on the plan planning screen 1608. In this case, the planner can check the work plan on the client PC 300 and arbitrarily modify it.

  For example, when the planner replaces the work bar of the Gantt chart 1614, the plan correction program 112 of the server system 100 operates to dynamically update the display on the map 1615. On the other hand, when the planner corrects the icon on the map 1614, the plan correction program of the server system 100 operates to dynamically update the display of the Gantt chart 1614. The server system 100 interactively dynamically modifies and updates the work plans displayed on the Gantt chart 1614 and the map 1615 in this way.

  First, a process of dynamically updating the display on the map 1615 according to the correction of the Gantt chart 1614 will be described. FIG. 21 is a diagram showing an example of the flow of changing the work plan on the map 1615 in accordance with moving the bar of the Gantt chart 1614.

  Here, it is assumed that the planner operates the client PC 300 by dragging and dropping an arbitrary bar of the Gantt chart 1614 with a mouse or the like. The server system 100 senses this operation via the client PC 300 (step 1800).

  FIG. 22 shows a specific example of the correction on the Gantt chart 1614 by the operation of the planner. In this example, the bar indicating the work 198 is moved from the worker “CE001” who is the initially assigned worker to the worker “CE002”.

  Next, the server system 100 searches the work plan data 401 for the work plan data of the work corresponding to the bar operated by the planner and the work plan data of the same worker on the same day (step 1801).

  For example, the work plan data corresponding to the bar of the work 198 dragged in the above step 1800 and the work plan data of “2014/7/20” and the same worker “CE001” on the same day are illustrated in FIG. Let's say you search in a data table of data. In that case, the work plan regarding the work corresponding to the bar of the dragged work 198 is the data 1900. In addition, the work plan data of “” 2014/7/20 ”and the same worker“ CE001 ”on the same day is data 1901.

  Next, the server system 100 searches the work plan data 401 for the work data of the same day of the worker corresponding to the position where the bar is dropped, which is detected in the above step 1800 (step 1802).

In the data table of the work plan data illustrated in FIG. 24, when the work plan data of “2014/7/20” of the worker “CE002” corresponding to the above-mentioned drop position is searched, the data 1902 is obtained.

  Subsequently, the server system 100 sets the time zone corresponding to the drop position of the bar as the execution time of the corresponding work, and can set the worker corresponding to the drop position as the assigned worker of the work, on the same day, By judging from the work data of the same worker and information such as work shift, it is judged whether or not the bar can be actually dropped at the corresponding position (step 1803, step 1804).

  If the server system 100 determines that the bar can be dropped as a result of the above determination (step 1804: True), the server system 100 rewrites the work plan data to the time zone of the dropped position and the worker information (step 1805). ).

  For example, the server system 100 uses the work plan data 1902 on the same day “2014/7/20” of the worker “CE002” corresponding to the drop position to drop the dropped work “198”, the previous work “123”, and the rear work “123”. Using the address (latitude) and the address (longitude) of each work “211” of, the travel time of the work “123” and the work “198” and the travel time of the work “198” and the work “211” are calculated, It is determined whether the time zone of the work “198” after the drop can be physically moved.

  Further, the server system 100 adheres to whether or not the response deadline originally held by the work “198” is adhered to, and the work time indicated by the work shift according to the work shift data of the worker “CE002” at the drop destination. Determine if you are doing.

  If all the conditions in such a determination are satisfied, the server system 100 determines that the bar of the work “198” can be dropped (step 1804: True), and the allocation start time and the allocation end time of the work plan data 1900 are determined. Is rewritten to the drop destination time zone “12:30 to 13:30” and the worker ID is rewritten to “CE002”.

  On the other hand, as a result of the above determination, when it is determined that the bar cannot be dropped (step 1804: False), the server system 100 outputs an alert indicating that the drop is not possible to the client PC 300 (step 1806), and the processing ends. To do.

  After rewriting the data in step 1805, the server system 100 changes the work plan on the map 1615 based on the data rewritten in step 1805 (step 1807). The server system 100 sorts the work plan data of the workers “CE001” and “CE002” of “2014/7/20” including the rewritten data in ascending order by the allocation start time, and on the map 1615. Change the display of the work order of. Specifically, the work plan 1903 of the worker “CE001” and the work plan 1904 of the worker “CE002” before the change are changed to the work plan 1905 of the worker “CE001” and the work plan 1904 of the worker “CE002”. Change to work plan 1905.

  In the examples of FIGS. 22 to 24, the case where the bar in the Gantt chart 1614 is dragged and dropped across the workers has been described as an example, but the bar is moved only within the work plan of the same worker to change the work plan. You may carry out similarly when doing. Alternatively, the work plan may be changed over the days.

--- Flow example 5 ---
Next, contrary to the above-described flow example 4, when the planner moves the icon on the map 1615, the plan correction program 112 of the server system 100 operates and the Gantt chart 1
A process of dynamically updating the display of 614 will be described.

  FIG. 25 is a flowchart showing an example of processing for correcting the work plan by moving the icon on the map 1615. Here, the planner, in the client PC 300, selects the objects displayed on the map 1615 for the predetermined work plan (the icons corresponding to each work and the line segments connecting the icons according to the work execution order). It is assumed that the mouse is moved by a mouse operation or the like.

  On the other hand, the server system 100 senses a moving operation for such an object (step 2000). As a pattern of the moving operation detected by the server system 100, for example, two work icons are displayed between a linked body 2180 of icons related to a certain assigned worker and a linked body 2185 of AIK sounds related to another assigned worker. It is possible to envisage moving operations such as switching. The above-mentioned connected bodies 2180 and 2185 of the icons refer to the icons 2150 connected by the line segment 2160. Alternatively, it is possible to envisage a moving operation such as separating the icon of the predetermined work from the original linked body 2180 of the assigned workers and moving it into the linked body 2185 of the icons related to other assigned workers.

  FIG. 26 shows the concept of modifying the planned work plan by moving the icon 2150 on the map 1615. The example corresponding to the movement operation which exchanges the worker of two works is shown.

  In the map 2100 in FIG. 26, the work “222” is a part of the work plan of the worker “CE001”, and the work “188” is a part of the work plan of the worker “CE002”. The planner, for example, selects the two operations “222” and “188” on this map 2100 by mouse operation on the client PC 300, and then assigns them by right mouse operation such as right click. Suppose you have performed an operation to switch personnel. In this way, when the replacement operation of the assigned workers is executed, the work “222” becomes the work of the worker “CE002”, and the work “188” becomes the work of the worker “CE001”. The map after the server system 100 changes the display of the map 2100 according to the operation is the map 2101.

  The server system 100 changes the work plan data on the map 2100 to the work plan data corresponding to the work operated on the map 2100 and the work plan data of the same worker on the same day as the work plan data 401. (Step 2001).

  In addition, the server system 100 searches the work data 400 of the worker on the same day for the corresponding work after the operation such as changing the assignment of the worker assigned to the predetermined work as described above (step 2002). In this case, the server system 100 relates to the work plan changing operation executed on the map 2100 in step 2000 described above, in the work plan data data table of FIG. 28, the work plan data 2102 and the work “222” of the work “222”. The same day, the work plan data “2103” of the same worker, the work plan data “2104” of the work “188”, and the work plan data “2105” of the same worker on the same day as the work “188” will be searched. .

  Next, the server system 100 calculates the moving distance of the worker from the work data of the worker (obtained in step 2002) on the same day with respect to the replacement of the allocated worker or the change of the work to be allocated, and after the change. The work start time and end time are calculated, and it is determined whether or not the change is possible (step 2003, step 2004).

If the result of this determination is that it can be changed (step 2003: True), the server system 100 sets the work plan data 401, the allocation start time, and the allocation end time after the change.
(Step 2005).

  For example, when the work plan is changed from the map 2100 in FIG. 26 to the map 2101, the work “188”, which was the last work of the work group of the worker “” CE001 ”before the change, is changed to the work“ CE002 ”. Changed to the first task in the work group. Further, the work “222” that was the first work of the work group of the worker “CE002” before the change is changed to the last work of the work group of the worker “CE001”.

  Therefore, when such a work plan change is made, the server system 100 addresses (latitude) and address (longitude) of the work plan data 2103 of the worker “” CE001 ”and the work plan data 2105 of the worker“ CE002 ”. ), The moving distance and the moving time between the corresponding works are calculated, and the physically movable start time and end time between the work “222” and the work “188” are calculated.

  The server system 100 determines whether or not the calculated time slot indicated by the start time and the end time complies with the corresponding deadlines for the work “222” and the work “188”, and the worker “CE001” and the work. It is determined whether the time of the work shift of "CE002" in "2014/7/20" is adhered to.

  If all of the above conditions are satisfied in the above determination, the server system 100 determines that it is possible to correct the work “188” and the work “222” by replacing the assigned workers. Further, the server system 100 rewrites the allocation start time of the work plan data 2102 of the job “222” to “10:00” and the allocation end time to “11:00”. Further, the server system 100 rewrites the worker ID of the work “222” to “CE002”, rewrites the allocation start time of the work plan data 2104 of the work “188” to “14:00”, and the allocation end time to “15: 30 ", and the worker ID is rewritten to" CE001 ".

  On the other hand, as a result of the above determination, if the change is impossible (step 2003: False), the server system 100 outputs an alert indicating that the change is not possible to the client PC 300 (step 2006), and ends the process.

  After rewriting the data in step 2005 described above, the server system 100 changes the work plan of the Gantt chart 1614 based on the rewritten work plan data (step 2007), and ends the process.

  In this case, the server system 100 sorts the work plan data of the assigned workers “CE001” and “CE002” of “2014/7/20”, including the rewritten data, in ascending order by the assignment start time, and the data is sorted. The display of the Gantt chart 1614 is updated by using this. As a result, as shown in the Gantt chart of FIG. 27, the positions of the bars relating to the work “188” and the work “222” are switched, the bar of the work “188” is displayed as the work of the worker “CE001”, and the work “222” is further displayed. Is displayed as the work of the worker “CE002”.

  26 to 28 show an example of the process of exchanging the assigned workers of two works, the same can be performed when changing the assigned workers of the target work.

As described above, the plan correction program 112 enables the planner to confirm the work plan prepared by the server system 100 and arbitrarily correct the work plan. In addition, the work plans displayed on the Gantt chart 1614 and the map 1615 as described above are dynamically updated on the other side by an operation such as a correction for one, and the interface between the Gantt chart 1614 and the map 1615 is changed. The display of work plans can be dynamically modified and updated in both directions.

--- Example of display on mobile information terminal ---
Next, an example of a screen displayed on the display device 202 of the mobile information terminal 200 will be described. The server system 100 of the present embodiment distributes a planned work plan and work data to the mobile information terminals 200 owned by the respective workers. On the other hand, the worker refers to the work plan and work contents on the display device 202 of the portable information terminal 200, and carries out daily work. Further, such a worker operates the portable information terminal 200 at the end of the work, records the work result, and uploads the result to the server system 100. In this case, the server system 100 stores the work result uploaded from the mobile information terminal 200 in the work result data 402 of the database 1041.

  29 shows a work confirmation screen 2900 of the screens displayed on the display device 202 of the portable information terminal 2000, and FIG. 30 shows a work result input screen 3000.

  Of these, in the work confirmation screen 2900 of FIG. 29, a map 2200 is displayed on the left side of the screen, and the right side of the screen is configured to show the order of each work performed by the worker on the same day. Of course, it is assumed that the server system 100 appropriately configures and distributes screen data having such a screen configuration by setting a work plan in predetermined template data or the like.

  In addition, the mobile information terminal 200 displays the icon 2201 at a position based on the own position obtained from the position information acquisition device 203 on the map 2200 on the work confirmation screen 2900 described above. In addition, the mobile information terminal 200 specifies and displays a moving route from the position of the own device to the next work target icon 2202 on the map 2200 by using a predetermined route search program or the like.

  Regarding the completed work, the worker carrying the mobile information terminal 200 specifies the completion of the work on the predetermined interface (screen 3000 in FIG. 30) of the display device 202 of the mobile information terminal 200. I shall. The portable information terminal 200 changes the display color of the completed work and the unfinished work by changing the display color of the object of the specified work on the right side of the work confirmation screen 2900.

  On the work confirmation screen 2900 of FIG. 29, the display colors of the “work 1” object 2203 and the “work 2” object 2204 are dark, indicating that the corresponding work has already been completed. On the other hand, the object 2205 of the next work, “work 3”, has a white display color, indicating that it has not been completed. As the movement route between the icon 2202 and the icon 2201 at the own position is shown on the map 2200, the worker is moving toward the implementation place of “work 3”.

  In this way, the work plan created by the work plan program 111 in the server system 100 is distributed to the mobile information terminal 200 owned by each worker and appropriately used. The worker carrying the portable information terminal 200 can carry out the work while confirming his / her position, the work plan, and the progress status thereof.

  For example, when the above-mentioned worker arrives at the site of “work 3” and performs the corresponding work, for example, a selection operation for the object 2203 on the work confirmation screen 2900 is performed, and the work result input screen 3000 (FIG. 30). ) To the screen transition.

The work result input screen 3000 has a configuration in which a field 2206 for inputting work results is arranged on the right side of the screen. In this column 2206, there is provided an interface for inputting a start time 2207 for actually starting work, an end time 2208 for actually ending work, a person in charge 2209 as an assigned worker who performed work, a memo 2210, and the like. .

  It is assumed that the worker carries out the work, inputs the work result on each of the interfaces described above, and presses the OK button 2211. In this case, the mobile information terminal 200 transmits the work result to the server system 100 via the network 10. On the other hand, the server system 100 receives the work result from the portable information terminal 200 and stores it in the work result data 402. On the other hand, when the worker presses the CANCEL button 2212 on the work result input screen 3000, the input work result is discarded.

  The worker carries out the work based on the work plan thus determined one by one, and inputs the result on the portable information terminal 200. The work result input in the portable information terminal 200 in this way may be stored in the work result data 401 of the server system 100 via the network 10 as described above, or the worker who has finished the work and returned to the sales office. May connect the portable information terminal 200 to the client PC 300, perform a predetermined data registration operation, and execute the operation.

  The server system 100, which is the plan management system according to the present embodiment, is a work plan for periodic maintenance work, trouble handling, etc. for a large number of target device groups installed in a wide range such as an automatic teller machine installed in a bank. Can be applied to. However, the scope of application is not limited to this, and it can be applied to various fields such as a production line production plan, a delivery plan for the home delivery / delivery industry, a railway maintenance staff maintenance plan, and a station staff placement plan. Needless to say.

  The best mode for carrying out the present invention has been specifically described above, but the present invention is not limited to this, and various modifications can be made without departing from the gist thereof.

  According to the present embodiment as described above, it is possible to make a suitable and flexible work plan by assigning workers with good accuracy, regardless of the presence / absence of skill information of workers.

  At least the following matters will be made clear by the description in the present specification. That is, in the plan management system of the present embodiment, the storage device further stores information on the work shift of each worker, and the computing device, when specifying the worker candidate, the estimated suitability. Based on the priority order according to the height of the work, a predetermined number of worker candidates to be assigned to each work are specified, and when the work plan is generated, the information of each work and the priority order and work shift of the worker candidate are specified. Based on each of the above information, the work planning algorithm preferentially selects, from the workers of the work shifts that can be assigned within the corresponding deadline of the work indicated by the information of each work, the one with the higher priority. However, it is also possible to determine the order of execution between the works and the assigned workers so that the constraint condition of the response deadline for each work is satisfied.

  According to this, in addition to the work record, based on the actual work shift of each worker, the assigned worker who fulfills the deadline for each work is determined, and a highly accurate work plan according to the actual situation. Can be efficiently created. As a result, it is possible to make a suitable and flexible work plan by assigning workers with higher accuracy regardless of the presence or absence of skill information of workers.

In the plan management system of the present embodiment, the arithmetic unit generates a predetermined work pair to be executed as a series of works out of the works to be planned, and the same worker among the worker candidates of the work pair. The suitability information of the work pair is integrated according to a predetermined rule, the integrated suitability of the worker candidate in the work pair is specified, and the work pair is set to 1 based on the priority order according to the specified height of the integrated suitability. In the case of one work, a predetermined number of worker candidates assigned to the work may be specified.

  According to this, for example, regarding works that can be integrated in a series of works in neighboring areas, if there is a common worker candidate for each work, calculate the logical product of the compatibility values, etc. Then, it is possible to identify the worker candidate based on the integrated suitability that is the calculated value. This means that resources, that is, workers can be integrated between works and the works themselves can be integrated, and a more efficient work plan can be drafted as a whole.

  When generating the work pair, the computing device inputs, as input, information about each work that forms the work pair candidate with respect to each work pair candidate that is a combination of the works that are the planning targets, and determines a predetermined event. The value of the function may be calculated, and the work pair candidate having the best calculated value on the predetermined standard may be specified as the work pair to be generated.

  According to this, for example, with respect to works that can be integrated as a series of works performed in a neighboring area, a predetermined value such as the movement cost of the worker after the work integration is calculated, and the pair having the smallest calculated value is calculated. Can be specified as a working pair. This means that work integration is performed for work pairs that have a large cost reduction effect and the like, and a more efficient work plan can be drafted as a whole.

  In the plan management system of the present embodiment, the arithmetic device combines the one work that is a work pair that has performed the integration processing of the compatibility information with another work or one work based on another work pair. Further, regarding each further work pair candidate, the value of the predetermined function is calculated, and among the work pair candidates, the one having the best calculated value on the predetermined standard is specified as the work pair to be generated, and the specification is performed. It is also possible to further execute the integration of the compatibility information and the specific processing of the predetermined number of worker candidates regarding the performed work pair.

  According to this, it is possible to perform work integration in which cost reduction and the like are expected, in multiple stages, and it is possible to formulate a more efficient work plan as a whole.

  In the plan management system of the present embodiment, the computing device, when estimating the suitability, provides information about each work to be planned and work record information about each worker based on a quantification theory 2 class. It may be input to an algorithm to estimate the suitability of each worker for each work.

  According to this, it is possible to make the determination of the assigned workers efficient, and it is possible to make a suitable and flexible work plan by assigning the workers with higher accuracy regardless of the presence or absence of the skill information of the workers.

  In the plan management system of the present embodiment, the storage device further holds data of the generated work plan and map data of a predetermined area including a work place of each work in the work plan. The device uses the Gantt chart in which the objects of the corresponding work assigned to each assigned worker in the work plan are arranged according to the order of execution of the work, and the objects of the relevant work assigned to each assigned worker in the execution location. According to a process for displaying on the output device a map in which objects of line segments indicating the order of performing the work are arranged between each of the arranged objects according to the process, and in one of the Gantt chart or the map. When the input device accepts a change operation related to the work plan for an object to be operated, the Gantt chart Others may be one in which further executes a process of changing in accordance with the arrangement of the object corresponding in the other of the map to the change operation.

  According to this, the planner can easily understand the work plan generated by the plan management system, and the contents of the work plan include the order between works and the replacement of assigned workers. The change operation can be intuitively performed. As a result, regardless of the presence / absence of skill information of the workers, it is possible to perform suitable and more flexible work planning by assigning workers with good accuracy.

  In the plan management system of the present embodiment, when the computing device receives a change operation related to the work plan with an input device as an operation target for an object on either the Gantt chart or the map, the change operation is performed. Regarding the change in the order of execution of the relevant work and / or the change of the assigned worker, the travel time of the assigned worker is calculated based on the information of the place of implementation of the work, and the relevant travel time is related to the relevant work and the relevant work. It may be configured to further execute a process of determining whether or not there is a discrepancy in the order of performing the work, and determining whether or not the work plan can be changed by the changing operation according to the result of the determination.

  According to this, when the planner wants to make changes to the work plan generated by the plan management system, the validity is based on whether or not there is a discrepancy in the execution order of each work. It is possible to make an accurate determination. As a result, it is possible to make a more suitable and flexible work plan by assigning workers with good accuracy, regardless of the presence or absence of skill information of workers.

  In the plan management system of the present embodiment, the storage device further stores information on the work shift of each worker, and the arithmetic unit determines the order of performing the corresponding work by the change operation when determining the discrepancy. Regarding the change of at least one of the assigned worker and the assigned worker, based on the information on the work shift of the assigned worker of the work related to the change operation and the response deadline information indicated by the information of the relevant work, The work shift may further determine whether or not the work can be performed within the corresponding deadline, and whether or not the work plan can be changed by the changing operation is determined based on the result of each of the determinations.

  According to this, when the planner wants to make changes to the work plan generated by the plan management system, the validity of the change is determined by the work shift of the assigned worker and the corresponding work. It is possible to make a more accurate determination based on whether or not each constraint of the response deadline is satisfied. As a result, it is possible to make a more suitable and flexible work plan by assigning workers with good accuracy, regardless of the presence or absence of skill information of workers.

  In the plan management method of the present embodiment, the information processing system further stores, in the storage device, information on a work shift of each worker, and when the worker candidate is specified, the estimated suitability is set to be high. Based on the corresponding priority order, a predetermined number of worker candidates to be assigned to each work are specified, and when the work plan is generated, information on each work and each information on the priority and work shift of the worker candidate and Based on the above, by the work planning algorithm, the worker having the higher priority is preferentially selected among the workers of the work shift that can be assigned within the corresponding deadline of the work indicated by the information of each work, It is also possible to determine the order of execution between the works and the assigned workers so as to satisfy the constraint condition of the deadline for the works.

  In the plan management method of the present embodiment, the information processing system generates a predetermined work pair to be executed as a series of works out of the respective works to be planned, and the same work among the worker candidates of the work pair. The information on the suitability of the workers is integrated according to a predetermined rule, the integrated suitability of the worker candidates in the work pair is specified, and the work pair is selected based on the priority order according to the specified high degree of integrated suitability. When one work is set, a predetermined number of worker candidates assigned to the work may be specified.

In the plan management method of the present embodiment, the information processing system, when generating the work pair, regarding each work pair candidate in which the works to be planned are combined, information on each work that constitutes the work pair candidate May be input to calculate a value of a predetermined function relating to a predetermined event, and the work pair candidate having the best calculated value on a predetermined standard may be specified as the generated work pair.

  In the plan management method of the present embodiment, the information processing system performs the one work as a work pair that has performed the integration processing of the compatibility information and another work or one work based on another work pair. For each further combined work pair candidate, the value of the predetermined function is calculated, and the work pair candidate having the best calculated value on a predetermined standard is specified as the work pair to be generated. The integration of the compatibility information and the specific processing of the predetermined number of worker candidates may be further executed for the specified work pair.

  In the plan management method according to the present embodiment, the information processing system, based on the quantification theory 2 class, calculates the information of each work to be planned and the work record information of each worker when estimating the suitability. It may be input into a predetermined algorithm to estimate the suitability of each worker for each work.

  In the plan management method of the present embodiment, the information processing system further holds, in the storage device, the generated work plan data and map data of a predetermined area including a work place of each work in the work plan. , Gantt chart that arranges the objects of the corresponding work assigned to each assigned worker in the work plan according to the execution order of the work, and the objects of the relevant work assigned to each assigned worker according to the place of implementation A process of displaying an object on which a line segment object indicating a work order is arranged between each of the arranged objects on the output device, and an object in one of the Gantt chart or the map. When the input device accepts a change operation related to the work plan, which is the operation target, the Gantt chart or It may be a further and a process of change in accordance with the arrangement of the object corresponding in the other of the map to the change operation.

  In the plan management method according to the present embodiment, when the information processing system accepts a change operation related to the work plan with an input device as an operation target for an object on either the Gantt chart or the map, the change is performed. Regarding the change of the order of execution of the corresponding work and / or the change of the assigned worker due to the operation, the moving time of the assigned worker is calculated based on the information of the place where the corresponding work is performed, and the moving time is related to the corresponding work and the relevant work. It is also possible to determine whether or not there is any discrepancy in the order of execution of the other work, and further execute a process of determining whether or not the work plan can be changed by the change operation based on the result of the determination.

  In the plan management method of the present embodiment, the information processing system further stores information on work shifts of each worker in the storage device, and when determining the discrepancy, the order of execution and assignment of the corresponding work by the change operation. Regarding at least one of the changes of the worker, based on the work shift information of the work worker assigned to the change operation and the response deadline information indicated by the work information, the work shift of the work worker assigned to the work. Then, it may be further determined whether or not the work can be performed within the corresponding deadline, and whether or not the work plan can be changed by the changing operation can be determined based on the results of the respective determinations.

10 network 100 server system (plan management system)
101 CPU
102 network interface 103 I / O
104 storage device 1041 database 105 input device 106 display device 107 memory 108 data bus 110 worker estimation program 111 work planning program 112 plan correction program 200 mobile information terminal 201 wireless communication device 202 display device 203 position information acquisition device 204 imaging device 205 CPU
206 input device 207 memory 208 GPS satellite 300 client PC
301 CPU
302 network interface 303 I / O
304 memory 305 input device 306 display device 307 data bus 400 work data 401 work plan data 402 work result data 403 worker estimation result data 404 work shift data 405 work shift template data 406 map data

Claims (12)

A storage device that stores information about a predetermined work, work record information about each worker engaged in the work, and work shift information about each worker,
Based on the information of each work to be planned and the work record information of each worker, the suitability of each worker for each work is estimated by a predetermined algorithm, and the estimated suitability is increased. According to the above, a worker candidate to be assigned to each work is specified,
A work plan, which is a set of work groups that is a group of the worker candidates of each work, is created by repeatedly determining and integrating a work pair that is a pair of the work groups to be integrated from the set of work groups. With a computing device,
The arithmetic unit is
When determining the work pairs to be repeatedly integrated from the set of work groups,
The movement cost of all the worker candidates who perform the work to be assigned to the work groups forming the set of the work groups includes at least the sum of all the work groups as a variable, and relates to the set of the work groups. Calculate the value of the objective function,
By repeatedly specifying a work pair that maximizes the decrease amount of the value of the objective function after integration with respect to the value of the objective function before integration, the work pair to be integrated is determined.
When integrating the determined pairs of work groups,
Information on the work shift is assigned to a worker having a work shift that can be assigned within the deadline for the work of the work group to be integrated, which indicates the worker candidate to be assigned to each work of the work group to be integrated. together identified by reference to the, by preferentially selecting the compatible high worker to each work of the working group for the integration it is to specify,
A plan management system characterized by that. The arithmetic unit is
The plan subject to generate a predetermined said work pair to perform a series of operations among the operations, and the suitability of information of the same worker among workers candidates of the working pairs integrate a predetermined rule, The integrated suitability of the worker candidates in the work pair is specified, and based on the priority order according to the specified high degree of integrated suitability, when the work pair is regarded as one work, a predetermined number of assigned works is assigned. To identify potential workers,
The plan management system according to claim 1, wherein: The arithmetic unit is
In estimating the suitability, the information of each work to be planned and the work performance information of each worker are input to a predetermined algorithm based on the quantification theory 2 class, and each work of each worker is performed. To estimate the suitability for
The plan management system according to claim 1, wherein: The storage device is
The data of the generated work plan and map data of a predetermined area including the execution place of each work in the work plan are further held,
The arithmetic unit is
Gantt chart in which the objects of the corresponding work assigned to each assigned worker in the work plan are arranged according to the execution order of the work, and the objects of the relevant work assigned to each assigned worker are arranged according to the implementation place And a process of displaying on the output device a map in which objects of line segments showing the order of performing the work are arranged between each of the arranged objects,
When an input device accepts a change operation related to the work plan for an object in one of the Gantt chart or the map as an operation target, the placement of the corresponding object in the other of the Gantt chart or the map is performed. Processing for changing according to the changing operation,
The plan management system according to claim 1, further comprising: The arithmetic unit is
When an input device accepts a change operation related to the work plan for an object on one of the Gantt chart or the map as an operation target, at least one of the execution order of the work and the assigned worker by the change operation. Regarding the change of, the travel time of the assigned worker is calculated based on the information of the place where the work is performed, and it is determined whether the travel time will cause a discrepancy in the order in which the work and other work related to the work are performed, and the determination is made. According to the result of the above, the processing for determining whether or not the work plan can be changed by the change operation is further executed.
The plan management system according to claim 4 , wherein: The storage device is
It further stores the work shift information of each worker,
The arithmetic unit is
In the determination of the discrepancy, regarding the change of at least one of the execution order of the work and the assigned worker by the change operation, the information of the work shift of the assigned worker of the work related to the change operation and the information of the work are shown. Based on the information of the deadline, it is further determined whether or not the work can be done within the deadline of the work by the work shift of the assigned worker of the work, and the work plan is changed by the changing operation according to the result of each judgment. Is to decide whether or not
The plan management system according to claim 5 , wherein: An information processing system including a storage device that stores information on a predetermined work, work record information of each worker engaged in the work, and work shift information of each worker,
Based on the information of each work to be planned and the work record information of each worker, the suitability of each worker for each work is estimated by a predetermined algorithm, and the estimated suitability is increased. According to the above, a worker candidate to be assigned to each work is specified, and a work plan, which is a set of work groups that is a group of the worker candidates of each work , is integrated into the work group. Created by repeating the process of determining and integrating from the set of
When determining the work pairs to be repeatedly integrated from the set of work groups,
The movement cost of all the worker candidates who perform the work to be assigned to the work groups forming the set of the work groups includes at least the sum of all the work groups as a variable, which relates to the set of the work groups. Calculate the value of the objective function,
By repeatedly specifying a work pair that maximizes the decrease amount of the value of the objective function after integration with respect to the value of the objective function before integration, the work pair to be integrated is determined.
When integrating the determined pairs of work groups,
Information on the work shift is assigned to a worker having a work shift that can be assigned within the deadline for the work of the work group to be integrated, which indicates the worker candidate to be assigned to each work of the work group to be integrated. together identified by reference to the, by preferentially selecting the compatible high worker to each work of the working group for the integration it is to specify,
A plan management method characterized by the above. The information processing system,
The plan subject to generate a predetermined said work pair to perform a series of operations among the operations, and the suitability of information of the same worker among workers candidates of the working pairs integrate a predetermined rule, The integrated suitability of the worker candidates in the work pair is specified, and based on the priority order according to the specified high degree of integrated suitability, when the work pair is regarded as one work, a predetermined number of assigned works is assigned. Identify potential workers,
The plan management method according to claim 7 , wherein: The information processing system,
In estimating the suitability, the information of each work to be planned and the work performance information of each worker are input to a predetermined algorithm based on the quantification theory 2 class, and each work of each worker is performed. Estimating suitability for,
The plan management method according to claim 7 , wherein: The information processing system,
In the storage device, further holds the data of the generated work plan and map data of a predetermined area including the execution place of each work in the work plan,
Gantt chart in which the objects of the corresponding work assigned to each assigned worker in the work plan are arranged according to the order of execution of the work, and the objects of the relevant work assigned to each assigned worker are arranged according to the implementation place And a process of displaying on the output device a map in which objects of line segments showing the order of performing the work are arranged between each of the arranged objects,
When an input device accepts a change operation related to the work plan for an object in one of the Gantt chart or the map as an operation target, the placement of the corresponding object in the other of the Gantt chart or the map is performed. Processing for changing according to the changing operation,
8. The plan management method according to claim 7 , further comprising: The information processing system,
When an input device accepts a change operation related to the work plan for an object on one of the Gantt chart or the map as an operation target, at least one of the execution order of the work and the assigned worker by the change operation. Regarding the change of, the travel time of the assigned worker is calculated based on the information of the place where the work is performed, and it is determined whether the travel time will cause a discrepancy in the order in which the work and other work related to the work are performed, and the determination is made. Further executing a process of determining whether or not the work plan can be changed by the changing operation according to the result of
The plan management method according to claim 10 , wherein: The information processing system,
In the storage device, further store the information of the work shift of each worker,
In the determination of the discrepancy, regarding the change of at least one of the execution order of the work and the assigned worker by the change operation, the information of the work shift of the assigned worker of the work related to the change operation and the information of the work are shown. Based on the information of the deadline, it is further determined whether or not the work can be done within the deadline of the work by the work shift of the assigned worker of the work, and the work plan is changed by the changing operation according to the result of each judgment. Decide whether or not
The plan management method according to claim 11 , wherein: