Browse

시종점 시간 간격이 있는 스케줄링 문제의 계산 복잡도
(The) computational complexity of the machine scheduling problem with time interval constraint in start and completion time

DC Field Value Language
dc.contributor.advisor홍성필-
dc.contributor.author송호석-
dc.date.accessioned2009-11-09T09:52:33Z-
dc.date.available2009-11-09T09:52:33Z-
dc.date.copyright2009.-
dc.date.issued2009-
dc.identifier.urihttp://dcollection.snu.ac.kr:80/jsp/common/DcLoOrgPer.jsp?sItemId=000000036824kor
dc.identifier.urihttps://hdl.handle.net/10371/11697-
dc.description학위논문(석사) --서울대학교 대학원 :산업공학과, 2009.2.kor
dc.format.extentiv, 21장kor
dc.language.isokokor
dc.publisher서울대학교 대학원kor
dc.subject시종점 시간 간격kor
dc.subjectTime Interval Constraint in Start and Completion Timekor
dc.subject스케줄링kor
dc.subjectschedulingkor
dc.subject계산 복잡도kor
dc.subjectcomputational complexitykor
dc.subject가중치kor
dc.subjectweightkor
dc.title시종점 시간 간격이 있는 스케줄링 문제의 계산 복잡도kor
dc.title.alternative(The) computational complexity of the machine scheduling problem with time interval constraint in start and completion timekor
dc.typeThesis-
dc.contributor.department산업공학과-
dc.description.degreeMasterkor
Appears in Collections:
College of Engineering/Engineering Practice School (공과대학/대학원)Dept. of Industrial Engineering (산업공학과)Theses (Master's Degree_산업공학과)
Files in This Item:
There are no files associated with this item.
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse