期刊
12TH GLOBAL CONGRESS ON MANUFACTURING AND MANAGEMENT (GCMM - 2014)
卷 97, 期 -, 页码 1524-1533出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.proeng.2014.12.436
关键词
Flow shop scheduling; Flexible Manufacturing System; Sequence dependent setup time; Makespan; Artificial immune system algorithm; Simulated annealing algorithm
The flow shop manufacturing cell scheduling problem with sequence dependent setup time is a topic of great concern for many industrial applications. This paper addresses batch scheduling problem in the Multi cell Flexible Manufacturing System (MCFMS) havingsequence dependent batch set up time with flow shop characteristics. The objective of this research problem is the minimization of makespan. A mathematical model for the research problem is developed in this paper. As the research problem is known to be NP-hard, Artificial Immune Systems (AIS) algorithm and Simulated annealing algorithm (SA) algorithm are developed to solve the problem. Eighty test problems are solved in order to test the proposed algorithms. The quality of solution in terms of makespan obtained by AIS algorithm is found superior to that of the SA algorithm. But in computational point of view, SA algorithm takes shorter time than AIS algorithm to find the near optimal batch sequence. Since the operation parameters of meta-heuristic algorithms normally affect the quality of the solution, Sensitive Analysis is carried out for the test problems by varying the percentage of receptor editing in AIS algorithm. (C) 2014 The Authors. Published by Elsevier Ltd.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据