研究了工件操作长度为1或0的自由作业问题。在不同目标函数下,用数学规划及组合方法设计相应的多项式时间算法。
Open-shop problem under different objectives is studied. On the assumption of unit or zero length job operation, using mathematical programming and combinational methodologies, polynomial algorithm for each of problems studied is proposed.