مشخصات پژوهش

صفحه نخست /A branch and bound algorithm ...
عنوان
A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations
نوع پژوهش مقاله چاپ‌شده
کلیدواژه‌ها
Scheduling, Hybrid flow shop, Assembly ,Branch and bound, Setup time
چکیده
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. The considered objective is to minimize the completion time of all products (makespan). 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.
پژوهشگران