虚拟企业能够快速适应市场变化并能更有效地共享合作伙伴的资源,因此它正在成为越来越重要的组织管理单位。虚拟企业管理中的伙伴选择问题广泛出现在诸如企业动态结盟、任务指派、投资组合、敏捷制造和供应链管理等领域。本文建立了虚拟企业管理中伙伴选择问题的一个O—1规划数学模型。该模型涉及项目施工的先后次序和项目资金的动态支付,所建立的模型符合工程实际。它是进一步分析和解决伙伴选择问题的基础。
The virtual enterprise can respond rapidly to market changes and makes resource sharing more efficient among manufacturing partners. The partner selection problems in virtual enterprise management extensively appear in social and management fields such as the selection of dynamic alliance strategies, assigning task problems, portfolio selection, agile production and supply chain management, etc.. In this paper, a mathematical model, 0-1 programming model, is proposed on partner selection problems in virtual enterprise management. The model is concerned with the former-latter relationship of the items and the dynamic receiving and paying of the capital flow. The established model is in conformity with the reality. It lays basis for further analyzing and solving the partner selection problem.