期刊名称：International Journal of Industrial Engineering Computations
印刷版ISSN：1923-2926
电子版ISSN：1923-2934
出版年度：2013
卷号：4
期号：3
页码：393-416
DOI：10.5267/j.ijiec.2013.03.004
语种：English
出版社：Growing Science Publishing Company
摘要：This paper presents a two-stage hybrid flow shop scheduling problem with setup and assembly operations. The proposed study of this paper considers one kind of product with a quantity of demand where each product is made by assembling a set of different parts. At first, the parts are manufactured in a two-stage hybrid flow-shop and then the parts are assembled into products on assembly stage. Setup operations are needed when a machine starts processing the parts or it changes items. The considered objective is minimizing the completion time of all products. Since the problem is classified as NP-hard class, a combinatorial algorithm is proposed. The proposed algorithm is a three-step procedure where we use heuristic, genetic algorithm (GA), simulated annealing (SA), NEH and Johnson’s algorithm. Three lower bounds are presented and improved to evaluate the proposed algorithms. An extensive computational experiment is conducted to compare the performances of the proposed algorithms.
