摘要
研究基于网络的多工作伙伴挑选问题 ,并设计了带有协同因子的 0 - 1整数规划模型 ,以实现竞标费用和拖期惩罚费用之和最小。通过伙伴有效性定义 ,减小了解空间。利用遗传算法进行了模型求解。
Partner selection of dynamic alliances for multi-job manufacturing systems in virtual enterprise is studied and a 0-1 integral programming model, including the compatible factor , is proposed. The object is to find one kind of optimal combination and to minimize the total bid cost and tardiness penalty. Through the validity definition of partner, the scale of selection space is reduced. The optimal results can be obtained by using the genetic algorithm. The results show the effectiveness and feasibility of the model and algorithm.
出处
《控制与决策》
EI
CSCD
北大核心
2001年第B11期709-712,共4页
Control and Decision
基金
国家自然科学基金项目 (6 0 0 840 0 3)
