WO2023242942A1 - Schedule execution assistance device, method, and program - Google Patents

Schedule execution assistance device, method, and program Download PDF

Info

Publication number
WO2023242942A1
WO2023242942A1 PCT/JP2022/023748 JP2022023748W WO2023242942A1 WO 2023242942 A1 WO2023242942 A1 WO 2023242942A1 JP 2022023748 W JP2022023748 W JP 2022023748W WO 2023242942 A1 WO2023242942 A1 WO 2023242942A1
Authority
WO
WIPO (PCT)
Prior art keywords
tasks
degree
evaluation value
processing unit
schedule
Prior art date
Application number
PCT/JP2022/023748
Other languages
French (fr)
Japanese (ja)
Inventor
寛 吉田
朋子 柴田
昌史 坂本
諭 高津
Original Assignee
日本電信電話株式会社
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 日本電信電話株式会社 filed Critical 日本電信電話株式会社
Priority to PCT/JP2022/023748 priority Critical patent/WO2023242942A1/en
Publication of WO2023242942A1 publication Critical patent/WO2023242942A1/en

Links

Images

Classifications

    • GPHYSICS
    • G05CONTROLLING; REGULATING
    • G05BCONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B19/00Programme-control systems
    • G05B19/02Programme-control systems electric
    • G05B19/418Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM]
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling

