科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper we consider two-machine flow shop scheduling with two agents. Two models are investigated. One is the weighted-sum optimization model and the other is the constrained optimization model. For the former, we show that it is weakly NP-hard and propose a fully polynomial time approximation scheme. For the latter, we also show the problem is weakly NP-hard. With violating the constraint a factor of epsilon a fully polynomial time approximation scheme is provided.
- 出版日期2012-10
- 单位浙江大学
