检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《武汉理工大学学报》2008年第8期185-188,共4页Journal of Wuhan University of Technology
摘 要:研究了工厂某时刻接到了一定量产品的定单,需要在一定时间内完成定单,如何制定生产计划使生产和贮存的2种费用之和尽可能少的问题。利用变分法建立了优化的生产计划模型。主要在生产率不受限制和生产率有一个上界限制的情况下,分别建立模型,并进行讨论。最终给出了优化的生产计划,得到了令人满意的结果,从而解决了问题。The paper research factory was some to receive the order form of certain yield article every moment, needing to complete the order form in certainly time, how draw up to produce the plan to make produce and two kinds of expenseses that save it and minimum of problem. In the paper, building up superior produce to plan the model, Main under the condition that rate of production be free from limit or rate of production have an up boundary limit, build up the model respectively, carry on discussion's combine end give superior to produce the plan function, get the decent result, thus resolved the in point of problem that this paper want.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15