摘要
该文考虑下述订单问题:m份订单中共有n个工件需要在同一台机器上加工,这n个工件分属k种不同的类,当机器从加工某一类中的工件转向加工不同于它的第j类工件时,需要一个安装时间Sj,机器加工第一个工件前也有相应于该工件所属类的安装时间.目标是寻找一个使得m份订单的完工时间之和最小的加工顺序.文中根据安装时间、订单完工的定义的不同,分了三种情形,并分别给出了多项式时间算法、分枝定界算法和启发式算法.
This paper considers the following sequencing problem:n jobs coming from m different orders need to be processed in the same machine, and these jobs belong to k different classes. A setup time Sj is needed before the machine processes a job coming from class j while the just finished job belongs to a different class, and a setup time Sb is also needed before the machine processes the first job in class b. The goal is to minimize the aggregate time for completion of these m orders. Corresponding to three different models of this sequencing problem, this paper gives a polynomial algorithm, a branch and bound algorithm and a heuristic methods, respectively.
出处
《上海大学学报（自然科学版）》
CAS
CSCD
2003年第5期438-444,共7页
Journal of Shanghai University:Natural Science Edition
关键词
排序
订单
总完工时间
算法
sequencing
order
total competion time
algorithm
