检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]复旦大学管理学院管理科学系,上海200433
出 处:《系统工程》2004年第6期21-24,共4页Systems Engineering
摘 要:目前,供应链竞争已成为企业间市场竞争的主要表现形式,因此供应链上合作伙伴的协作变得尤为重要。在采购原材料方面更是如此,许多企业都倾向于在一段长的时期内选择某几个供应商进行合作,建立良好的关系,但是短期内每一阶段的供应量则要在它们之间进行最经济的分配,以有利于购买者。本文解决的问题正是这一供应量分配的问题,考虑多阶段多产品、多种折扣方式的供应量分配,建立大规模的混合整数规划,并提出有效实用的启发式算法。In today's situation, the competition among supply chains has become the main form of market competition (among) millions of companies, so the cooperation of friends in one supply chain is significant, particularly in the case of (procurement.) Many companies tend to choose several fixed suppliers in certain long time to gain good relationship with (suppliers.) However, in the short term, the amount of procurement should be allocated among these suppliers in the most (efficient) way. The purpose of this article is to put forward an effective and efficient method to allocate the procurement in (several) periods, and with some All-Unit discount levels. The model in this article is a Mixed Integer Program, and we (present) a simple but effective heuristic method to solve this model.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3