Scalable Enterprise Systems: Real-Time Promising for Authority Domains Operating in a Build-to-Order Mode

可扩展的企业系统：以按单生产模式运行的权威域的实时承诺

• 批准号: 0075714
• 负责人: Scott Moses
• 金额: $ 12.96万
• 依托单位: University of Oklahoma Norman Campus
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2000
• 资助国家: 美国
• 起止时间: 2000-08-15 至 2002-07-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0075714&HistoricalAwards=false
• 关键词: Scalable; Enterprise; Systems; Real; Time

This grant funds investigation of scalable techniques for real-time order promising by discrete build-to-order environments facing dynamic order arrivals. The algorithms to be developed in this project for calculating due dates consider current time-phased availability of resources and material, existing commitments, and the current system state. The presence of various alternate resources or materials increases the combinatorial complexity of the problem. To increase performance, a combination of bothoptimal algorithms with good scalability such as shortest path and computational heuristics will be considered. One of the heuristics to be examined is based on a novel, even controversial, idea: for the purposes of promising, the time when a resource will be able to process an operation can be estimated with sufficient accuracy by considering only a partially ordered resource task plan. Current support for this principle is grounded in practical experience but little scientific evidence. Joint research occurring at the intersection of Industrial Engineering and Computer Science is necessary in this project because algorithmic and computational aspects are intertwined when performing research in a large-scale systems context.Algorithms will be implemented in an object-oriented, memory-resident, multi-threaded architecture for detailed study and empirical evaluation. A key tenet of this project is that the results be highly scalable.Order promising is perhaps the most important operational-level activity. The ability to make tight, yet achievable, promises in response to requests from consumers or other businesses is a fundamental business requirement. Surprisingly, very little research has been done in this area. Results of this research will increase the accuracy and speed with which these promises can be made. This research is directly applicable to manufacturers that increasingly are selling built-to-order products direct to customers via the Internet and to a future where collaborative commerce freely occurs among dynamically recombinant business partners.

这项赠款的资金调查的可扩展技术，实时订单承诺离散的建设，以秩序的环境，面对动态订单到达。 本项目中开发的用于计算到期日的算法考虑了资源和材料的当前时间阶段可用性、现有承诺以及当前系统状态。 各种替代资源或材料的存在增加了问题的组合复杂性。 为了提高性能，将考虑具有良好可扩展性的最短路径和计算并行算法的组合。 其中一个要检查的算法是基于一个新的，甚至是有争议的想法：为了承诺的目的，资源将能够处理操作的时间可以通过只考虑部分排序的资源任务计划来估计，具有足够的精度。 目前对这一原则的支持基于实践经验，但几乎没有科学证据。 由于在大规模系统环境下进行研究时，算法和计算方面相互交织，因此在本项目中，工业工程和计算机科学的交叉点上进行联合研究是必要的。算法将在面向对象、内存驻留、多线程架构中实现，以进行详细的研究和实证评估。 这个项目的一个关键原则是结果是高度可伸缩的。订单承诺可能是最重要的操作级活动。 响应消费者或其他企业的请求做出严格但可实现的承诺的能力是一个基本的业务需求。 令人惊讶的是，这方面的研究很少。 这项研究的结果将提高这些承诺的准确性和速度。 这项研究是直接适用于制造商，越来越多地通过互联网直接向客户销售定制产品，并在未来的合作商业自由地发生在动态重组的商业伙伴。