文献概要中英文对照..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 bound algorithm is presented. Also, some lower and upper bounds are developed to increase the efficiency of the proposed algorithm. The numerical experiments are used to evaluate the performance of the proposed algorithm（这篇文章是对带有装配业务的混合流水车间调度问题（HFSP）的研究。在所考虑的问题中，同类产品是批生产的。每个产品都是由几部分组合起来的。开始，零件在混合流水车间进行生产，然后在装配阶段装配，形成产品。这个问题已经被NP-hard强烈证明了的。（即认为这类问题不能精确求解，只能寻求有效的近似算法）。所以，为了解决它，就提出了分层分支定界算法。同时，上界与下界的开发也是为了提高该算法的效率。而数值实验是用来评估算法的性能的。） Suppose that one kind of product with a quantity of demand (H) is considered. Each product is made by assembling a set of several different parts (j=1,2...,/J/). At first, the parts are manufactured in a two stage hybrid flow shop. Each part j has a stochastic processing time Plj on stage L. After manufacturing the parts, they are assembled into the products on an assembly stage. The machines are identical in the hybrid flow shop and the number of machines is K1 on stage L. Setup operations are needed when a machine starts processing a part or it changes items. The assembly operations cannot be started for a product until the set of parts is completed in machining operations. The considered objective is to minimize the completion time of all products (makespan).（假设一种产品的需求量为H。每个产品是由一组若干不同的部件（j=1，2，……， J）组装。一开始，零部件在混合流水车间进行两个阶段的制造。每个部分都有一个随机加工时间Plj在阶段L上。零部件在生产完后在组装阶段上被组装成产品。假设混合流水车间的机器都是相同的，且有机器数量K1 在阶段L上。假设机器在启动后就不能中途改变原本设定，零件在批生产未完成时也不能进行装配操作。最终考虑的目