Browse

Two-machine flow shop scheduling to minimize the weighted number of early and tardy jobs
흐름 공정의 작업 개수 가중치 합 최소화 문제에 관한 연구

DC Field Value Language
dc.contributor.advisor정성진-
dc.contributor.author홍지헌-
dc.date.accessioned2009-11-09T14:27:27Z-
dc.date.available2009-11-09T14:27:27Z-
dc.date.copyright2005.-
dc.date.issued2005-
dc.identifier.urihttp://dcollection.snu.ac.kr:80/jsp/common/DcLoOrgPer.jsp?sItemId=000000050993eng
dc.identifier.urihttp://hdl.handle.net/10371/11769-
dc.descriptionThesis(master`s)--서울대학교 대학원 :산업공학과,2005.eng
dc.format.extentiv, 39 leaveseng
dc.language.isoen-
dc.publisher서울대학교 대학원eng
dc.subject스케줄링eng
dc.subjectSchedulingeng
dc.subject흐름공정eng
dc.subjectFlow shopeng
dc.subject혼합정수계획법eng
dc.subjectMixed integer programmingeng
dc.subject절단eng
dc.subjectCutseng
dc.subject휴리스틱 알고리즘eng
dc.subjectHeuristic algorithmeng
dc.titleTwo-machine flow shop scheduling to minimize the weighted number of early and tardy jobseng
dc.title.alternative흐름 공정의 작업 개수 가중치 합 최소화 문제에 관한 연구eng
dc.typeThesis-
dc.contributor.department산업공학과-
dc.description.degreeMastereng
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