摘要
对于一批有特定加工次序要求的作业最少分组问题,提出了适当的实现方法,利用特殊的0-1规划,建立了一个适用的数学模型,并给出了相应的理论证明。数值试验表明提出的求解模型是有效的。
This paper investigates grouping problems for jobs with specific process sequence. We establish a proper model based on the 0-1 programming. Meanwhile, we proof that the model is feasible. The numerical simula-tion shows that the model is effective.
出处
《南京邮电大学学报（自然科学版）》
2007年第6期85-87,共3页
Journal of Nanjing University of Posts and Telecommunications：Natural Science Edition
关键词
分组
作业加工
0-1规划
Grouping
Process sequence
0-1 Programming
