author Kidong Kim 
2nd author Hanil Jeong
Daeyoung Chung
Jinwoo Park 
info 대한산업공학회지, Vol. 23, No. 2, pp.323-342, 1997 
year 1997 
c DJ 
저널/학회 산업공학 
group  
keyword  
abstract Traditionally,the Process Planning problems and the Scheduling problems have been considered as independent ones. However,we can take much advantages by solving the two problems simultaneously. In this paper,we deal with the enlarged problem that takes into account both the process planning and the scheduling problems. And we present a solution algorithm for the problem assuming that the given process plan process plan data is represented by AND/OR graph. A mathematical mode(mixed ILP model) whose objective is the minimization of the makespan,is formulated. We found that we can get the optimal solutions of the small-size problems within reasonable time limits,but not the large-size problems. So we devised an algorithm based on the decomposition strategy to solve the large-scale problems (realistic problems) within practical time limits. 
번호 c 저널/학회 group 제목 author year

등록된 글이 없습니다.