文献概要中英文对照.docVIP

1、A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations(一个建立在时间和装配业务分支定界算法，以解决混合流水车间调度问题) A hybrid flow shop scheduling problem (HFSP) with assembly operations is studied in this paper. In the considered problem, a number of products of the same kind are produced. Each product is assembled using a set of several parts. At first, the parts are produced in a hybrid flow shop and then they are assembled in an assembly stage to produce products. This problem has been proved strongly NP-hard, so in order to solve it, a hierarchical branch and