摘要
针对离散型制造企业的特点,建立了基于目标规划的产品可交付量(ATP)问题的数学模型,并给出了一种改进的单纯形解法,使得整个运算过程能够用计算机软件自动实现而无需人工干预。该算法能够在物料和设备这两种资源的约束条件下,求出每一种产品的计划生产数量,使得既满足最低生产数量的要求,又能够取得最大的利润。在实际应用过程中,证明了该算法的实用性。
According to the characteristics of the discrete manufacturing enterprises, we establish the mathematic model of available-to-promise problem based on goal-programming and put forward an improved simplex method, which can be carried out by computer software automatically and efficiently. The algorithm can calculate the number of every product to be produced, which make the maximum of profit while meeting the lowest planned number and also subjecting to the restriction of materials and equipments available.The algorithm has been proved to be useful during the process of implementation.
出处
《机械科学与技术》
CSCD
北大核心
2005年第6期696-698,701,共4页
Mechanical Science and Technology for Aerospace Engineering
关键词
可交付量
目标规划
单纯形解法
Available-to-promise
Goal programming
Simplex method
