摘要
本文针对考虑资源约束的平行处理机的调度问题,以选择操作链来划分时间段,并建立了数学模型。这一方式将对处理机和资源的关注转化到操作的变化上来,极大地降低了该类问题的计算复杂性。
To solve the single resource-constrained of Parallel Processors scheduling problem, we use choose-operation-Chains to draw planning horizon and build MILP model to describe the optimal process. This method focus on changes of operation, replace classic methods which cope with both processors and resource. This method reduce the complexity of solve this kind of problem efficiently.
出处
《微计算机信息》
北大核心
2006年第09X期267-268,286,共3页
Control & Automation
基金
国家自然科学基金项目(70371057)
