摘要
分析了供应链管理中多制造商、多客户的生产和运输集成起来的排序(调度)问题。建立了集成排序模型,在研究解的最优性条件基础上,用工件的总流程时间作为排序目标,解决使总费用达到最小的问题,给出相应的动态规划算法,并分析算法的复杂性。
This paper studies the scheduling problem of a supply chain with multiple manufacturers and suppliers. A precise mathematical scheduling model is first built. Moreover, based on the optimal condition analysis, and taking the total flow time of workpieces as the squencing objective, thus the problem of minimizing the toltal cost is solved. Furthermore, the corresponding dynamic programming method is presented. The algorithm has been proved to be efficient by showing its pseudo-polynomial complexity.
出处
《工业工程与管理》
2007年第5期47-50,共4页
Industrial Engineering and Management
基金
国家自然科学基金项目(10371071)
上海市自然科学基金项目(03ZR14039)
关键词
供应链
排序
动态规划
supply chain
scheduling
dynamic programming
