摘要
探讨装配式作业排序问题的计算复杂性，证明了在优化指标为作业排序长度的条件下该问题是ＮＰ－完全问题。
This paper explores into the computational complexity of scheduling problem in assembly flow shop.It has proved that the problem is of NP complete problem when the optimization objective involves the make span.
关键词
计算复杂性
装配式作业
排序问题
scheduling multi processor tasks
computational complexity
NP complete problem
assembly flow shop
