http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
강장하 조선대학교 공학기술연구원 2017 공학기술논문지 Vol.10 No.4
The ability to dynamically reschedule jobs is core of flexible manufacturing system. Reinforcement learning, a machine learning approach undergoing development in various control systems, offers advantages in dynamic environments. This paper presents a feasibility study on the reinforcement learning for a dynamic scheduling problem.
A New Mathematical Formulation for Generating a Multicast Routing Tree
강장하,강동한,박성수 한국경영과학회 2006 Management Science and Financial Engineering Vol.12 No.2
To generate a multicast routing tree guaranteeing the quality of service (QoS), we consider the hop constrained Steiner tree problem and propose a new mathematical formulation for it, which contains fewer constraints than a known formulation. An efficient procedure is also proposed to solve the problem. Preliminary tests show that the procedure reduces the computing time significantly.
크기가 다양한 bin-packing 문제에 대한 algorithm
강장하,박성수 한국경영과학회 2000 한국경영과학회 학술대회논문집 Vol.- No.1
In this paper, we consider variable sized bin packing problem, where the objective is not to minimize the total space used in the packing but to minimize the total cost of the packing when the cost of unit size of each bin does not increase as the bin size increases. A heuristic algorithm is described, and analyzed in two special cases: 1)b_m|…|b_1 and W_n|…|W_1 and 2)b_m|…|b_1, where b_i denotes the size of i-th type of bin and w_j denotes the size of j-th item, In the case 1), the algorithm guarantees optimality, and in the case 2), it guarantees asymptotic worst-case performance bounds of 11/9
신재생 전력 생산의 수익성 극대화를 위한 수전해시스템 운영계획 최적화 모델 검증
강장하 조선대학교 공학기술연구원 2022 공학기술논문지 Vol.15 No.4
This paper introduces a recent research result of a scheduling approach to maximize the profitability of alkaline water electrolysis (AWE) system powered by hybrid energy sources: solar power and grid electricity supply. It contains a nonlinear mixed integer programming model (NLMIP) for the short period hydrogen generation planning. This paper shows that the NLMIP model has a serious error and introduces a correction for the error.
Hop-constrained multicast route packing with bandwidth reservation
강장하,박성수 한국경영과학회 2002 한국경영과학회 학술대회논문집 Vol.- No.1(1)
Multicast technology allows the transmission of data from one source node to a selected group of destination nodes. Multicast routes typically use trees, called multicast routing trees, to minimize resource usage such as cost and bandwidth by sharing links. Moreover, the quality of service (QoS) is satisfied by distributing data along a path having no more than a given number of arcs between the root node of a session and a terminal node of it in the routing tree. Thus, a multicast routing tree for a session can be represented as a hop constrained Steiner tree. In this paper, we consider the hop-constrained multicast route packing problem with bandwidth reservation. Given a set of multicast sessions, each of which has a hop limit constraint and a required bandwidth, the problem is to determine a set of multicast routing trees in an arc-capacitated network to minimize cost. We propose an integer programming formulation of the problem and an algorithm to solve it. An efficient column generation technique to solve the linear programming relaxation is proposed, and a modified cover inequality is used to strengthen the integer programming formulation.