4.7 Article

A GA/TS algorithm for the stage shop scheduling problem

期刊

COMPUTERS & INDUSTRIAL ENGINEERING
卷 61, 期 1, 页码 161-170

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2011.03.006

关键词

Scheduling; Mixed shop; General shop; Neighborhood

向作者/读者索取更多资源

This paper presents a special case of the general shop called stage shop problem. The stage shop is a more realistic generalization of the mixed shop problem. In the stage shop problem, each job has several stages of operations. In order to solve the stage shop problem with makespan objective function, an existing neighborhood of job shop is used. In this neighborhood, few enhanced conditions are proposed to prevent cycle generation. In addition, a new neighborhood for operations that belong to the same job is presented. These neighborhoods are applied to the stage shop problem in a tabu search framework. A genetic algorithm is used to obtain good initial solutions. An existing lower bound of the job shop is adapted to our problem and the computational results have been compared to it. Our algorithm has reached the optimal solutions for more than half of the problem instances. (C) 2011 Elsevier Ltd. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据