科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper we investigate two-machine flow shop scheduling problems with deteriorating jobs and chain precedence constraints. We consider two types of precedence constraints. Under the first type constraints, a successor cannot start on any machine before its predecessor has been completed on the same machine. Under the second one, a successor cannot start on any machine before its predecessor has been completed on all machines. We show that the problem with the first type precedence constraints is polynomially solvable, and the problem with the second type precedence constraints is NP-hard in the strong sense.
- 出版日期2012-3
- 单位沈阳师范大学