Definitions

  • One aspect of the present invention relates to a schedule execution support device, method, and program that support the execution of schedules used, for example, in the development process of products and systems.
  • Patent Document 1 states that in the development process of a network management system, etc., how to allocate multiple personnel to multiple tasks with prior constraints is determined by considering the content of each task and the difference in ability of each person. A technique for scheduling is described. By using this technology, it is expected that the entire development process period and the number of workers will be minimized.
  • Patent Document 1 since the scheduling technology described in Patent Document 1 creates a schedule in a fixed and deterministic manner before the development work, for example, a work delay may occur in one of the tasks while the schedule is being executed. Even if we try to absorb the impact of this in the operations on the critical path, it is not easy to deal with it.
  • This invention was made in view of the above circumstances, and aims to provide a technology that enables adaptive and effective shortening of the process period when it becomes necessary to shorten the process period during schedule execution. It is something to do.
  • one aspect of the schedule execution support device or support method provides a degree of dispersion of required work times based on past work results of a plurality of personnel for each of a plurality of tasks constituting a schedule.
  • calculate a second evaluation value representing the degree of dispersion of the predicted value of the work required time among the plurality of personnel Based on the first evaluation value and the second evaluation value, the degree of reaction to remuneration is estimated for each of the plurality of tasks.
  • information representing the priority level of remuneration for the plurality of target operations constituting the critical path identified from the schedule is generated, and information representing the generated priority level is included. It is designed to output support information.
  • the present invention for example, when it is necessary to shorten the time required for a target task on the critical path, priority is given to the task that is highly responsive to rewards among the target tasks on the critical path. It will be possible to give rewards accordingly. As a result, it is possible to effectively shorten the time required for the target operations on the critical path, and thereby, for example, without having to allocate additional personnel, or with the additional allocation being kept to a minimum, the entire schedule can be reduced. It is possible to shorten the time required for this work. Furthermore, the effect of reducing work time relative to the amount of remuneration can be increased.
  • FIG. 1 is a block diagram showing an example of the hardware configuration of a schedule execution support device according to an embodiment of the present invention.
  • FIG. 2 is a block diagram showing an example of the software configuration of a schedule execution support device according to an embodiment of the present invention.
  • FIG. 3 is a flowchart showing an example of the processing procedure and processing contents of the schedule execution support process executed by the control unit of the schedule execution support apparatus shown in FIG.
  • FIG. 4 is a diagram illustrating an example of the dispersion of the required time of workers in tasks with small dispersion.
  • FIG. 5 is a diagram illustrating an example of the variance of the required time of workers in tasks with large variance.
  • FIG. 1 is a block diagram showing an example of the hardware configuration of a schedule execution support device according to an embodiment of the present invention.
  • FIG. 2 is a block diagram showing an example of the software configuration of a schedule execution support device according to an embodiment of the present invention.
  • FIG. 3 is a flowchart showing an example of the processing procedure and processing contents of
  • FIG. 6 is a diagram illustrating an example of a required time volatility coefficient representing how much the required time varies for each job (standard deviation of rate of change).
  • FIG. 7 is a diagram showing an example of a critical path extracted from work assignment information.
  • FIG. 8 is a diagram showing an example of the required time volatility coefficient, work commodity coefficient, and reward reaction coefficient calculated for each work on the critical path shown in FIG. 7.
  • the degree of response to compensation for each task is estimated. Specifically, for each task, an evaluation value of the degree of dispersion of the required time based on the past work performance of workers and an evaluation value of the degree of dispersion of the predicted time required among workers are calculated, and each of the obtained values is calculated. The degree of response to compensation is calculated for each task based on the evaluation value. Then, based on the above calculation results, information representing the priority level of remuneration for each task on the critical path is generated, and this information is output to, for example, the administrator.
  • FIGS. 1 and 2 are block diagrams showing an example of the hardware configuration and software configuration of a schedule execution support device, respectively, according to an embodiment of the present invention.
  • the schedule execution support device SV is, for example, a personal computer used by an administrator who manages schedules related to system development or product development. Note that the schedule execution support device SV is not limited to a personal computer, but may be a server computer located on a local network such as a LAN (Local Area Network), on the Web, or on a cloud.
  • LAN Local Area Network
  • the schedule execution support device SV includes a control unit 1 using a hardware processor such as a central processing unit (CPU), and a storage unit including a program storage unit 2 and a data storage unit 3 for the control unit 1.
  • the unit and an input/output interface (hereinafter referred to as I/F) section 4 are connected via a bus 5.
  • the input device 51 and an output device 52 are connected to the input/output I/F section 4.
  • the input device 51 includes, for example, a keyboard, a mouse, and operation buttons.
  • the input device 51 is used by the administrator to input various information necessary for receiving support regarding execution of the development schedule to be managed.
  • the output device 52 includes, for example, a display, and is used to display various information input by the administrator and support information generated by the control unit 1. Note that the output device 52 may include a printer, an external storage medium, and the like.
  • the input/output I/F unit 4 may be equipped with a communication interface function for transmitting and receiving information data to and from other information processing devices such as terminal devices and server devices via a network.
  • the program storage unit 2 is configured by combining, for example, a non-volatile memory such as an SSD (Solid State Drive) that can be written to and read from at any time as a storage medium, and a non-volatile memory such as a ROM (Read Only Memory).
  • a non-volatile memory such as an SSD (Solid State Drive) that can be written to and read from at any time as a storage medium
  • a non-volatile memory such as a ROM (Read Only Memory).
  • middleware such as an OS (Operating System)
  • application programs necessary for executing various control processes according to one embodiment are stored. Note that hereinafter, the OS and each application program will be collectively referred to as a program.
  • the data storage unit 3 is, for example, a combination of a non-volatile memory such as an SSD that can be written to and read from at any time as a storage medium, and a volatile memory such as a RAM (Random Access Memory), and is an embodiment of the present invention.
  • a prediction information storage unit 31 a performance information storage unit 32, a reward reaction coefficient storage unit 33, a work assignment information storage unit 34, and a critical path information storage unit 35 are used. We are prepared.
  • the predicted information storage unit 31 is used to store the input predicted values of the required time for each task for each worker.
  • the performance information storage unit 32 is used to store input performance values of the required time for each task for each worker.
  • the reward reaction coefficient storage unit 33 is used to store the reward reaction coefficient for each job, which is calculated by the control unit 1.
  • the task assignment information storage unit 34 is used to store input task assignment information in the development schedule.
  • the critical path information storage unit 35 is used to store information generated by the control unit 1 and representing the critical path in the development schedule.
  • the control unit 1 includes a prediction information acquisition processing unit 11, a business commodity coefficient calculation processing unit 12, a performance information acquisition processing unit 13, and a required time volatility coefficient calculation processing unit 11 as processing functions used to implement an embodiment of the present invention.
  • processing units 11 to 19 are all realized by causing the hardware processor of the control unit 1 to execute an application program stored in the program storage unit 2.
  • processing units 11 to 19 may be realized using hardware such as LSI (Large Scale Integration) or ASIC (Application Specific Integrated Circuit).
  • the prediction information acquisition processing unit 11 acquires, via the input/output I/F unit 4, a prediction table of the time required for each task for each worker input by the administrator through the input device 6, and uses the acquired prediction table to predict the time required for each task.
  • the information is stored in the information storage section 31.
  • the above table for predicting the time required for each task for each worker is a table showing the predicted time required for each task, set by the administrator based on the skills and past performance of each worker. .
  • the business commodity coefficient calculation processing unit 12 calculates the business commodity coefficient based on the prediction table of required time for each job for each worker stored in the prediction information storage unit 31.
  • the work commodity coefficient is calculated by calculating the variance of the predicted time required for each job for each worker for all jobs, and then calculating the deviation value for each job based on the calculated variance.
  • the performance information acquisition processing unit 13 acquires the past required time performance table for each task for each worker inputted by the administrator through the input device 6 via the input/output I/F unit 4, and uses the acquired performance table. is stored in the performance information storage section 32.
  • the above-mentioned table of results of required time for each task for each worker is a table showing the actual values of the work time for each task for each worker based on the execution results of past work schedules.
  • the required time volatility coefficient calculation processing unit 14 calculates the required time volatility coefficient for each job based on the required time performance table for each job of each worker stored in the performance information storage unit 32.
  • the required time volatility coefficient is calculated by calculating the variance value of the actual measured value of the required time for each job for each worker for all jobs, and then calculating the deviation value for each job based on the calculated variance value.
  • the remuneration reaction coefficient calculation processing unit 15 calculates, for each job, the business commodity coefficient calculated by the business commodity coefficient calculation processing unit 12 and the required time volatility coefficient calculated by the time required volatility coefficient calculation processing unit 14. Take the average value of , and use that average value as the remuneration response coefficient for each task. Then, this reward reaction coefficient is stored in the reward reaction coefficient storage unit 33 in association with the identification information of the job.
  • the business assignment information acquisition processing unit 16 acquires the business assignment information input by the administrator using the input device 6 via the input/output I/F unit 4, and stores the acquired business assignment information in the business assignment information storage unit 34. do.
  • the task assignment information is information representing the result of worker assignment to each task when the management schedule is created.
  • the critical path information generation processing unit 17 identifies a critical path from the business assignment information stored in the business assignment information storage unit 34 and stores information representing the identified critical path in the critical path information storage unit 35.
  • the additional reward priority list generation processing unit 18 reads the reward reaction coefficients from the reward reaction coefficient storage unit 33 for each job constituting the critical path stored in the critical path information storage unit 35, and uses the read reward reaction coefficients.
  • An additional reward priority list is generated by sorting the tasks that make up the critical path in descending order of their values.
  • the support information output processing unit 19 generates support information including the additional remuneration priority list generated by the additional remuneration priority list generation processing unit 18, and outputs the generated support information from the input/output I/F unit 4 to an output device. Output to 7.
  • FIG. 3 is a flowchart showing an example of the processing procedure and processing contents of the support processing executed by the control unit 1 of the schedule execution support device SV.
  • (1) Acquisition of forecast information For example, before executing a development schedule, the administrator uses the skills and past performance of each worker as a reference to estimate the estimated time required for each task that makes up the development schedule. seek. Then, following the input request, a worker task-specific time required prediction table representing the results is inputted from the input device 6.
  • control unit 1 of the schedule execution support device SV monitors the input request for prediction information in step S10 in the standby state.
  • the time required prediction table for each worker job is sent to the input/output I/F unit 4.
  • the acquired time-required-time prediction table for each worker job is stored in the prediction information storage unit 31.
  • the above-mentioned processing for obtaining the time required prediction table for each worker job is performed by downloading, for example, a time required prediction table for each worker job stored in advance in a schedule execution server (not shown), etc. via a network. It's okay to be hurt.
  • control unit 1 of the schedule execution support device SV monitors the input request for performance information in step S12 in the standby state.
  • the time required performance table for each worker job is sent to the input/output I/F unit 4.
  • the obtained time required time record table for each worker job is stored in the record information storage unit 32.
  • the acquisition process of the time required record table for each worker job may also be performed by downloading it via a network such as a schedule execution server.
  • control unit 1 of the schedule execution support device SV monitors the input request for the task assignment in step S15 in the standby state.
  • the task assignment information is acquired via the input/output I/F section 4 in step S15 under the control of the task assignment information acquisition processing section 16.
  • the obtained task assignment information is stored in the task assignment information storage section 34.
  • control unit 1 of the schedule execution support device SV monitors the input of the support request in step S16 in the standby state, and if the support request is input in this state, the time reduction of the process is performed.
  • the support processing for this is executed as follows.
  • the work commodity coefficient calculation processing unit 12 first reads the task-specific time required prediction table for each worker from the prediction information storage unit 31. Then, the task commodity coefficient for each task is calculated based on the read time prediction table for each task for each worker. This work commodity coefficient is calculated by calculating the variance of the predicted time required for each job for each worker for all jobs, and then calculating the deviation value for each job based on the calculated variance. be exposed.
  • the control unit 1 of the schedule execution support device SV uses the required time volatility coefficient calculation processing unit 14 to retrieve the required time performance record for each task from the performance information storage unit 32. Load. Then, the volatility coefficient of the required time for each task is calculated based on the read table of required time results for each task for each worker. This required time volatility coefficient is calculated by calculating the variance value of the actual value of the required time for each job for each worker for all jobs, and then calculating the deviation value for each job based on the calculated variance value. It will be done.
  • the standard deviation of the time required for each task is the positive value obtained by summing the squared difference between the value of the time required as the target data and its average, and then dividing it by the total number of target data. It can be calculated as the square root of
  • the standard deviation ( ⁇ ) is a small value of 7.5 minutes.
  • the standard deviation ( ⁇ ) is a large value of 17.1 minutes.
  • the relationship between the standard deviation calculated for each task and the frequency is shown in FIG. 6, for example, and from this, the deviation value, that is, the required time volatility coefficient, for each of tasks A and B can be determined.
  • the deviation value (required time volatility coefficient) of job A is "30"
  • the deviation value (required time volatility coefficient) of job B is "70".
  • step S17 the control unit 1 of the schedule execution support device SV calculates the above-mentioned business commodity coefficient calculation processing unit for each job under the control of the reward reaction coefficient calculation processing unit 15. 12 and the required time volatility coefficient calculated by the required time volatility coefficient calculation processing section 14. Then, the reward reaction coefficient calculation processing unit 15 stores the calculated average value in the reward reaction coefficient storage unit 33 as the reward reaction coefficient for each task.
  • step S18 the control unit 1 of the schedule execution support device SV generates job assignment information from the job assignment information storage unit 34 under the control of the critical path information generation processing unit 17. Read and identify the critical path based on this task assignment information. Then, the critical path information generation processing unit 17 stores information representing the identified critical path in the critical path information storage unit 35.
  • FIG. 7 shows an example of the identified critical path.
  • the critical path CP is expressed as process route information indicating that the processes of job A, job B, job D, and job F are executed in order.
  • FIG. 8 shows an example of the required time volatility coefficient, the business commodity coefficient, and the reward reaction coefficient calculated for each of the jobs A, B, D, and F on the critical path CP.
  • step S19 the control unit 1 of the schedule execution support device SV selects the critical path information from the critical path information storage unit 35 under the control of the additional reward priority list generation processing unit 18. Load path information. Then, the additional reward priority list generation processing unit 18 reads the reward reaction coefficients from the reward reaction coefficient storage unit 33 for each of the jobs A, B, D, and F that constitute the read critical path. Then, by rearranging the tasks A, B, D, and F on the critical path CP in descending order of the reward reaction coefficient, an additional reward priority list is generated.
  • step S20 the control unit 1 of the schedule execution support device SV outputs the information generated by the additional reward priority list generation processing unit 18 under the control of the support information output processing unit 19.
  • additional reward priority list In addition to the additional reward priority list, support information including, for example, a corresponding message based on the above list is generated. Then, the generated support information is outputted from the input/output I/F section 4 to the output device 7.
  • the above support information is displayed on the output device 7.
  • the support information may be printed out on the output device 7, or may be displayed or printed out on another terminal after being stored in a storage medium.
  • the manager Based on the presented support information, the manager recognizes the task with the highest reward response coefficient among the tasks A, B, D, and F on the critical path CP. Then, additional compensation is given to the worker who is in charge of this work.
  • the recipients of additional compensation are not limited to the worker who is in charge of the task with the highest reward response coefficient, but are also given to all workers who are in charge of tasks A, B, D, and F on the critical path CP.
  • a plurality of workers may be selected from among them.
  • the remuneration amount may be differentiated so that workers in charge of tasks with higher priority receive higher remuneration. It may be given. By doing so, it is possible to obtain a high time-saving effect while suppressing the total amount of additional reward to be given.
  • the types of remuneration are assumed to include virtual currency, points, products, personnel evaluation values, etc., and can be arbitrarily set depending on the type of work, employment form and status of the worker, etc.
  • the predicted value of the required time for each task for each worker and the actual value of the required time for each task for each worker based on past schedule execution results are acquired, and the Obtain work assignment information corresponding to the development schedule.
  • the predicted value of the time required for each worker task and the actual value of the time required for each worker task mentioned above are calculated, and the remuneration response coefficient for each job is calculated based on the calculated coefficients.
  • an additional reward priority list is generated in which each task on the critical path identified from the task assignment information is arranged in descending order of the reward reaction coefficient, and support information including this list is output.
  • the required time volatility coefficient, job commodity coefficient, and reward response are calculated only for each job on the critical path identified from the job assignment information.
  • a series of processing is performed to calculate the coefficients. Therefore, the processing load on the control unit 1 can be reduced compared to the case where the required time volatility coefficient, work commodity coefficient, and reward allocation coefficient are calculated for all the work on the development schedule.
  • prediction information, performance information, and task assignment information are acquired in advance and stored in the storage units 31, 32, and 34, respectively.
  • only the necessary information may be acquired from the schedule execution server or the like when it becomes necessary to provide additional remuneration. In this way, it becomes possible to save the storage capacity of the storage unit 3 of the schedule execution support device SV.
  • the present invention is not limited to the above-described embodiments as they are, but can be embodied by modifying the constituent elements at the implementation stage without departing from the spirit of the invention.
  • various inventions can be formed by appropriately combining the plurality of components disclosed in the above embodiments. For example, some components may be deleted from all the components shown in the embodiments. Furthermore, components from different embodiments may be combined as appropriate.

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Human Resources & Organizations (AREA)
  • Quality & Reliability (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Educational Administration (AREA)
  • Development Economics (AREA)
  • Automation & Control Theory (AREA)
  • Game Theory and Decision Science (AREA)
  • Manufacturing & Machinery (AREA)
  • General Engineering & Computer Science (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

In one aspect of this invention, a first evaluation value representing a degree of dispersion of required work time based on past work results of multiple personnel is calculated for each of the multiple tasks that make up a schedule, a second evaluation value representing a degree of dispersion of predicted values of required work time among the multiple personnel is calculated for each of the multiple tasks, and a degree of response to remuneration is estimated for each of the multiple tasks on the basis of the calculated first and second evaluation values. The result of estimating the degree of response is used to generate information indicating a priority level of remuneration for multiple target tasks constituting a critical path identified from the schedule, and output assistance information including information representing the generated priority level.

Description

スケジュール実行支援装置、方法およびプログラムSchedule execution support device, method and program
 この発明の一態様は、例えば物やシステムの開発工程で用いられるスケジュールの実行を支援するスケジュール実行支援装置、方法およびプログラムに関する。 One aspect of the present invention relates to a schedule execution support device, method, and program that support the execution of schedules used, for example, in the development process of products and systems.
 近年、物やシステムの開発工程で用いられるスケジューリング技術が注目されている。例えば、特許文献1には、ネットワーク管理システム等の開発工程において、先行制約がある複数の業務に対し複数の人員をどのように割り当てるかを、各業務の内容と各人員の能力差を考慮してスケジューリングする技術が記載されている。この技術を使用することで、開発の全工程期間の最小化と作業人数の最小化が期待できる。 In recent years, scheduling technology used in the development process of products and systems has attracted attention. For example, Patent Document 1 states that in the development process of a network management system, etc., how to allocate multiple personnel to multiple tasks with prior constraints is determined by considering the content of each task and the difference in ability of each person. A technique for scheduling is described. By using this technology, it is expected that the entire development process period and the number of workers will be minimized.
日本国特開2017-211921号公報Japanese Patent Application Publication No. 2017-211921
 ところが、特許文献1に記載されたスケジューリング技術は、開発作業の前に固定的かつ決定論的にスケジュールを作成するものであるため、例えばスケジュールの実行中にいずれかの業務において作業遅延が発生し、その影響をクリティカルパス上の業務において吸収しようとしても、対応が容易ではない。 However, since the scheduling technology described in Patent Document 1 creates a schedule in a fixed and deterministic manner before the development work, for example, a work delay may occur in one of the tasks while the schedule is being executed. Even if we try to absorb the impact of this in the operations on the critical path, it is not easy to deal with it.
 この発明は上記事情に着目してなされたもので、スケジュールの実行中に工程期間を短縮する必要が生じた場合に、適応的かつ効果的に工程期間の短縮を可能にする技術を提供しようとするものである。 This invention was made in view of the above circumstances, and aims to provide a technology that enables adaptive and effective shortening of the process period when it becomes necessary to shorten the process period during schedule execution. It is something to do.
 上記課題を解決するためにこの発明に係るスケジュール実行支援装置または支援方法の一態様は、スケジュールを構成する複数の業務の各々について、複数の人員の過去の作業実績に基づく作業所要時間の分散度合いを表す第1の評価値を算出すると共に、前記複数の業務の各々について、前記複数の人員間の作業所要時間の予測値の分散度合いを表す第2の評価値を算出し、算出した前記第1の評価値および前記第2の評価値に基づいて、前記複数の業務の各々について報酬に対する反応度合いを推定する。そして、前記反応度合いの推定結果に基づいて、前記スケジュールから特定されるクリティカルパスを構成する複数の対象業務に対する報酬付与の優先度合いを表す情報を生成し、生成した前記優先度合いを表す情報を含む支援情報を出力するようにしたものである。 In order to solve the above problems, one aspect of the schedule execution support device or support method according to the present invention provides a degree of dispersion of required work times based on past work results of a plurality of personnel for each of a plurality of tasks constituting a schedule. At the same time, for each of the plurality of tasks, calculate a second evaluation value representing the degree of dispersion of the predicted value of the work required time among the plurality of personnel, and Based on the first evaluation value and the second evaluation value, the degree of reaction to remuneration is estimated for each of the plurality of tasks. Then, based on the estimation result of the degree of reaction, information representing the priority level of remuneration for the plurality of target operations constituting the critical path identified from the schedule is generated, and information representing the generated priority level is included. It is designed to output support information.
 この発明の一態様によれば、例えばクリティカルパス上の対象業務の作業所要時間を短縮する必要が生じた場合に、上記クリティカルパス上の各対象業務のうち報酬に対する反応度合いが高い業務に対し優先的に報酬が付与することが可能となる。この結果、クリティカルパス上の対象業務の作業所要時間を効果的に短縮することができ、これにより例えば人員の追加割当等を行うことなく、或いは追加割当を最低限に抑えた上で、スケジュール全体の作業所要時間の短縮が可能となる。また、報酬量に対する作業時間の短縮効果を高めることができる。 According to one aspect of the present invention, for example, when it is necessary to shorten the time required for a target task on the critical path, priority is given to the task that is highly responsive to rewards among the target tasks on the critical path. It will be possible to give rewards accordingly. As a result, it is possible to effectively shorten the time required for the target operations on the critical path, and thereby, for example, without having to allocate additional personnel, or with the additional allocation being kept to a minimum, the entire schedule can be reduced. It is possible to shorten the time required for this work. Furthermore, the effect of reducing work time relative to the amount of remuneration can be increased.
 すなわちこの発明の一態様によれば、スケジュールの実行中に工程期間を短縮する必要が生じた場合に、適応的かつ効果的に工程期間の短縮を可能にする技術を提供することができる。 That is, according to one aspect of the present invention, it is possible to provide a technique that allows the process period to be shortened adaptively and effectively when it becomes necessary to shorten the process period during execution of a schedule.
図1は、この発明の一実施形態に係るスケジュール実行支援装置のハードウェア構成の一例を示すブロック図である。FIG. 1 is a block diagram showing an example of the hardware configuration of a schedule execution support device according to an embodiment of the present invention. 図2は、この発明の一実施形態に係るスケジュール実行支援装置のソフトウェア構成の一例を示すブロック図である。FIG. 2 is a block diagram showing an example of the software configuration of a schedule execution support device according to an embodiment of the present invention. 図3は、図2に示したスケジュール実行支援装置の制御部が実行するスケジュール実行支援処理の処理手順と処理内容の一例を示すフローチャートである。FIG. 3 is a flowchart showing an example of the processing procedure and processing contents of the schedule execution support process executed by the control unit of the schedule execution support apparatus shown in FIG. 図4は、分散の小さい業務における作業者の所要時間の分散の一例を示す図である。FIG. 4 is a diagram illustrating an example of the dispersion of the required time of workers in tasks with small dispersion. 図5は、分散の大きい業務における作業者の所要時間の分散の一例を示す図である。FIG. 5 is a diagram illustrating an example of the variance of the required time of workers in tasks with large variance. 図6は、業務ごとに所要時間がどれだけ変動するか(変化率の標準偏差)を表す所要時間ボラティリティ係数の一例を示す図である。FIG. 6 is a diagram illustrating an example of a required time volatility coefficient representing how much the required time varies for each job (standard deviation of rate of change). 図7は、業務割当情報から抽出されるクリティカルパスの一例を示す図である。FIG. 7 is a diagram showing an example of a critical path extracted from work assignment information. 図8は、図7に示したクリティカルパス上の各業務について算出された所要時間ボラティリティ係数、業務コモディティ係数および報酬反応係数の一例を示す図である。FIG. 8 is a diagram showing an example of the required time volatility coefficient, work commodity coefficient, and reward reaction coefficient calculated for each work on the critical path shown in FIG. 7.
 以下、図面を参照してこの発明に係わる実施形態を説明する。 Hereinafter, embodiments of the present invention will be described with reference to the drawings.
 [一実施形態]
 (概要)
 この発明の一実施形態は、例えばスケジュールの実行中にいずれかの業務(タスクともいう)において作業遅延が発生し、その影響をクリティカルパス上の業務の作業時間を短縮することで吸収する必要が生じた場合に、上記業務を割り当てられた作業者に対し報酬を与える。
[One embodiment]
(overview)
In one embodiment of the present invention, for example, when a work delay occurs in one of the operations (also referred to as a task) during the execution of a schedule, it is necessary to absorb the influence by shortening the work time of the operations on the critical path. If this occurs, the workers assigned to the above tasks will be compensated.
 その際、人の作業が関与する割合が高い業務ほど報酬に敏感であるという点と、人の作業による割合が大きい業務は業務ごとの作業者管理想定スキル所要時間の分散が大きく、かつ想定所要時間に対する実際の所要時間のずれが大きいという点に着目し、業務ごとの報酬に対する反応度合いを推定する。具体的には、業務ごとに、作業者の過去の作業実績に基づく所要時間の分散度合いの評価値と、作業者間の所要時間予測値の分散度合いの評価値とを求め、求められた各評価値をもとに業務ごとに報酬に対する反応度合いを算出する。そして、上記算出結果に基づいて、クリティカルパス上の各業務に対する報酬付与の優先度合いを表す情報を生成し、これを例えば管理者に対し出力する。 In doing so, it is important to note that tasks that involve a high proportion of human work are more sensitive to remuneration, and that tasks that involve a large proportion of human work have a large dispersion in the expected time required for worker management skills for each task, and Focusing on the fact that there is a large discrepancy between the actual time required, the degree of response to compensation for each task is estimated. Specifically, for each task, an evaluation value of the degree of dispersion of the required time based on the past work performance of workers and an evaluation value of the degree of dispersion of the predicted time required among workers are calculated, and each of the obtained values is calculated. The degree of response to compensation is calculated for each task based on the evaluation value. Then, based on the above calculation results, information representing the priority level of remuneration for each task on the critical path is generated, and this information is output to, for example, the administrator.
 このようにすることで、例えばクリティカルパス上の業務の作業時間を短縮する必要が生じた場合に、上記クリティカルパス上の各業務のうち報酬に対する反応度合いが高い業務に対し優先的に報酬が付与することが可能となる。この結果、クリティカルパス上の業務の作業時間を効果的に短縮することができ、これにより例えば人員の追加割当を行うことなく、或いは最低限に抑えた上で、全体の工程の作業時間の短縮が可能となる。また、報酬量に対する作業時間の短縮効果を高めることができる。 By doing this, for example, if it is necessary to shorten the work time of tasks on the critical path, rewards will be given preferentially to tasks that are highly responsive to rewards among the tasks on the critical path. It becomes possible to do so. As a result, the work time for tasks on the critical path can be effectively shortened, and for example, the work time for the entire process can be shortened without the need to allocate additional personnel or by keeping it to a minimum. becomes possible. Furthermore, the effect of reducing work time relative to the amount of remuneration can be increased.
 (構成例)
 図1および第2は、それぞれこの発明の一実施形態に係るスケジュール実行支援装置のハードウェア構成およびソフトウェア構成の一例を示すブロック図である。
(Configuration example)
FIGS. 1 and 2 are block diagrams showing an example of the hardware configuration and software configuration of a schedule execution support device, respectively, according to an embodiment of the present invention.
 スケジュール実行支援装置SVは、例えばシステム開発または製品開発に係るスケジュールを管理する管理者が使用するパーソナルコンピュータからなる。なお、スケジュール実行支援装置SVは、パーソナルコンピュータに限らず、LAN(Local Area Network)等のローカルネットワーク上、或いはWeb上またはクラウド上に配置されたサーバコンピュータであってもよい。 The schedule execution support device SV is, for example, a personal computer used by an administrator who manages schedules related to system development or product development. Note that the schedule execution support device SV is not limited to a personal computer, but may be a server computer located on a local network such as a LAN (Local Area Network), on the Web, or on a cloud.
 スケジュール実行支援装置SVは、中央処理ユニット(Central Processing Unit:CPU)等のハードウェアプロセッサを使用した制御部1を備え、この制御部1に対し、プログラム記憶部2およびデータ記憶部3を有する記憶ユニットと、入出力インタフェース(以後インタフェースをI/Fと称する)部4を、バス5を介して接続したものとなっている。 The schedule execution support device SV includes a control unit 1 using a hardware processor such as a central processing unit (CPU), and a storage unit including a program storage unit 2 and a data storage unit 3 for the control unit 1. The unit and an input/output interface (hereinafter referred to as I/F) section 4 are connected via a bus 5.
 入出力I/F部4には、入力デバイス51および出力デバイス52が接続される。入力デバイス51は、例えばキーボードやマウス、操作ボタンを備える。入力デバイス51は、管理者が、管理対象となる開発スケジュールの実行に関する支援を受けるために必要な各種情報を入力するために使用される。 An input device 51 and an output device 52 are connected to the input/output I/F section 4. The input device 51 includes, for example, a keyboard, a mouse, and operation buttons. The input device 51 is used by the administrator to input various information necessary for receiving support regarding execution of the development schedule to be managed.
 出力デバイス52は、例えばディスプレイを備え、管理者が入力した各種情報を表示したり、制御部1により生成された支援情報を表示するために使用される。なお、出力デバイス52には、プリンタや外部記憶媒体等が含まれていてもよい。 The output device 52 includes, for example, a display, and is used to display various information input by the administrator and support information generated by the control unit 1. Note that the output device 52 may include a printer, an external storage medium, and the like.
 なお、入出力I/F部4には、端末装置やサーバ装置等の他の情報処理装置との間でネットワークを介して情報データの送受信を行う通信インタフェース機能が備えられていてもよい。 Note that the input/output I/F unit 4 may be equipped with a communication interface function for transmitting and receiving information data to and from other information processing devices such as terminal devices and server devices via a network.
 プログラム記憶部2は、例えば、記憶媒体としてSSD(Solid State Drive)等の随時書込みおよび読出しが可能な不揮発性メモリと、ROM(Read Only Memory)等の不揮発性メモリとを組み合わせて構成したもので、OS(Operating System)等のミドルウェアに加えて、一実施形態に係る各種制御処理を実行するために必要なアプリケーション・プログラムを格納する。なお、以後OSと各アプリケーション・プログラムとをまとめてプログラムと称する。 The program storage unit 2 is configured by combining, for example, a non-volatile memory such as an SSD (Solid State Drive) that can be written to and read from at any time as a storage medium, and a non-volatile memory such as a ROM (Read Only Memory). In addition to middleware such as an OS (Operating System), application programs necessary for executing various control processes according to one embodiment are stored. Note that hereinafter, the OS and each application program will be collectively referred to as a program.
 データ記憶部3は、例えば、記憶媒体として、SSD等の随時書込みおよび読出しが可能な不揮発性メモリと、RAM(Random Access Memory)等の揮発性メモリと組み合わせたもので、この発明の一実施形態を実施するために必要な主たる記憶部として、予測情報記憶部31と、実績情報記憶部32と、報酬反応係数記憶部33と、業務割当情報記憶部34と、クリティカルパス情報記憶部35とを備えている。 The data storage unit 3 is, for example, a combination of a non-volatile memory such as an SSD that can be written to and read from at any time as a storage medium, and a volatile memory such as a RAM (Random Access Memory), and is an embodiment of the present invention. As the main storage units necessary for implementing the above, a prediction information storage unit 31, a performance information storage unit 32, a reward reaction coefficient storage unit 33, a work assignment information storage unit 34, and a critical path information storage unit 35 are used. We are prepared.
 予測情報記憶部31は、入力された、各作業者の業務別所要時間の予測値を記憶するために使用される。実績情報記憶部32は、入力された、各作業者の業務別所要時間の実績値を記憶するために使用される。報酬反応係数記憶部33は、制御部1により算出される、業務別の報酬反応係数を記憶するために使用される。業務割当情報記憶部34は、入力される、開発スケジュールにおける業務割当情報を記憶するために使用される。クリティカルパス情報記憶部35は、制御部1により生成される、上記開発スケジュールにおけるクリティカルパスを表す情報を記憶するために使用される。 The predicted information storage unit 31 is used to store the input predicted values of the required time for each task for each worker. The performance information storage unit 32 is used to store input performance values of the required time for each task for each worker. The reward reaction coefficient storage unit 33 is used to store the reward reaction coefficient for each job, which is calculated by the control unit 1. The task assignment information storage unit 34 is used to store input task assignment information in the development schedule. The critical path information storage unit 35 is used to store information generated by the control unit 1 and representing the critical path in the development schedule.
 制御部1は、この発明の一実施形態を実施するために用いる処理機能として、予測情報取得処理部11と、業務コモディティ係数算出処理部12と、実績情報取得処理部13と、所要時間ボラティリティ係数算出処理部14と、報酬反応係数算出処理部15と、業務割当情報取得処理部16と、クリティカルパス情報生成処理部17と、追加報酬優先リスト生成処理部18と、支援情報出力処理部19とを備える。 The control unit 1 includes a prediction information acquisition processing unit 11, a business commodity coefficient calculation processing unit 12, a performance information acquisition processing unit 13, and a required time volatility coefficient calculation processing unit 11 as processing functions used to implement an embodiment of the present invention. A calculation processing unit 14, a reward reaction coefficient calculation processing unit 15, a task assignment information acquisition processing unit 16, a critical path information generation processing unit 17, an additional reward priority list generation processing unit 18, and a support information output processing unit 19. Equipped with
 これらの処理部11~19は、何れもプログラム記憶部2に格納されたアプリケーション・プログラムを制御部1のハードウェアプロセッサに実行させることにより実現される。 These processing units 11 to 19 are all realized by causing the hardware processor of the control unit 1 to execute an application program stored in the program storage unit 2.
 なお、上記処理部11~19の一部または全部は、LSI(Large Scale Integration)やASIC(Application Specific Integrated Circuit)等のハードウェアを用いて実現されてもよい。 Note that a part or all of the processing units 11 to 19 may be realized using hardware such as LSI (Large Scale Integration) or ASIC (Application Specific Integrated Circuit).
 予測情報取得処理部11は、入力デバイス6において管理者により入力された、各作業者の業務別所要時間予測表を入出力I/F部4を介して取得し、取得した上記予測表を予測情報記憶部31に保存する。上記各作業者の業務別所要時間予測表は、管理者が、各作業者のスキルや過去の実績等を参考にして業務別に設定した作業の所要時間の予測値を表として表したものである。 The prediction information acquisition processing unit 11 acquires, via the input/output I/F unit 4, a prediction table of the time required for each task for each worker input by the administrator through the input device 6, and uses the acquired prediction table to predict the time required for each task. The information is stored in the information storage section 31. The above table for predicting the time required for each task for each worker is a table showing the predicted time required for each task, set by the administrator based on the skills and past performance of each worker. .
 業務コモディティ係数算出処理部12は、上記予測情報記憶部31に記憶された各作業者の業務別所要時間予測表に基づいて、業務コモディティ係数を算出する。業務コモディティ係数は、各作業者の業務別所要時間の予測値の分散値をすべての業務ついて算出し、算出された分散値をもとに業務ごとの偏差値として算出される。 The business commodity coefficient calculation processing unit 12 calculates the business commodity coefficient based on the prediction table of required time for each job for each worker stored in the prediction information storage unit 31. The work commodity coefficient is calculated by calculating the variance of the predicted time required for each job for each worker for all jobs, and then calculating the deviation value for each job based on the calculated variance.
 実績情報取得処理部13は、入力デバイス6において管理者により入力された、各作業者の過去の業務別所要時間実績表を入出力I/F部4を介して取得し、取得した上記実績表を実績情報記憶部32に保存する。上記各作業者の業務別所要時間実績表は、過去の業務スケジュールの実行結果をもとに各作業者の業務別作業時間の実績値を表として表したものである。 The performance information acquisition processing unit 13 acquires the past required time performance table for each task for each worker inputted by the administrator through the input device 6 via the input/output I/F unit 4, and uses the acquired performance table. is stored in the performance information storage section 32. The above-mentioned table of results of required time for each task for each worker is a table showing the actual values of the work time for each task for each worker based on the execution results of past work schedules.
 所要時間ボラティリティ係数算出処理部14は、上記実績情報記憶部32に記憶された各作業者の業務別所要時間実績表に基づいて、業務ごとの所要時間ボラティリティ係数を算出する。所要時間ボラティリティ係数は、各作業者の業務別所要時間の実測値の分散値をすべての業務について算出し、算出された分散値をもとに業務ごとの偏差値として算出される。 The required time volatility coefficient calculation processing unit 14 calculates the required time volatility coefficient for each job based on the required time performance table for each job of each worker stored in the performance information storage unit 32. The required time volatility coefficient is calculated by calculating the variance value of the actual measured value of the required time for each job for each worker for all jobs, and then calculating the deviation value for each job based on the calculated variance value.
 報酬反応係数算出処理部15は、業務ごとに、上記業務コモディティ係数算出処理部12により算出された上記業務コモディティ係数と、上記所要時間ボラティリティ係数算出処理部14により算出された上記所要時間ボラティリティ係数との加算平均値をとり、その加算平均値を各業務の報酬反応係数とする。そして、この報酬反応係数を業務の識別情報と対応付けて報酬反応係数記憶部33に保存する。 The remuneration reaction coefficient calculation processing unit 15 calculates, for each job, the business commodity coefficient calculated by the business commodity coefficient calculation processing unit 12 and the required time volatility coefficient calculated by the time required volatility coefficient calculation processing unit 14. Take the average value of , and use that average value as the remuneration response coefficient for each task. Then, this reward reaction coefficient is stored in the reward reaction coefficient storage unit 33 in association with the identification information of the job.
 業務割当情報取得処理部16は、管理者が入力デバイス6により入力した業務割当情報を入出力I/F部4を介して取得し、取得した上記業務割当情報を業務割当情報記憶部34に保存する。業務割当情報とは、管理スケジュールを作成したときの各業務に対する作業者の割当結果を表す情報である。 The business assignment information acquisition processing unit 16 acquires the business assignment information input by the administrator using the input device 6 via the input/output I/F unit 4, and stores the acquired business assignment information in the business assignment information storage unit 34. do. The task assignment information is information representing the result of worker assignment to each task when the management schedule is created.
 クリティカルパス情報生成処理部17は、上記業務割当情報記憶部34に記憶された業務割当情報からクリティカルパスを特定し、特定した上記クリティカルパスを表す情報をクリティカルパス情報記憶部35に保存する。 The critical path information generation processing unit 17 identifies a critical path from the business assignment information stored in the business assignment information storage unit 34 and stores information representing the identified critical path in the critical path information storage unit 35.
 追加報酬優先リスト生成処理部18は、上記クリティカルパス情報記憶部35に記憶されたクリティカルパスを構成する各業務について、上記報酬反応係数記憶部33から報酬反応係数を読み込み、読み込んだ上記報酬反応係数が高い順に上記クリティカルパスを構成する各業務を並べ替えることで、追加報酬優先リストを生成する。 The additional reward priority list generation processing unit 18 reads the reward reaction coefficients from the reward reaction coefficient storage unit 33 for each job constituting the critical path stored in the critical path information storage unit 35, and uses the read reward reaction coefficients. An additional reward priority list is generated by sorting the tasks that make up the critical path in descending order of their values.
 支援情報出力処理部19は、上記追加報酬優先リスト生成処理部18により生成された上記追加報酬優先リストを含む支援情報を生成し、生成した上記支援情報を入出力I/F部4から出力デバイス7へ出力する。 The support information output processing unit 19 generates support information including the additional remuneration priority list generated by the additional remuneration priority list generation processing unit 18, and outputs the generated support information from the input/output I/F unit 4 to an output device. Output to 7.
 (動作例)
 次に、以上のように構成されたスケジュール実行支援装置SVの動作例を説明する。 
 図3は、スケジュール実行支援装置SVの制御部1が実行する支援処理の処理手順と処理内容の一例を示すフローチャートである。
(Operation example)
Next, an example of the operation of the schedule execution support device SV configured as described above will be explained.
FIG. 3 is a flowchart showing an example of the processing procedure and processing contents of the support processing executed by the control unit 1 of the schedule execution support device SV.
 (1)予測情報の取得
 例えば、開発スケジュールの実行に先立ち、管理者は、上記開発スケジュールを構成する各業務について、各作業者のスキルや過去の実績等を参考にして作業所要時間の予測値を求める。そして、その結果を表す作業者業務別所要時間予測表を、入力要求に続いて入力デバイス6から入力する。
(1) Acquisition of forecast information For example, before executing a development schedule, the administrator uses the skills and past performance of each worker as a reference to estimate the estimated time required for each task that makes up the development schedule. seek. Then, following the input request, a worker task-specific time required prediction table representing the results is inputted from the input device 6.
 これに対し、スケジュール実行支援装置SVの制御部1は、待受状態においてステップS10により予測情報の入力要求を監視している。この状態で、入力デバイス6から上記入力要求が入力されると、予測情報取得処理部11の制御の下、ステップS11において、上記作業者業務別所要時間予測表を入出力I/F部4を介して取得し、取得した上記作業者業務別所要時間予測表を予測情報記憶部31に保存する。 On the other hand, the control unit 1 of the schedule execution support device SV monitors the input request for prediction information in step S10 in the standby state. In this state, when the input request is input from the input device 6, under the control of the prediction information acquisition processing unit 11, in step S11, the time required prediction table for each worker job is sent to the input/output I/F unit 4. The acquired time-required-time prediction table for each worker job is stored in the prediction information storage unit 31.
 なお、上記作業者業務別所要時間予測表の取得処理は、例えば事前にスケジュール実行サーバ(図示せず)等に記憶された作業者業務別所要時間予測表をネットワークを介してダウンロードすることにより行われてもよい。 Note that the above-mentioned processing for obtaining the time required prediction table for each worker job is performed by downloading, for example, a time required prediction table for each worker job stored in advance in a schedule execution server (not shown), etc. via a network. It's okay to be hurt.
 (2)実績情報の取得
 管理者は、上記開発スケジュールを構成する各業務について、過去の業務スケジュールの実行結果をもとに各作業者の業務別作業所要時間の実績値を収集し、収集した上記作業者の業務別作業所要時間の実績値を表す表を、入力要求に続いて入力デバイス6から入力する。
(2) Acquisition of performance information For each of the tasks that make up the above development schedule, the administrator collected the actual values of the work time required for each task for each worker based on the execution results of past work schedules. Following the input request, a table representing the actual values of the required time for each task of the worker is inputted from the input device 6.
 これに対し、スケジュール実行支援装置SVの制御部1は、待受状態においてステップS12により実績情報の入力要求を監視している。この状態で、入力デバイス6から上記入力要求が入力されると、実績情報取得処理部13の制御の下、ステップS14において、上記作業者業務別所要時間実績表を入出力I/F部4を介して取得し、取得した上記作業者業務別所要時間実績表を実績情報記憶部32に保存する。 On the other hand, the control unit 1 of the schedule execution support device SV monitors the input request for performance information in step S12 in the standby state. In this state, when the input request is input from the input device 6, under the control of the performance information acquisition processing unit 13, in step S14, the time required performance table for each worker job is sent to the input/output I/F unit 4. The obtained time required time record table for each worker job is stored in the record information storage unit 32.
 なお、上記作業者業務別所要時間実績表の取得処理についても、スケジュール実行サーバ等ネットワークを介してダウンロードすることにより行われてもよい。 Note that the acquisition process of the time required record table for each worker job may also be performed by downloading it via a network such as a schedule execution server.
 (3)業務割当情報の取得
 また管理者は、これから実行しようとする開発スケジュールにおいて設定された、各業務に対する作業者の割当を示す情報、つまり業務割当情報を、その入力要求と共に入力デバイス6から入力する。
(3) Acquisition of task assignment information In addition, the administrator sends information indicating the assignment of workers to each task set in the development schedule to be executed from now on, that is, task assignment information, from the input device 6 along with the input request. input.
 これに対し、スケジュール実行支援装置SVの制御部1は、待受状態においてステップS15により上記業務割当の入力要求を監視している。この状態で、入力デバイス6から上記入力要求が入力されると、業務割当情報取得処理部16の制御の下、ステップS15において、上記業務割当情報を入出力I/F部4を介して取得し、取得した上記業務割当情報を業務割当情報記憶部34に保存する。 On the other hand, the control unit 1 of the schedule execution support device SV monitors the input request for the task assignment in step S15 in the standby state. In this state, when the input request is input from the input device 6, the task assignment information is acquired via the input/output I/F section 4 in step S15 under the control of the task assignment information acquisition processing section 16. , the obtained task assignment information is stored in the task assignment information storage section 34.
 (4)追加報酬優先リストの生成と出力
 上記開発スケジュールの実行中において、例えばある業務において作業遅延が発生し、この作業遅延をクリティカルパス上の業務の作業時間の短縮により吸収する必要が生じたとする。この場合管理者は、入力デバイス6において、開発スケジュールの工程の時間短縮のための支援を受けるための支援要求を入力する。
(4) Generating and outputting additional compensation priority list During execution of the above development schedule, for example, if a work delay occurs in a certain task, and it becomes necessary to absorb this work delay by shortening the work time of the task on the critical path. do. In this case, the administrator uses the input device 6 to input a support request for receiving support for shortening the time of the development schedule process.
 これに対し、スケジュール実行支援装置SVの制御部1は、待受状態においてステップS16により上記支援要求の入力を監視しており、この状態で上記支援要求が入力されると、工程の時間短縮のための支援処理を以下のように実行する。 On the other hand, the control unit 1 of the schedule execution support device SV monitors the input of the support request in step S16 in the standby state, and if the support request is input in this state, the time reduction of the process is performed. The support processing for this is executed as follows.
 (4-1)業務コモディティ係数の算出
 スケジュール実行支援装置SVの制御部1は、先ず業務コモディティ係数算出処理部12において、予測情報記憶部31から各作業者の業務別所要時間予測表を読み込む。そして、読み込んだ上記各作業者の業務別所要時間予測表に基づいて、業務ごとの業務コモディティ係数を算出する。この業務コモディティ係数の算出は、各作業者の業務別所要時間の予測値の分散値をすべての業務ついて算出し、算出された分散値をもとに業務ごとの偏差値を算出することにより行われる。
(4-1) Calculation of Work Commodity Coefficients In the control unit 1 of the schedule execution support device SV, the work commodity coefficient calculation processing unit 12 first reads the task-specific time required prediction table for each worker from the prediction information storage unit 31. Then, the task commodity coefficient for each task is calculated based on the read time prediction table for each task for each worker. This work commodity coefficient is calculated by calculating the variance of the predicted time required for each job for each worker for all jobs, and then calculating the deviation value for each job based on the calculated variance. be exposed.
 (4-2)所要時間ボラティリティ係数の算出
 スケジュール実行支援装置SVの制御部1は、次に所要時間ボラティリティ係数算出処理部14において、実績情報記憶部32から各作業者の業務別所要時間実績表を読み込む。そして、読み込んだ上記各作業者の業務別所要時間実績表をもとに、業務ごとの所要時間ボラティリティ係数を算出する。この所要時間ボラティリティ係数の算出は、各作業者の業務別所要時間の実測値の分散値をすべての業務について算出し、算出された分散値をもとに業務ごとの偏差値を算出することにより行われる。
(4-2) Calculation of Required Time Volatility Coefficient Next, the control unit 1 of the schedule execution support device SV uses the required time volatility coefficient calculation processing unit 14 to retrieve the required time performance record for each task from the performance information storage unit 32. Load. Then, the volatility coefficient of the required time for each task is calculated based on the read table of required time results for each task for each worker. This required time volatility coefficient is calculated by calculating the variance value of the actual value of the required time for each job for each worker for all jobs, and then calculating the deviation value for each job based on the calculated variance value. It will be done.
 なお、業務ごとの作業所要時間の標準偏差は、対象データである所要時間の値とその平均との間の差を2乗した値を合計した上で、対象データの総数で割った正の値の平方根として算出することができる。 The standard deviation of the time required for each task is the positive value obtained by summing the squared difference between the value of the time required as the target data and its average, and then dividing it by the total number of target data. It can be calculated as the square root of
 例えば、いま図4に示すように作業者の作業所要時間の分散が小さい業務Aでは、標準偏差(σ)は7.5分と小さい値となる。一方、図5に示すように作業者の作業所要時間の分散が大きい業務Aでは、標準偏差(σ)は17.1分と大きい値となる。そして、各業務について算出された標準偏差と頻度との関係を示すと例えば図6のようになり、これにより業務A,Bの各々についての偏差値、つまり所要時間ボラティリティ係数が求められる。図6の例では、業務Aの偏差値(所要時間ボラティリティ係数)は“30”、業務Bの偏差値(所要時間ボラティリティ係数)は“70”となる。 For example, as shown in FIG. 4, in task A where the variance of the required work time of workers is small, the standard deviation (σ) is a small value of 7.5 minutes. On the other hand, as shown in FIG. 5, in task A in which the variance of the required work time of workers is large, the standard deviation (σ) is a large value of 17.1 minutes. The relationship between the standard deviation calculated for each task and the frequency is shown in FIG. 6, for example, and from this, the deviation value, that is, the required time volatility coefficient, for each of tasks A and B can be determined. In the example of FIG. 6, the deviation value (required time volatility coefficient) of job A is "30", and the deviation value (required time volatility coefficient) of job B is "70".
 (4-3)報酬反応係数の算出
 スケジュール実行支援装置SVの制御部1は、続いてステップS17において、報酬反応係数算出処理部15の制御の下、業務ごとに、上記業務コモディティ係数算出処理部12により算出された業務コモディティ係数と、上記所要時間ボラティリティ係数算出処理部14により算出された所要時間ボラティリティ係数との加算平均値を算出する。そして、報酬反応係数算出処理部15は、算出された加算平均値を各業務の報酬反応係数として、報酬反応係数記憶部33に保存する。
(4-3) Calculation of reward reaction coefficient Next, in step S17, the control unit 1 of the schedule execution support device SV calculates the above-mentioned business commodity coefficient calculation processing unit for each job under the control of the reward reaction coefficient calculation processing unit 15. 12 and the required time volatility coefficient calculated by the required time volatility coefficient calculation processing section 14. Then, the reward reaction coefficient calculation processing unit 15 stores the calculated average value in the reward reaction coefficient storage unit 33 as the reward reaction coefficient for each task.
 (4-4)クリティカルパス情報の生成
 スケジュール実行支援装置SVの制御部1は、次にステップS18において、クリティカルパス情報生成処理部17の制御の下、業務割当情報記憶部34から業務割当情報を読み込み、この業務割当情報をもとにクリティカルパスを特定する。そして、クリティカルパス情報生成処理部17は、特定した上記クリティカルパスを表す情報をクリティカルパス情報記憶部35に保存する。
(4-4) Generation of critical path information Next, in step S18, the control unit 1 of the schedule execution support device SV generates job assignment information from the job assignment information storage unit 34 under the control of the critical path information generation processing unit 17. Read and identify the critical path based on this task assignment information. Then, the critical path information generation processing unit 17 stores information representing the identified critical path in the critical path information storage unit 35.
 図7は、特定されたクリティカルパスの一例を示すものである。この例では、クリティカルパスCPは、業務A-業務B-業務D-業務Fを順に工程を実行することを表す工程経路情報として表される。一方、図8は、上記クリティカルパスCP上の各業務A,B,D,Fについてそれぞれ算出された上記所要時間ボラティリティ係数、上記業務コモディティ係数および上記報酬反応係数の一例を示したものである。 FIG. 7 shows an example of the identified critical path. In this example, the critical path CP is expressed as process route information indicating that the processes of job A, job B, job D, and job F are executed in order. On the other hand, FIG. 8 shows an example of the required time volatility coefficient, the business commodity coefficient, and the reward reaction coefficient calculated for each of the jobs A, B, D, and F on the critical path CP.
 (4-5)追加報酬優先リストの生成
 スケジュール実行支援装置SVの制御部1は、次にステップS19において、追加報酬優先リスト生成処理部18の制御の下、クリティカルパス情報記憶部35から上記クリティカルパス情報を読み込む。そして、追加報酬優先リスト生成処理部18は、読み込んだ上記クリティカルパスを構成する各業務A,B,D,Fについて、報酬反応係数記憶部33から報酬反応係数を読み込む。そして、上記クリティカルパスCP上の各業務A,B,D,Fを、上記報酬反応係数が高い順に並べ替えることで、追加報酬優先リストを生成する。
(4-5) Generation of additional reward priority list Next, in step S19, the control unit 1 of the schedule execution support device SV selects the critical path information from the critical path information storage unit 35 under the control of the additional reward priority list generation processing unit 18. Load path information. Then, the additional reward priority list generation processing unit 18 reads the reward reaction coefficients from the reward reaction coefficient storage unit 33 for each of the jobs A, B, D, and F that constitute the read critical path. Then, by rearranging the tasks A, B, D, and F on the critical path CP in descending order of the reward reaction coefficient, an additional reward priority list is generated.
 (4-6)支援情報の出力
 スケジュール実行支援装置SVの制御部1は、最後にステップS20において、支援情報出力処理部19の制御の下、上記追加報酬優先リスト生成処理部18により生成された追加報酬優先リストに加え、例えば上記リストに基づく対応メッセージを含む支援情報を生成する。そして、生成した上記支援情報を入出力I/F部4から出力デバイス7へ出力する。
(4-6) Output of support information Finally, in step S20, the control unit 1 of the schedule execution support device SV outputs the information generated by the additional reward priority list generation processing unit 18 under the control of the support information output processing unit 19. In addition to the additional reward priority list, support information including, for example, a corresponding message based on the above list is generated. Then, the generated support information is outputted from the input/output I/F section 4 to the output device 7.
 この結果、出力デバイス7には上記支援情報が表示される。なお、上記支援情報は出力デバイス7においてプリントアウトされてもよいし、記憶媒体に保存されたのち他の端末等において表示またはプリントアウトされてもよい。 As a result, the above support information is displayed on the output device 7. Note that the support information may be printed out on the output device 7, or may be displayed or printed out on another terminal after being stored in a storage medium.
 管理者は、提示された上記支援情報により、クリティカルパスCP上の各業務A,B,D,Fのうち、報酬反応係数が最も高い業務を認識する。そして、この業務を担当している作業者に対し追加報酬を付与する。 Based on the presented support information, the manager recognizes the task with the highest reward response coefficient among the tasks A, B, D, and F on the critical path CP. Then, additional compensation is given to the worker who is in charge of this work.
 なお、追加報酬の付与先は、報酬反応係数が最も高い業務を担当している作業者に限らず、クリティカルパスCP上の業務A,B,D,Fを担当しているすべての作業者またはその中から選択した複数の作業者としてもよい。また、このように複数の作業者に追加報酬を付与する場合は、例えば追加報酬優先リストに従い、優先順位が高い業務を担当する作業者ほど報酬額が高くなるように報酬額に差を付けて付与するようにしてもよい。このようにすることで、付与する追加報酬の総額を抑えた上で、高い時間短縮効果を得ることができる。また、報酬の種類としては、現金のほか、仮想通貨、ポイント、商品、人事評価値等が想定され、業務の種類、作業者の雇用形態や身分等に応じて任意に設定可能である。 The recipients of additional compensation are not limited to the worker who is in charge of the task with the highest reward response coefficient, but are also given to all workers who are in charge of tasks A, B, D, and F on the critical path CP. A plurality of workers may be selected from among them. Additionally, when granting additional remuneration to multiple workers in this way, for example, according to the additional remuneration priority list, the remuneration amount may be differentiated so that workers in charge of tasks with higher priority receive higher remuneration. It may be given. By doing so, it is possible to obtain a high time-saving effect while suppressing the total amount of additional reward to be given. In addition to cash, the types of remuneration are assumed to include virtual currency, points, products, personnel evaluation values, etc., and can be arbitrarily set depending on the type of work, employment form and status of the worker, etc.
 (作用・効果)
 以上述べたように一実施形態では、各作業者の業務別所要時間の予測値と、過去のスケジュール実行結果に基づく各作業者の業務別所要時間の実績値とを取得すると共に、実行予定の開発スケジュールに対応する業務割当情報を取得する。この状態で、例えば作業遅延の発生に伴い、クリティカルパス上の業務において作業時間の短縮が必要になった場合に、上記作業者業務別所要時間の予測値および作業者業務別所要時間の実績値をもとに、それぞれ各業務における作業者の所要時間のバラツキ度合いを表す業務コモディティ係数および所要時間ボラティリティ係数を算出し、算出した上記各係数をもとに各業務の報酬反応係数を算出する。そして、上記業務割当情報から特定したクリティカルパス上の各業務を上記報酬反応係数が高い順に並べた追加報酬優先リストを生成し、このリストを含む支援情報を出力するようにしている。
(action/effect)
As described above, in one embodiment, the predicted value of the required time for each task for each worker and the actual value of the required time for each task for each worker based on past schedule execution results are acquired, and the Obtain work assignment information corresponding to the development schedule. In this state, for example, if work delays occur and it becomes necessary to shorten the work time for a task on the critical path, the predicted value of the time required for each worker task and the actual value of the time required for each worker task mentioned above. Based on this, the work commodity coefficient and the required time volatility coefficient, which represent the degree of variation in the time required for workers in each job, are calculated, and the remuneration response coefficient for each job is calculated based on the calculated coefficients. Then, an additional reward priority list is generated in which each task on the critical path identified from the task assignment information is arranged in descending order of the reward reaction coefficient, and support information including this list is output.
 従って、クリティカルパス上の各業務の中で報酬に敏感な業務が推定され、推定された上記業務に対し報酬付与の優先度を高く設定した追加報酬優先リストが出力される。このため管理者は、上記リストに従いクリティカルパス上の各業務のうち、どの業務に対して報酬を付与すればよいかを判断し、報酬を付与することが可能となる。このため、クリティカルパス上の業務の作業時間を効果的に短縮することができ、これにより例えば人員の追加割当を行うことなく、或いは最低限に抑えた上で、スケジュール全体の工程の作業時間を短縮することが可能となる。 Therefore, among the tasks on the critical path, tasks that are sensitive to remuneration are estimated, and an additional remuneration priority list is output in which the estimated tasks are given a high priority for remuneration. Therefore, the administrator can determine which task should be rewarded among the tasks on the critical path according to the above list, and can award the reward. Therefore, it is possible to effectively shorten the work time for tasks on the critical path, for example, without allocating additional personnel or minimizing the work time for the entire schedule process. It becomes possible to shorten the length.
 また、一実施形態では、業務の作業時間を短縮する必要が生じた場合に、業務割当情報から特定されるクリティカルパス上の各業務に対してのみ、所要時間ボラティリティ係数、業務コモディティ係数および報酬反応係数を算出するための一連の処理が行われる。このため、開発スケジュール上のすべての業務について上記所要時間ボラティリティ係数、業務コモディティ係数および報酬割当係数を算出する場合に比べ、制御部1の処理負荷を軽減することが可能となる。 Further, in one embodiment, when it becomes necessary to shorten the work time of a job, the required time volatility coefficient, job commodity coefficient, and reward response are calculated only for each job on the critical path identified from the job assignment information. A series of processing is performed to calculate the coefficients. Therefore, the processing load on the control unit 1 can be reduced compared to the case where the required time volatility coefficient, work commodity coefficient, and reward allocation coefficient are calculated for all the work on the development schedule.
 [その他の実施形態]
 (1)一実施形態では、スケジュール実行支援装置SVの制御部1が備える各処理部11~19による処理を1台のパーソナルコンピュータによりすべて実行する場合を例にとって説明した。しかし、それに限らず、上記各処理部11~19による処理をパーソナルコンピュータやサーバ等の複数台の情報処理装置により分散して実行するようにしてもよい。
[Other embodiments]
(1) In one embodiment, an example has been described in which a single personal computer executes all processes by the processing units 11 to 19 included in the control unit 1 of the schedule execution support device SV. However, the present invention is not limited thereto, and the processing by each of the processing units 11 to 19 may be distributed and executed by a plurality of information processing devices such as a personal computer or a server.
 (2)一実施形態では、予測情報、実績情報および業務割当情報を事前に取得してそれぞれ記憶部31,32,34に保存しておくようにした。しかし、上記各情報は追加報酬の付与が必要になったときに、必要な情報のみをスケジュール実行サーバ等から取得するようにしてもよい。このようにすると、スケジュール実行支援装置SVの記憶部3の記憶容量を節約することが可能となる。 (2) In one embodiment, prediction information, performance information, and task assignment information are acquired in advance and stored in the storage units 31, 32, and 34, respectively. However, only the necessary information may be acquired from the schedule execution server or the like when it becomes necessary to provide additional remuneration. In this way, it becomes possible to save the storage capacity of the storage unit 3 of the schedule execution support device SV.
 (3)その他、スケジュール実行支援装置の構成と処理機能、処理手順および処理内容、支援情報の構成、報酬の種類等についても、この発明の要旨を逸脱しない範囲で種々変形して実施可能です。 (3) In addition, the configuration and processing functions, processing procedures and processing contents, structure of support information, types of rewards, etc. of the schedule execution support device can be modified in various ways without departing from the gist of this invention.
 以上、この発明の実施形態を詳細に説明してきたが、前述までの説明はあらゆる点においてこの発明の例示に過ぎない。この発明の範囲を逸脱することなく種々の改良や変形を行うことができることは言うまでもない。つまり、この発明の実施にあたって、実施形態に応じた具体的構成が適宜採用されてもよい。 Although the embodiments of the present invention have been described above in detail, the above description is merely an illustration of the present invention in all respects. It goes without saying that various improvements and modifications can be made without departing from the scope of the invention. That is, in implementing the present invention, specific configurations depending on the embodiments may be adopted as appropriate.
 要するにこの発明は、上記実施形態そのままに限定されるものではなく、実施段階ではその要旨を逸脱しない範囲で構成要素を変形して具体化できる。また、上記実施形態に開示されている複数の構成要素の適宜な組み合せにより種々の発明を形成できる。例えば、実施形態に示される全構成要素から幾つかの構成要素を削除してもよい。さらに、異なる実施形態に亘る構成要素を適宜組み合せてもよい。 In short, the present invention is not limited to the above-described embodiments as they are, but can be embodied by modifying the constituent elements at the implementation stage without departing from the spirit of the invention. Moreover, various inventions can be formed by appropriately combining the plurality of components disclosed in the above embodiments. For example, some components may be deleted from all the components shown in the embodiments. Furthermore, components from different embodiments may be combined as appropriate.
 SV…スケジュール実行支援装置
 1…制御部
 2…プログラム記憶部
 3…データ記憶部
 4…入出力I/F部
 5…バス
 6…入力デバイス
 7…出力デバイス
 11…予測情報取得処理部
 12…業務コモディティ係数算出処理部
 13…実績情報取得処理部
 14…所要時間ボラティリティ係数算出処理部
 15…報酬反応係数算出処理部
 16…業務割当情報取得処理部
 17…クリティカルパス情報生成処理部
 18…追加報酬優先リスト生成処理部
 19…支援情報出力処理部
 31…予測情報記憶部
 32…実績情報記憶部
 33…報酬反応係数記憶部
 34…業務割当情報記憶部
 35…クリティカルパス情報記憶部
 
SV... Schedule execution support device 1... Control unit 2... Program storage unit 3... Data storage unit 4... Input/output I/F unit 5... Bus 6... Input device 7... Output device 11... Prediction information acquisition processing unit 12... Business commodity Coefficient calculation processing unit 13... Actual information acquisition processing unit 14... Required time volatility coefficient calculation processing unit 15... Reward reaction coefficient calculation processing unit 16... Work assignment information acquisition processing unit 17... Critical path information generation processing unit 18... Additional reward priority list Generation processing section 19... Support information output processing section 31... Prediction information storage section 32... Performance information storage section 33... Reward reaction coefficient storage section 34... Task assignment information storage section 35... Critical path information storage section

Claims (6)

  1.  複数の業務に対し人員を割り当てて所定の工程を実行するスケジュールの実行を支援するスケジュール実行支援装置であって、
     前記複数の業務の各々について、複数の人員の過去の作業実績に基づく作業所要時間の分散度合いを表す第1の評価値を算出する第1の処理部と、
     前記複数の業務の各々について、前記複数の人員間の作業所要時間の予測値の分散度合いを表す第2の評価値を算出する第2の処理部と、
     前記第1の評価値および前記第2の評価値に基づいて、前記複数の業務の各々について報酬に対する反応度合いを推定する第3の処理部と、
     前記スケジュールから、全体の作業所要時間を決めるクリティカルパスを特定する第4の処理部と、
     前記反応度合いの推定結果に基づいて、前記クリティカルパスを構成する複数の対象業務に対する報酬付与の優先度合いを表す情報を生成し、生成した前記優先度合いを表す情報を含む支援情報を出力する第5の処理部と
     を備えるスケジュール実行支援装置。
    A schedule execution support device that supports execution of a schedule for assigning personnel to multiple tasks and executing predetermined processes, the device comprising:
    a first processing unit that calculates, for each of the plurality of tasks, a first evaluation value representing a degree of dispersion of work required time based on past work results of a plurality of personnel;
    a second processing unit that calculates, for each of the plurality of tasks, a second evaluation value representing a degree of dispersion of predicted values of work required times among the plurality of personnel;
    a third processing unit that estimates a degree of reaction to remuneration for each of the plurality of tasks based on the first evaluation value and the second evaluation value;
    a fourth processing unit that identifies, from the schedule, a critical path that determines the overall work time;
    a fifth step of generating information representing a priority degree of remuneration for a plurality of target tasks constituting the critical path based on the estimation result of the reaction degree, and outputting support information including information representing the generated priority degree; A schedule execution support device comprising: a processing unit;
  2.  前記第1の処理部は、前記複数の業務の各々について、複数の人員の過去の作業実績に基づく作業所要時間の分散度合いをもとに、前記複数の業務の中での前記作業所要時間の変化率の標準偏差を表す所要時間ボラティリティ係数を、前記第1の評価値として算出する、請求項1に記載のスケジュール実行支援装置。 For each of the plurality of tasks, the first processing unit calculates the required work time among the plurality of tasks based on the degree of dispersion of the required work time based on past work results of a plurality of personnel. The schedule execution support device according to claim 1, wherein a required time volatility coefficient representing a standard deviation of a rate of change is calculated as the first evaluation value.
  3.  前記第2の処理部は、前記複数の業務の各々について、前記複数の人員間の作業所要時間の予測値の分散度合いをもとに、前記複数の業務の中での前記作業所要時間の予測値の偏差値を表す業務コモディティ係数を、前記第2の評価値として算出する、請求項1に記載のスケジュール実行支援装置。 The second processing unit predicts the required work time among the plurality of jobs based on the degree of dispersion of predicted values of the required work time among the plurality of personnel for each of the plurality of jobs. The schedule execution support device according to claim 1, wherein a business commodity coefficient representing a deviation value is calculated as the second evaluation value.
  4.  前記第1の処理部および前記第2の処理部は、それぞれ前記クリティカルパスを構成する前記複数の対象業務について、前記第1の評価値および前記第2の評価値を算出し、
     前記第3の処理部は、前記第1の評価値および前記第2の評価値に基づいて、前記クリティカルパスを構成する前記複数の対象業務の各々について報酬に対する前記反応度合いを推定する
     請求項1に記載のスケジュール実行支援装置。
    The first processing unit and the second processing unit each calculate the first evaluation value and the second evaluation value for the plurality of target tasks forming the critical path,
    1 . The third processing unit estimates the degree of reaction to remuneration for each of the plurality of target tasks forming the critical path based on the first evaluation value and the second evaluation value. The schedule execution support device described in .
  5.  複数の業務に対し人員を割り当てて所定の工程を実行するスケジュールの実行を支援する装置が実行するスケジュール実行支援方法であって、
     前記複数の業務の各々について、複数の人員の過去の作業実績に基づく作業所要時間の分散度合いを表す第1の評価値を算出する過程と、
     前記複数の業務の各々について、前記複数の人員間の作業所要時間の予測値の分散度合いを表す第2の評価値を算出する過程と、
     前記第1の評価値および前記第2の評価値に基づいて、前記複数の業務の各々について報酬に対する反応度合いを推定する過程と、
     前記スケジュールから、全体の作業所要時間を決めるクリティカルパスを特定する過程と、
     前記反応度合いの推定結果に基づいて、前記クリティカルパスを構成する複数の対象業務に対する報酬付与の優先度合いを表す情報を生成し、生成した前記優先度合いを表す情報を含む支援情報を出力する過程と
     を備えるスケジュール実行支援方法。
    A schedule execution support method executed by a schedule execution support device that allocates personnel to multiple jobs and executes predetermined processes, the method comprising:
    for each of the plurality of tasks, calculating a first evaluation value representing a degree of dispersion of required work time based on past work results of a plurality of personnel;
    for each of the plurality of tasks, calculating a second evaluation value representing a degree of dispersion of predicted values of work required time among the plurality of personnel;
    a step of estimating the degree of response to remuneration for each of the plurality of tasks based on the first evaluation value and the second evaluation value;
    A process of identifying a critical path that determines the overall work time from the schedule;
    a step of generating information representing a priority level of remuneration for a plurality of target tasks constituting the critical path based on the estimation result of the reaction degree, and outputting support information including information representing the generated priority level; A schedule execution support method comprising:
  6.  請求項1乃至4のいずれかに記載のスケジュール実行支援装置が備える前記第1乃至第5の処理部の少なくとも1つの処理を、前記スケジュール実行支援装置が備えるプロセッサに実行させるプログラム。 A program that causes a processor included in the schedule execution support device to execute at least one process of the first to fifth processing units included in the schedule execution support device according to any one of claims 1 to 4.
PCT/JP2022/023748 2022-06-14 2022-06-14 Schedule execution assistance device, method, and program WO2023242942A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/JP2022/023748 WO2023242942A1 (en) 2022-06-14 2022-06-14 Schedule execution assistance device, method, and program

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2022/023748 WO2023242942A1 (en) 2022-06-14 2022-06-14 Schedule execution assistance device, method, and program

Publications (1)

Publication Number Publication Date
WO2023242942A1 true WO2023242942A1 (en) 2023-12-21

Family

ID=89192647

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2022/023748 WO2023242942A1 (en) 2022-06-14 2022-06-14 Schedule execution assistance device, method, and program

Country Status (1)

Country Link
WO (1) WO2023242942A1 (en)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2006202255A (en) * 2004-12-24 2006-08-03 Omron Corp Process improvement support system
JP2009289134A (en) * 2008-05-30 2009-12-10 Hitachi Ltd Work analyzer, production management method and production management system
JP2010211593A (en) * 2009-03-11 2010-09-24 Hitachi Software Eng Co Ltd Progress input support system
JP2018045512A (en) * 2016-09-15 2018-03-22 オムロン株式会社 Workability evaluation device
JP2018126802A (en) * 2017-02-06 2018-08-16 ファナック株式会社 Workpiece take-out device and workpiece take-out method for improving take-out operation of workpiece
JP2020166314A (en) * 2019-03-28 2020-10-08 日本電気株式会社 Worker placement apparatus and worker placement method
CN113283692A (en) * 2021-03-19 2021-08-20 东南大学 Intelligent man-machine cooperation scheduling method and system for monitoring resource allocation of bulk commodity trading market

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2006202255A (en) * 2004-12-24 2006-08-03 Omron Corp Process improvement support system
JP2009289134A (en) * 2008-05-30 2009-12-10 Hitachi Ltd Work analyzer, production management method and production management system
JP2010211593A (en) * 2009-03-11 2010-09-24 Hitachi Software Eng Co Ltd Progress input support system
JP2018045512A (en) * 2016-09-15 2018-03-22 オムロン株式会社 Workability evaluation device
JP2018126802A (en) * 2017-02-06 2018-08-16 ファナック株式会社 Workpiece take-out device and workpiece take-out method for improving take-out operation of workpiece
JP2020166314A (en) * 2019-03-28 2020-10-08 日本電気株式会社 Worker placement apparatus and worker placement method
CN113283692A (en) * 2021-03-19 2021-08-20 东南大学 Intelligent man-machine cooperation scheduling method and system for monitoring resource allocation of bulk commodity trading market

Similar Documents

Publication Publication Date Title
JP4071668B2 (en) Apparatus and method for adjusting system resources
US10452416B2 (en) Virtualization planning system
Moschakis et al. Multi-criteria scheduling of Bag-of-Tasks applications on heterogeneous interlinked clouds with simulated annealing
JP2667376B2 (en) Client / server data processing system
US8793693B2 (en) Apparatus and method for predicting a processing time of a computer
US7797141B2 (en) Predictive analysis of availability of systems and/or system components
US20050132379A1 (en) Method, system and software for allocating information handling system resources in response to high availability cluster fail-over events
US8606905B1 (en) Automated determination of system scalability and scalability constraint factors
Bacigalupo et al. Managing dynamic enterprise and urgent workloads on clouds using layered queuing and historical performance models
JP7197776B2 (en) Scheduling program, scheduling method and scheduling device
US8544009B2 (en) Method, apparatus, and product for scheduling of distributed processing based on average execution time and communication time
US9038081B2 (en) Computing job management based on priority and quota
JP6237170B2 (en) Allocation determination apparatus, control method, and program
JP6924083B2 (en) Information processing system and resource allocation method
Al Hanbali et al. Approximations for the waiting-time distribution in an M/PH/c M/PH/c priority queue
US11036549B2 (en) Parallel processing apparatus, and method of maintaining parallel processing apparatus
WO2023242942A1 (en) Schedule execution assistance device, method, and program
JP2006107167A (en) Scheduling system, scheduling program and scheduling method
Jiang et al. Multi-prediction based scheduling for hybrid workloads in the cloud data center
Abdul Aziz et al. Scheduling workflow applications with makespan and reliability constraints
JP2015108877A (en) Prediction time distribution generation device, control method, and program
JP6669908B1 (en) Information processing system, information processing method and information processing program
EP3901862B1 (en) Process management assistance system, process management assistance method, and process management assistance program
JP6570604B2 (en) Schedule management system and schedule management program
CN112868037B (en) Process management support system, process management support method, and process management support program product

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 22946762

Country of ref document: EP

Kind code of ref document: A1