Integrating analytical hierarchy process to genetic algorithm for re-entrant flow shop scheduling problem
This research considers a hybrid flow shop scheduling problem with dynamic re-entrant characteristics substantiated by the complexity of the problem in a repairing company. Multiple types of jobs are involved in the problem with individual buffer times that are strongly related to the previous proce...
Saved in:
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/101578 http://hdl.handle.net/10220/16807 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-101578 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1015782020-03-07T13:22:19Z Integrating analytical hierarchy process to genetic algorithm for re-entrant flow shop scheduling problem Lee, C. K. M. Lin, Danping Wu, Zhang School of Mechanical and Aerospace Engineering DRNTU::Engineering::Mechanical engineering This research considers a hybrid flow shop scheduling problem with dynamic re-entrant characteristics substantiated by the complexity of the problem in a repairing company. Multiple types of jobs are involved in the problem with individual buffer times that are strongly related to the previous processing job. These jobs need to go through tandem workstations, while some jobs may re-enter the processing line more than once. In order to reduce complexity, jobs are considered as basic units for scheduling. A novel combination of the analytical hierarchy process (AHP) and genetic algorithm (GA) is proposed to deal with the dynamic re-entrant scheduling problem which takes many criteria into consideration. GA is applied to obtain near-optimal schedules, while AHP works with a twofold effect. One is to fulfil the multiple criteria, while the other is adopted in the selection process of GA to fasten GA's convergence speed. The proposed model and solution algorithm are applied to solve the problem in a repairing company under a set of actual constraints. Comprehensive studies are conducted with real-life data. The results are consistent with the company operational scenario and are better than those of the manual schedules. 2013-10-24T07:50:08Z 2019-12-06T20:40:49Z 2013-10-24T07:50:08Z 2019-12-06T20:40:49Z 2012 2012 Journal Article Lin, D., Lee, C.K.M., & Wu, Z. (2012). Integrating analytical hierarchy process to genetic algorithm for re-entrant flow shop scheduling problem. International journal of production research, 50(7), 1813-1824. https://hdl.handle.net/10356/101578 http://hdl.handle.net/10220/16807 10.1080/00207543.2011.561884 en International journal of production research |
institution |
Nanyang Technological University |
building |
NTU Library |
country |
Singapore |
collection |
DR-NTU |
language |
English |
topic |
DRNTU::Engineering::Mechanical engineering |
spellingShingle |
DRNTU::Engineering::Mechanical engineering Lee, C. K. M. Lin, Danping Wu, Zhang Integrating analytical hierarchy process to genetic algorithm for re-entrant flow shop scheduling problem |
description |
This research considers a hybrid flow shop scheduling problem with dynamic re-entrant characteristics substantiated by the complexity of the problem in a repairing company. Multiple types of jobs are involved in the problem with individual buffer times that are strongly related to the previous processing job. These jobs need to go through tandem workstations, while some jobs may re-enter the processing line more than once. In order to reduce complexity, jobs are considered as basic units for scheduling. A novel combination of the analytical hierarchy process (AHP) and genetic algorithm (GA) is proposed to deal with the dynamic re-entrant scheduling problem which takes many criteria into consideration. GA is applied to obtain near-optimal schedules, while AHP works with a twofold effect. One is to fulfil the multiple criteria, while the other is adopted in the selection process of GA to fasten GA's convergence speed. The proposed model and solution algorithm are applied to solve the problem in a repairing company under a set of actual constraints. Comprehensive studies are conducted with real-life data. The results are consistent with the company operational scenario and are better than those of the manual schedules. |
author2 |
School of Mechanical and Aerospace Engineering |
author_facet |
School of Mechanical and Aerospace Engineering Lee, C. K. M. Lin, Danping Wu, Zhang |
format |
Article |
author |
Lee, C. K. M. Lin, Danping Wu, Zhang |
author_sort |
Lee, C. K. M. |
title |
Integrating analytical hierarchy process to genetic algorithm for re-entrant flow shop scheduling problem |
title_short |
Integrating analytical hierarchy process to genetic algorithm for re-entrant flow shop scheduling problem |
title_full |
Integrating analytical hierarchy process to genetic algorithm for re-entrant flow shop scheduling problem |
title_fullStr |
Integrating analytical hierarchy process to genetic algorithm for re-entrant flow shop scheduling problem |
title_full_unstemmed |
Integrating analytical hierarchy process to genetic algorithm for re-entrant flow shop scheduling problem |
title_sort |
integrating analytical hierarchy process to genetic algorithm for re-entrant flow shop scheduling problem |
publishDate |
2013 |
url |
https://hdl.handle.net/10356/101578 http://hdl.handle.net/10220/16807 |
_version_ |
1681035874591047680 |