期刊文献+

一类3×n流水型排序问题新近似最优解法的探讨 被引量:1

A study of new near optimal method for one kind of 3×n water-flowing ordering problems
下载PDF
导出
摘要 3×n流水型排序问题解法较多,有些方法虽简单,但效果不佳。同时也没给出适用条件。为了解决这一问题,针对3×n流水型排序的特点,提出了新的解法及其适用条件。新解法从缩短关键线路的长度的角度出发,利用均衡原理,虽比关键加工中心法稍微复杂,但优化程度明显,更接近最优解,此外,新解法在多数情况下可以判断是否达到最优解,且比较容易得到最优解。 There are many methods for solving 3×n water-flowing ordering problems.Although some methods are simple,the result is not good,they do not provide the suitable condition either at the same time.To solve the problem,the new solution and suitable condition has been put forward according to the characteristic of 3×n water-flowing ordering.Although it is a little more complicate than the key machining center method,its optimized degree is obvious and more close to the optimized solution.Besides,in the most case,the new solution can judge whether or nor the result is optimal solution.The optimal solution can be also more easily gotten.
作者 贾春玉
出处 《长春大学学报》 2004年第6期62-65,共4页 Journal of Changchun University
关键词 流水型排序 关键零件法 关键加工中心法 新解法 water-flowing order key component method key machining centre method new solution
  • 相关文献

参考文献5

二级参考文献4

  • 1谢柏林.简易排序方法——最小系数法[J].管理现代化,1983,3(1). 被引量:5
  • 2JOHNSON S M. Optimal two-and three-stage production schedule with setup time included [ J ]. Naval Res Lo gist Quarter, 1954(1): 61 -68. 被引量:1
  • 3PALMER D S. Sequencing jobs through a multi-stage process in the minmum total time-a quick method of ob taining a near optimal [ J ]. Operation Research Quart, 1965(16): 101 -107. 被引量:1
  • 4GUPTA J N D. Heuristic algorithms for the exact solu tion of the three-machine scheduling problem. [ J] Management Science, 1972(16): 11 - 18. 被引量:1

共引文献12

同被引文献57

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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