系统工程理论与实践
繫統工程理論與實踐
계통공정이론여실천
Systems Engineering—Theory & Practice
2011年
2期
276~282
,共null页
变速机调度 优先序约束 动态规划 加工成本
變速機調度 優先序約束 動態規劃 加工成本
변속궤조도 우선서약속 동태규화 가공성본
scheduling of unrelated machines; precedence constraints; dynamic programming; processing costs
研究了工件具有任意标准优先序、一台机器在同一时间只可加工一个工件、最小化工件加工成本与机器使用成本之和的变速机调度问题.为该问题建立了DP模型,通过启发式规则和常规动态规划方法相结合、引入工件完工时间界限并保存每一步函数值,得到改进的DP算法,数值实验显示该算法具有较强的寻优能力和稳定性.
研究瞭工件具有任意標準優先序、一檯機器在同一時間隻可加工一箇工件、最小化工件加工成本與機器使用成本之和的變速機調度問題.為該問題建立瞭DP模型,通過啟髮式規則和常規動態規劃方法相結閤、引入工件完工時間界限併保存每一步函數值,得到改進的DP算法,數值實驗顯示該算法具有較彊的尋優能力和穩定性.
연구료공건구유임의표준우선서、일태궤기재동일시간지가가공일개공건、최소화공건가공성본여궤기사용성본지화적변속궤조도문제.위해문제건립료DP모형,통과계발식규칙화상규동태규화방법상결합、인입공건완공시간계한병보존매일보함수치,득도개진적DP산법,수치실험현시해산법구유교강적심우능력화은정성.
Scheduling of unrelated machines to minimize total costs of processing jobs and using machines subject to arbitrary standard precedence constraints is considered in this paper under the assumption that only one job is processed on one machine at the same time.A DP model is constructed for the problem,and an amended DP algorithm is derived through combining heuristic rule with conventional dynamic programming,introducing the bound of every job completion time and saving every function value.Numerical experiments are conducted to show that the algorithm has strong optimization capability and stability.
