Decision Tree based Scheduling for Static and Dynamic Flexible Job Shops with Multiple Process Plans다중 공정계획을 가지는 정적/동적 유연 개별공정에 대한 의사결정 나무 기반 스케줄링
- Other Titles
- 다중 공정계획을 가지는 정적/동적 유연 개별공정에 대한 의사결정 나무 기반 스케줄링
- Authors
- 유재민; 도형호; 권용주; 신정훈; 김형원; 남성호; 이동호
- Issue Date
- Jan-2015
- Publisher
- 한국정밀공학회
- Keywords
- Flexible job shop (유연개별공정); Scheduling (일정계획); Multiple process plans (다중 공정계획); Decision tree (의사결정나무)
- Citation
- 한국정밀공학회지, v.32, no.1, pp.25 - 37
- Indexed
- KCI
- Journal Title
- 한국정밀공학회지
- Volume
- 32
- Number
- 1
- Start Page
- 25
- End Page
- 37
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/158012
- DOI
- 10.7736/KSPE.2015.32.1.25
- ISSN
- 1225-9071
- Abstract
- This paper suggests a decision tree based approach for flexible job shop scheduling with multiple process plans. The problem is to determine the operation/machine pairs and the sequence of the jobs assigned to each machine. Two decision tree based scheduling mechanisms are developed for static and dynamic flexible job shops. In the static case, all jobs are given in advance and the decision tree is used to select a priority dispatching rule to process all the jobs. Also, in the dynamic case, the jobs arrive over time and the decision tree, updated regularly, is used to select a priority rule in real-time according to a rescheduling strategy. The two decision tree based mechanisms were applied to a flexible job shop case with reconfigurable manufacturing cells and a conventional job shop, and the results are reported for various system performance measures.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 산업공학과 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/158012)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.