期刊文献+

工件带安装时间的单机排序问题的列生成算法

Time-Indexed Formulations for 1|t_(i,j),r_i|∑w_iC_i:Column Generation
下载PDF
导出
摘要 在求解大规模NP-困难的最优化问题方法中,列生成技术越来越受到重视.本文研究工件带有与加工次序有关的安装时间的单机排序问题,首先构造它的时间标号模型,结合D-W分解技术和分支定界方法,给出它的列生成算法.其中时间标号模型的线性松弛为原问题提供了很好的下界,然后提出一个近似算法.通过实验数据表明,我们的算法对中等规模的排序问题1|t_(ij),r_j|∑w_jC_j是有效的. We consider the problem of sheduling jobs on single machine with the adjusted time among the processing so as to minmuize the total weighted completion time of jobs. Firstly, a time-indexed formulation is showed and we provide a column generation algorithm for the problem. Then we propose an approximation scheme based the time-indexed formulation. Our algorithms are capable of optmally solving medium sized problem within a resonable computational time.
出处 《运筹学学报》 CSCD 北大核心 2007年第3期65-74,94,共11页 Operations Research Transactions
基金 本文由国家自然科学基金(10371071) 上海市自然科学基金(03ZR14039)资助
关键词 运筹学 近似算法 幺模矩阵 分支定界 列生成算法 NP-困难 Operations research, column generation, totally unimodular, branch and bound, approximation scheme, NP-hardness
  • 相关文献

参考文献18

  • 1Allahverdi A.,Gupta J.N.D.and Aldowaisan T.A review of scheduling research involving setup considerations[J].OMEGA Internat Journal of Management science,1999,27:219-239.
  • 2Chen Z.L.and Powell W.B.Exact algorithm for scheduling multiple families of jobs on parallel machines[J].Naval Research Logistics,2003,50:823-840.
  • 3Chen Z.L.and Powell W.B.A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem[J].Eourpean Journal of Operational Research,1999,116:220-232.
  • 4Conway R.W.,Maxwell W.L.and Miller L.W.Theory of scheduling[M].Addison-Wesley,Reading,MA,1967.
  • 5Dantzig G.B.and Wolfe P.Decomposition principle for linear programs[J].Operations Research,1960,8:101-111.
  • 6Dyer M.E.and Wolsey L.A.Formulating the single maxhine sequencing problem with release dates as a mixed integer program[J].Discrete Applied Mathematics,1990,26:255-270.
  • 7Lasdon L.S.Optimization theory for large systems[M].Macmillan,New York,1970.
  • 8Lee Y.H.and Pinedo M.Scheduling jobs on parallel machines with sequence-dependent setup times[J].Eourpean Journal of Operational Research,1997,100:464-474.
  • 9Lenstra J.K.,Rinnooy Kan A.H.G.and Brucker P.Complexity of machine scheduling problem.Annals of Discrete Mathematics,1977,1:343-362.
  • 10Monma C.L.and Potts C.N.On the complexity of scheduling with batch setup times[J].Operations Research,1989,37:789-804.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部