检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]曲阜师范大学运筹与管理学院,山东日照276826
出 处:《洛阳理工学院学报(自然科学版)》2010年第4期59-64,共6页Journal of Luoyang Institute of Science and Technology:Natural Science Edition
基 金:国家自然科学基金资助项目(10671108)
摘 要:研究每个制造商具有单台批处理机的多制造商、多客户的生产和运输集成问题,以生产和运输的总费用达到最小作为目标,建立问题的集成排序模型。在工件分别带有权重和交货期的情况下,在分析解的最优性条件的基础上,分别用工件的加权总完工时间和最大延迟作为生产费用,给出相应的动态规划算法,并分析算法的复杂性。并且给出批容量有限加工时间都相同这一特殊情形的最优算法。This paper studies the problem of integrated manufacturing and trausporting for the individual manufacturer who has a single hatching, machine to deal with multi-manufacturer and multi-client. An integrated sequencing model bas been established with the minimization of the total cost for production and distribution as the target. Under the condition that every workpiece respectively has a weight or deadline, and based on the optimal condition analysis, the corresponding dynamic programming algorithm has been presented and its complexity has been analyzed with total working time and maximum delaying of the weighted workpiece as the production cost. Furthermore, an optimal algorithm is also mentioned for a special case in which all the work pieces have the same processing time and the capacity of the batch is limited.
分 类 号:O224[理学—运筹学与控制论] F274[理学—数学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.137.142.253