摘要
本文研究了带有资源约束的两台机器流水作业中的最小排序长度问题,并证明了[4,5]中提出的F2|pmtn、res 111|C_(max)是强NP—困难的。
The problem of minimizing the schedule length of the system of flow-shop on two machines is studied in the case where the resources constraints are introduced. It is proved that F2|pmtn, res 111|Cmax is strongly NP-complete which was put forward in [4, 5].
基金
贵州省科学技术基金
关键词
排序问题
流水作业
NP困难
scheduling
the system of flow-shop
resources
NP-complete.
