http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
황학진,김미나,박대환,이재설 대한산업공학회 2009 대한산업공학회 추계학술대회논문집 Vol.2009 No.10
We consider two-dimensional vector packing problem where each item has size greater than 1/3 in either x- or y-coordinates. In this paper, we prove that the problem is NP-Complete in the strong sense. Hence, there exists no polynomial time optimal algorithm unless P = NP.
오목생산비용 납기구간 롯사이징 문제에 대한 슈도폴리노미얼 알고리듬
황학진,Wikrom Jaruphongsa 한국경영공학회 2009 한국경영공학회지 Vol.14 No.2
In this paper, we consider a dynamic lot‐sizing problem with time windows in which production cost functions are concave. For this problem we present an O(n2T4) pseudo‐polynomial time algorithm where n is the number of demands, T is the length of the planning horizon and is the total sum of demand requirements.
황학진 한국경영공학회 2006 한국경영공학회지 Vol.11 No.3
We deal with twodimensional vector packing problem where each item has size in x and ycoordinates. The items considered are coils being attributed by weight (xsize) and width (ysize), which must be packed into bin called cassette. Each coil has dense sizes with weight in 1/8, 1/3 and width in 1/6, 1/3 when scaling both the weight and width capacities to 1. For this problem we apply a known algorithm and prove that it is a 5/4approximation algorithm for the special case that all the bins have five items in an optimal packing.