Publications
Detailed Information
시종점 시간 간격이 있는 스케줄링 문제의 계산 복잡도 : (The) computational complexity of the machine scheduling problem with time interval constraint in start and completion time
Cited 0 time in
Web of Science
Cited 0 time in Scopus
- Authors
- Advisor
- 홍성필
- Issue Date
- 2009
- Publisher
- 서울대학교 대학원
- Keywords
- 시종점 시간 간격 ; Time Interval Constraint in Start and Completion Time ; 스케줄링 ; scheduling ; 계산 복잡도 ; computational complexity ; 가중치 ; weight
- Description
- 학위논문(석사) --서울대학교 대학원 :산업공학과, 2009.2.
- Language
- Korean
- URI
- http://dcollection.snu.ac.kr:80/jsp/common/DcLoOrgPer.jsp?sItemId=000000036824
https://hdl.handle.net/10371/11697
- Files in This Item:
- There are no files associated with this item.
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.