摘要
通过对现有单机Ｅ／Ｔ（Ｅａｒｌｉｎｅｓｓ／Ｔａｒｄｉｎｅｓｓ）排序问题的研究，建立了一类相应的多机并行加工系统的Ｅ／Ｔ排序模型，模型的优化目标为工件排序的提前与拖期损失的总罚值为极小。还给出了一个工程实用型启发式排序算法。算法的计算复杂度小于Ｏ（ｍ×ｎ３）．最后还给出了应用该算法的实际算例。
Based on the systematic research on the sequencing problem of parts with Earliness and Tardiness constraints,a new sequencing model of parts with Earnness and Tardiness constraints for the parallel processing system is established in this paper,and a new heuristic alsorithm isput forward. The optimal goal of the model is to minimize the penalties of earnness and tardinessabout the sequenced parts. The complexity of the proposed algorithm is less than O (m × n2). A numerical example of the given algorithm is discussed finailly.
出处
《重庆大学学报（自然科学版）》
CAS
CSCD
1996年第6期54-60,共7页
Journal of Chongqing University
基金
国家863/CIMS项目
关键词
并行加工系统
排序
E/T排序模型
s: parallel processing system
sequence of ports / constrains of earliness and tardiness
