首页> 外国专利> METHOD FOR REPRESENTING RESOURCE ALLOCATION PROBLEM AND METHOD FOR SOLVING THE PROBLEM

METHOD FOR REPRESENTING RESOURCE ALLOCATION PROBLEM AND METHOD FOR SOLVING THE PROBLEM

机译:表示资源分配问题的方法和解决问题的方法

摘要

PROBLEM TO BE SOLVED: To realize a method for representing a resource allocation problem and a method for solving the problem by using a computer with respect to a resource allocation field.;SOLUTION: These methods can be applied to, for instance, the scheduling of workflow. The resource allocation problem has resource use availability and a value element which cross orthogonally with each other and is also represented by at least one domain multiset representing supply. The resource allocation problem has further a resource requirement and an optional value constraint which cross orthogonally with each other and also provides a consumer multiset representing demand. The methods define a unary constraint to the supply attribute and the demand attribute of each multiset and also define a binary constraint between consumers to each other in the consumer multiset. The resource allocation problem can be solved by applying the temporal back track algorithm to the unary constraint and the binary constraint.;COPYRIGHT: (C)2002,JPO
机译:要解决的问题:实现一种用于表示资源分配问题的方法和一种通过使用计算机针对资源分配字段解决该问题的方法。解决方案:这些方法可用于例如调度资源分配。工作流程。资源分配问题具有资源使用可用性和彼此正交的值元素,并且还由表示供应的至少一个域多集表示。资源分配问题还具有彼此正交的资源需求和可选的值约束,并且还提供了代表需求的消费者多集。该方法定义了每个多集的供应属性和需求属性的一元约束,并且还定义了消费者多集中消费者之间的二元约束。通过将时间回溯算法应用于一元约束和二元约束,可以解决资源分配问题。;版权:(C)2002,JPO

著录项

  • 公开/公告号JP2002133052A

    专利类型

  • 公开/公告日2002-05-10

    原文格式PDF

  • 申请/专利权人 INTERNATL BUSINESS MACH CORP IBM;

    申请/专利号JP20010254031

  • 发明设计人 MICHAEL JAMES SANDERS;

    申请日2001-08-24

  • 分类号G06F17/60;

  • 国家 JP

  • 入库时间 2022-08-22 00:54:11

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号