Efficient Heuristic Algorithm for Scheduling Two-Stage Hybrid Flowshop with Sequence-Dependent Setup Times
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 con...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2015-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2015/420308 |
id |
doaj-74e1016fc7a94fe3bdd131e921b759c5 |
---|---|
record_format |
Article |
spelling |
doaj-74e1016fc7a94fe3bdd131e921b759c52020-11-24T21:04:09ZengHindawi LimitedMathematical Problems in Engineering1024-123X1563-51472015-01-01201510.1155/2015/420308420308Efficient Heuristic Algorithm for Scheduling Two-Stage Hybrid Flowshop with Sequence-Dependent Setup TimesGeun-Cheol Lee0Jung Man Hong1Seong-Hoon Choi2College of Business Administration, Konkuk University, 120 Neungdong-ro, Gwangjin-gu, Seoul 143-701, Republic of KoreaLG CNS, FKI Tower, 24 Yeoui-daero, Yeongdeungpo-gu, Seoul 150-881, Republic of KoreaDepartment of Management Engineering, Sangmyung University, 31 Sangmyungdae-gil, Dongnam-gu, Cheonan, Chungnam 330-720, Republic of KoreaWe 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.http://dx.doi.org/10.1155/2015/420308 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Geun-Cheol Lee Jung Man Hong Seong-Hoon Choi |
spellingShingle |
Geun-Cheol Lee Jung Man Hong Seong-Hoon Choi Efficient Heuristic Algorithm for Scheduling Two-Stage Hybrid Flowshop with Sequence-Dependent Setup Times Mathematical Problems in Engineering |
author_facet |
Geun-Cheol Lee Jung Man Hong Seong-Hoon Choi |
author_sort |
Geun-Cheol Lee |
title |
Efficient Heuristic Algorithm for Scheduling Two-Stage Hybrid Flowshop with Sequence-Dependent Setup Times |
title_short |
Efficient Heuristic Algorithm for Scheduling Two-Stage Hybrid Flowshop with Sequence-Dependent Setup Times |
title_full |
Efficient Heuristic Algorithm for Scheduling Two-Stage Hybrid Flowshop with Sequence-Dependent Setup Times |
title_fullStr |
Efficient Heuristic Algorithm for Scheduling Two-Stage Hybrid Flowshop with Sequence-Dependent Setup Times |
title_full_unstemmed |
Efficient Heuristic Algorithm for Scheduling Two-Stage Hybrid Flowshop with Sequence-Dependent Setup Times |
title_sort |
efficient heuristic algorithm for scheduling two-stage hybrid flowshop with sequence-dependent setup times |
publisher |
Hindawi Limited |
series |
Mathematical Problems in Engineering |
issn |
1024-123X 1563-5147 |
publishDate |
2015-01-01 |
description |
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. |
url |
http://dx.doi.org/10.1155/2015/420308 |
work_keys_str_mv |
AT geuncheollee efficientheuristicalgorithmforschedulingtwostagehybridflowshopwithsequencedependentsetuptimes AT jungmanhong efficientheuristicalgorithmforschedulingtwostagehybridflowshopwithsequencedependentsetuptimes AT seonghoonchoi efficientheuristicalgorithmforschedulingtwostagehybridflowshopwithsequencedependentsetuptimes |
_version_ |
1716771831751376896 |