Task assignment apparatus, task assignment method, task assignment program
展开▼
机译：任务分配装置，任务分配方法，任务分配程序
展开▼
页面导航
摘要
著录项
相似文献
摘要
PROBLEM TO BE SOLVED: To obtain a global optimal solution in a time direction by performing optimization in a plurality of points of time at one time.SOLUTION: An allocation candidate pair search function section 030 determines pairs of "time ID, worker, and task" on the basis of DBs 005, 020, 010, to be stored in a DB 040. A cost calculation function section 050 determines a minimum task completion time at a plurality of points of time, out of "worker and task" extracted from the pairs of "time, worker, and task" in the DB 040. The minimum time, the worker, the task, and the time ID of the minimum time are stored in a DB 060, in association with each other. A constraint equation calculation function section 070 generates a constraint equation to be given when a maximum allocation problem of a worker pair task is substituted with a maximum matching problem of a bipartite graph, on the basis of the DB 040. An allocation optimization calculation function section 090 calculates a pair of time, worker, and task so as to minimize the time to task completion by time ID, to be stored in a DB 100.SELECTED DRAWING: Figure 2
展开▼
机译：解决的问题：通过一次在多个时间点上执行优化来在时间方向上获得全局最优解。解决方案：分配候选对搜索功能部分030确定“时间ID，工作人员和任务”对根据要存储在DB 040中的DB 005、020、010。成本计算功能部分050从多个步骤中确定的“工人和任务”中确定在多个时间点的最小任务完成时间。 DB 040中的“时间，工作人员和任务”对。最小时间，工作人员，任务和最小时间的时间ID相互关联地存储在DB 060中。约束方程计算功能部分070基于DB 040，生成当用双偶图的最大匹配问题代替工人对任务的最大分配问题时给出的约束方程。分配优化计算功能部分090计算一对时间，工作人员和任务，以便通过时间ID最小化完成任务的时间，并将其存储在DB 100中。图2
展开▼
