Cited 0 time in
다중 공정계획을 가지는 유연 개별공정 일정계획 문제에 대한 우선순위 규칙 기반 알고리듬Priority rule based algorithms for flexible job shop scheduling with multiple process plans
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1366
COPYRIGHT © 2024 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
