检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《郑州大学学报(理学版)》2012年第1期56-61,共6页Journal of Zhengzhou University:Natural Science Edition
基 金:国家自然科学基金资助项目;编号71001090;71001091;河南省教育厅自然科学研究计划项目;编号2009A120002
摘 要:以钢管生产为背景,在分析钢管切割工艺的基础上,提炼出第一阶段具有批处理特征的动态HFS调度问题,建立了数学规划模型,目标是最小化所有工件的加权完成时间.针对该模型,构造了改进的拉格朗日松弛算法(lagrangian relaxation,LR)的求解过程,设计了求解批级子问题的动态规划算法和构造可行解的启发式算法.Based on the background of steel-tube production,on the analysis of the technology of steel tube cutting,the dynamic hybrid flowshop scheduling with batch processing at the first stage was presented,and an integer programming model was established for this problem.The objective was to minimize the total weighted completion time.The improved Lagrangian relaxation algorithm was constructed to slove the developed model where the dynamic programming was designed to solve batch-level subproblems,and two-stage heuristic was presented to construct a feasible schedule.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.4