首页 | 本学科首页   官方微博 | 高级检索  
     检索      

最小耗费切割序问题
引用本文:孙剑峰,刘贺斌,方加来.最小耗费切割序问题[J].福州大学学报(自然科学版),2000,28(1):11-15.
作者姓名:孙剑峰  刘贺斌  方加来
作者单位:福州大学计算机科学与技术系!福建福州350002
摘    要:针对在加工费用尽可能少的条件下合理安排切割次序问题,相继建立了基本模型和改进模型,基本模型简单,有效,在不考虑调整刀具所需费用的情况下,对所有合法输入的数据均能求出最优切割次序.改进模型在基本模型的基础上加进了对调整刀具费用的考虑,通过对各种情况的分析得到一种对调整刀具费用的任一确定值都能得到最优切割次序的方法.这两种模型的解决方案均已在计算机上实现.

关 键 词:截断切割  冗余块长  切割次序  贪心算法
文章编号:1000-2243(2000)01-0011-05
修稿时间:1999年3月17日

Mininal Cost of Cut Order
SUN Jian-feng,LIU He-bin,FANG Jia-lai.Mininal Cost of Cut Order[J].Journal of Fuzhou University(Natural Science Edition),2000,28(1):11-15.
Authors:SUN Jian-feng  LIU He-bin  FANG Jia-lai
Institution:(Department of Computer Science and Technology, Fuzhou University, Fujian Fuzhou 350002, China)
Abstract:Cut off machining pattern is widely used in industrial, and the cut order should be arranged so as to cheapen the cost. In this paper a fundamental model and its improved one are established. The fundamental model is simple and effective, which, without considering the coal of adjusting machine, can be used to get optimum cut order out of all correctly input data. Based on the fundamental model, the improved model is established taking the cost of adjusting machine into account, which can get optimum cut order for any of the determinate cost of adjusting machine. Both model have been implemented on computer.
Keywords:cut off  redundant length  cut order  greedy algorithm
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《福州大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《福州大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号