期刊
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
卷 20, 期 6, 页码 464-473出版社
SPRINGER-VERLAG LONDON LTD
DOI: 10.1007/s001700200179
关键词
branch-and-bound algorithm; flowshop scheduling problem; genetic algorithm; heuristic algorithm; local search method; memetic algorithm
Machine scheduling has been a popular area of research during the past four decades. Its object is to determine the sequence for processing jobs on a given set of machines. The need for scheduling arises from the limited resources available to the decision-maker. In this study, a special situation involving a computationally difficult n/2/Flowshop/alphaF + betaC(max) flowshop scheduling problem is discussed. We develop a memetic algorithm (MA, a hybrid genetic algorithm) by combining a genetic algorithm and the greedy heuristic using the pairwise exchange method and the insert method, to solve the n/2/Flowshop/alphaF + betaC(max) flowshop scheduling problem. Preliminary computational experiments demonstrate the efficiency and performance of the proposed memetic algorithm. Our results compare favourably with the best-known branch-and-bound algorithm, the traditional genetic algorithm and the best-known heuristic algorithm.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据