Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015 (2015), Article ID 420308, 10 pages
http://dx.doi.org/10.1155/2015/420308
Research Article

Efficient Heuristic Algorithm for Scheduling Two-Stage Hybrid Flowshop with Sequence-Dependent Setup Times

1College of Business Administration, Konkuk University, 120 Neungdong-ro, Gwangjin-gu, Seoul 143-701, Republic of Korea
2LG CNS, FKI Tower, 24 Yeoui-daero, Yeongdeungpo-gu, Seoul 150-881, Republic of Korea
3Department of Management Engineering, Sangmyung University, 31 Sangmyungdae-gil, Dongnam-gu, Cheonan, Chungnam 330-720, Republic of Korea

Received 29 January 2015; Revised 30 April 2015; Accepted 30 April 2015

Academic Editor: Yunqiang Yin

Copyright © 2015 Geun-Cheol Lee et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

We propose an efficient heuristic algorithm for two-stage hybrid flowshop scheduling with sequence-dependent setup times. In the past, metaheuristic approaches, which usually need long time, have been mostly used for the problem. In this study, due to practical reasons of the application that we consider, we need to obtain the solution of the problem within a reasonably short computational time, even for large-sized problems. In this study, we devise the proposed algorithm as a hybrid of two methods, that is, the beam search and NEH method, and we compare the performances with other existing local search methods. The results of the computational experiments show that the proposed algorithm solves the problems in a relatively shorter computation time, while the scheduling performances are superior to the existing methods.