Intelligent resource management through the constrained resource planning model

被引:0
作者
Yun, DYY [1 ]
机构
[1] Univ Hawaii, Coll Engn, LIPS, Honolulu, HI 96822 USA
来源
FUTURE DIRECTIONS FOR INTELLIGENT SYSTEMS AND INFORMATION SCIENCES | 2000年 / 45卷
关键词
resource management; constrained resource planning; constraint satisfaction; optimization; planning and scheduling;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Objective: Introduce a resource management methodology, known as the Constrained Resource Planning (CRP), together with a flexible and powerful computing "engine", suitable for most planning and scheduling applications under stringent solution requirements rightly interacting constraints, as well as restricted resource availability and utilization. Methodology: By the effective utilization of two domain-independent guiding principles (i) the most-constrained strategy for task identification and the least-impact strategy for solution selection (ii) the algorithmic procedure of CRP allows widely varying problems to be mapped and solved without changing the underlying problem solving mechanisms - the CRP engine, Quality: Unlike most heuristic approaches that cart be trapped into locally- or non-optimal solutions, CRP has been shown to produce provably optimal solutions for a variation of the classic, NP-complete traveling salesman problem, known as the diamond lattice problem. Applicability: Over 40 resource allocation and activity scheduling problems have been solved using the CRP methodology and computing engine. Capitalizing on CRP's ability to delicately integrate and balance complementary and conflicting objectives, CRP-solved applications have demonstrated a consistency to achieve quality solutions and display surprising intelligence for well known difficult problems, such as multiprocessor scheduling 30 model discovery, and DNA folding, in addition to providing intelligent solutions for most challenging and NP-hard problems as maximal common subgraph. Significance: Due to its broad applicability, solution quality and computational efficacy, CRP is offered both as a general, problem-solving methodology for tackling difficult problems and as an executable computing engine capable of achieving solutions even beyond human intelligence. CRP also guides a problem solver to tackle resource confined decision problems with simultaneous objectives and conflicting constraints through a set of disciplined strategies and balanced principles.
引用
收藏
页码:373 / 386
页数:14
相关论文
共 95 条
[1]  
AKHTER MR, 1991, THESIS U HAWAII
[2]   FIRM RESOURCES AND SUSTAINED COMPETITIVE ADVANTAGE [J].
BARNEY, J .
JOURNAL OF MANAGEMENT, 1991, 17 (01) :99-120
[4]  
BENDER PS, 1983, RESOURCE MANAGEMENT
[5]   MATHEMATICAL-PROGRAMMING FORMULATIONS FOR MACHINE SCHEDULING - A SURVEY [J].
BLAZEWICZ, J ;
DROR, M ;
WEGLARZ, J .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1991, 51 (03) :283-300
[6]   A HIERARCHICAL PRODUCTION PLANNING AND SCHEDULING MODEL [J].
BOWERS, MR ;
JARVIS, JP .
DECISION SCIENCES, 1992, 23 (01) :144-159
[7]  
Chen C.C., 1999, Ph.D. dissertation
[8]  
Chen C H, 1994, J Hematother, V3, P3, DOI 10.1089/scd.1.1994.3.3
[9]  
CHEN CW, 1999, P 7 WORKSH ROUGH SET
[10]  
CHEN CW, 1997, P INT C IM SCI SYST