A HYBRID HEURISTIC ALGORITHM FOR INTEGRATED PROBLEM OF MACHINE SCHEDULING AND UNIDIRECTIONAL FLOW PATH DESIGN
- Authors
- Zheng, Yan; Xiao, Yujie; Seo, Yoonho
- Issue Date
- 2015
- Publisher
- UNIV CINCINNATI INDUSTRIAL ENGINEERING
- Keywords
- integrated problem; flow path design; machine scheduling; flexible process plans; particle swarm optimization
- Citation
- INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, v.22, no.6, pp.717 - 728
- Indexed
- SCIE
SCOPUS
- Journal Title
- INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE
- Volume
- 22
- Number
- 6
- Start Page
- 717
- End Page
- 728
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/96312
- ISSN
- 1072-4761
- Abstract
- During the past few decades, unidirectional flow path design (UFD) and machines scheduling (MS) problems have been well-studied separately. However, only considering UFD or MS cannot guarantee the global optimal solution for the whole production. The reason is that UFD and MS are two correlated issues in the real production situation. This paper is to propose a new integrated model, called iUFD/MS, with the objective of minimizing makespan. In iUFD/MS, UFD and MS problems are simultaneously considered. Due to the high complexity of iUFD/MS, a hybrid heuristic algorithm based on the particle swarm optimization is developed to get an optimal or near-optimal solution within a reasonable time period. To validate our integrated model, a set of experiments is solved by applying the proposed solution method and the traditional method, respectively. The result shows that our integrated model can efficiently reduce makespan by 8.9% on average.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Industrial and Management Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholar.korea.ac.kr/handle/2021.sw.korea/96312)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.