• 융합정보논문지
• /
• 제9권12호
• /
• pp.124-132
• /
• 2019

일정계획은 오프라인(offline) 일정계획과 온라인(online) 일정계획으로 구분할 수 있고, 본 논문은 온라인 상황에서 병렬설비의 주기적 일정계획 수립문제를 다룬다. 도착시간(ready time)이 다른 여러 작업들에 대해 makespan을 최소화하기 위한 작업 일정계획 알고리즘 개발이 목적이다. 이를 위해 각 설비에서의 작업처리 순서는 ERD(Earliest Ready Date) 규칙에 따른 순서가 최적임을 밝혔다. 각 설비 별 배정 작업도 결정 해야하는 병렬설비 문제를 위해서는 혼합정수계획모형(MIP)을 이용하는 알고리즘을 제시하였다. 개발한 알고리즘의 유용성과 성능분석을 위해 수치 예를 활용하여 오프라인 일정계획과 비교하였다. 비교분석 결과, 오프라인 일정계획에 비해 매우 빠른 시간에 일정계획을 수립할 수 있음을 보였고, 주기시간의 감소를 통한 makespan의 단축 가능성을 보였다. 본 논문의 주기적 일정계획 방법은 계획수립을 위한 시간이 매우 작으므로, 설비 및 작업의 수가 많은 온라인 환경에서도 활용할 수 있다. 더불어서 스마트공장이나 블록체인 플랫폼에서의 작업일정 수행을 위해 활용될 수 있을 것으로 기대한다.

• 산업경영시스템학회지
• /
• 제21권48호
• /
• pp.299-310
• /
• 1998

Actually mixed assembly line is mixed with open and close type workstation. This workstation is called hybridworkstation. The propose of this paper is to determine the sequencing of model that minimize line length for actual(hybridworkstation) mixed model assembly line. we developed three mathematical formulation of the problem to minimize the overall length of a line with hybrid station. Mathematical formulation classified model by operato schedule. Mixed model assembly line is combination program and NP-hard program. Thus computation time is often a critical factor in choosing a method of determining the sequence. This study suggests a tabu search technique which can provide a near optimal solution in real time and use the hill climbing heuristic method for selecting initial solution. Modified tabu search method is compared with MIP(Mixed Integer Program). Numerical results are reported to demonstrate the efficiency of the method.

• 산업경영시스템학회지
• /
• 제39권2호
• /
• pp.88-102
• /
• 2016

This paper considers the allocation and engagement scheduling problem of interceptor missiles, and the problem was formulated by using MIP (mixed integer programming) in the previous research. The objective of the model is the maximization of total intercept altitude instead of the more conventional objective such as the minimization of surviving target value. The concept of the time window was used to model the engagement situation and a continuous time is assumed for flying times of the both missiles. The MIP formulation of the problem is very complex due to the complexity of the real problem itself. Hence, the finding of an efficient optimal solution procedure seems to be difficult. In this paper, an efficient genetic algorithm is developed by improving a general genetic algorithm. The improvement is achieved by carefully analyzing the structure of the formulation. Specifically, the new algorithm includes an enhanced repair process and a crossover operation which utilizes the idea of the PSO (particle swarm optimization). Then, the algorithm is throughly tested on 50 randomly generated engagement scenarios, and its performance is compared with that of a commercial package and a more general genetic algorithm, respectively. The results indicate that the new algorithm consistently performs better than a general genetic algorithm. Also, the new algorithm generates much better results than those by the commercial package on several test cases when the execution time of the commercial package is limited to 8,000 seconds, which is about two hours and 13 minutes. Moreover, it obtains a solution within 0.13~33.34 seconds depending on the size of scenarios.

• Geomechanics and Engineering
• /
• 제20권5호
• /
• pp.411-420
• /
• 2020

Numbers fitting-curve equations have been proposed to predict soil-water retention curve (SWRC) whose parameters have no definitude physical meaning. And these methods with precondition of measuring SWRC data is time-consuming. A simplified directly method to estimate SWRC without parameters obtained by fitting-curve is proposed. Firstly, the total SWRC can be discretized into linear segments respectively. Every segment can be represented by linear formulation and every turning point can be determined by the pore-size distribution (PSD) of Mercury Intrusion Porosimetry (MIP) tests. The pore diameters governing the air-entry condition (AEC) and residual condition (RC) can be determined by the PSDs of MIP test. The PSD changes significantly during drying in SWR test, so the determination of AEC and RC should use the PSD under corresponding suction conditions. Every parameter in proposed equations can be determined directly by PSD without curve-fitting procedure and has definitude physical meaning. The proposed equations give a good estimation of both unimodal and bimodal SWRCs.

• KIEE International Transactions on Power Engineering
• /
• 제5A권4호
• /
• pp.311-321
• /
• 2005

A competitive generating company (GENCO) could maximize its payoff by optimizing its generation assets. This paper considers the GENCO's arbitrage problem using price-based unit commitment (PBUC). The GENCO could consider arbitrage opportunities in purchases from qualifying facilities (QFs) as well as simultaneous trades with spots markets for energy, ancillary services, emission, and fuel. Given forecasted hourly market prices for each market, the GENCO's generating asset arbitrage problem is formulated as a mixed integer program (MIP) and solved by a branch-and-cut algorithm. A GENCO with 54 thermal and 12 combined-cycle units is considered for analyzing the proposed formulation. The proposed case studies illustrate the significance of simultaneous arbitrage by applying PBUC to multi-commodity markets.

• 대한산업공학회지
• /
• 제32권2호
• /
• pp.98-103
• /
• 2006

In this research, the single machine capacitated lot-sizing and scheduling problem with sequence- dependent setup costs and setup times (CLSPSD) is considered. This problem is the extension of capacitated lot-sizing and scheduling problem (CLSP) with an additional assumption on sequence-dependent setup costs and setup times. The objective of the problem is minimizing the sum of production costs, inventory holding costs and setup costs satisfying customers' demands. It is known that the CLSPSD is NP-hard. In this paper, the MIP formulation is presented. To handle the problem more efficiently, a conceptual model is suggested, and one of the well-known meta-heuristics, the simulated annealing approach is applied. To illustrate the performance of this approach, various instances are tested and the results of this algorithm are compared with those of the CLPEX. Computational results show that this approach generates optimal or nearly optimal solutions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권11호
• /
• pp.3876-3895
• /
• 2014

Recently, Heterogeneous Network (HetNet) with Coordinated Multi-Point (CoMP) scheme is introduced into Long Term Evolution-Advanced (LTE-A) systems to improve digital services for User Equipments (UEs), especially for cell-edge UEs. However, Radio Resource Management (RRM), including Resource Block (RB) scheduling and Power Allocation (PA), in this scenario becomes challenging, due to the intercell cooperation. In this paper, we investigate the RRM problem for downlink transmission of HetNet system with Joint Processing (JP) CoMP (both joint transmission and dynamic cell selection schemes), aiming at maximizing weighted sum data rate under the constraints of both transmission power and backhaul capacity. First, joint RB scheduling and PA problem is formulated as a constrained Mixed Integer Programming (MIP) which is NP-hard. To simplify the formulation problem, we decompose it into two problems of RB scheduling and PA. For RB scheduling, we propose an algorithm with less computational complexity to achieve a suboptimal solution. Then, according to the obtained scheduling results, we present an iterative Karush-Kuhn-Tucker (KKT) method to solve the PA problem. Extensive simulations are conducted to verify the effectiveness and efficiency of the proposed algorithms. Two kinds of JP CoMP schemes are compared with a non-CoMP greedy scheme (max capacity scheme). Simulation results prove that the CoMP schemes with the proposed RRM algorithms dramatically enhance data rate of cell-edge UEs, thereby improving UEs' fairness of data rate. Also, it is shown that the proposed PA algorithms can decrease power consumption of transmission antennas without loss of transmission performance.

• 지능정보연구
• /
• 제16권4호
• /
• pp.131-145
• /
• 2010

ERP, SCM 등과 같은 기업용 정보 시스템을 활용함에 있어, 고객의 문의에 따라 제품 판매 가능 유무와 가능일자를 계산하여 통보해 주는 지능형 ATP 시스템은 전산 정보를 활용하여 고객 만족도를 최대화할 수 있는 유용한 기능이라고 할 수 있다. 그렇지만 공급 사슬 환경에서 ATP 시스템을 적용하려고 할 경우, 고객이 문의해 온 Retailer에게 납품 가능한 모든 분배센터(Distribution Center)와 공장(Plant)의 미래 시점의 재고량 변화와 운송 능력 등을 모두 고려하여야 하므로 계산량이 방대한 NP-Complete 문제가 된다. 따라서 시스템 사용자가 빠른 시간 내에 해를 구하여 고객에게 결과를 알려 줄 수 있는 ATP 시스템의 개발은 공급 사슬 관리를 효과적으로 활용하기 위하여 반드시 필요한 일이라고 할 수 있다. 본 논문에서는 동적 생산 함수의 개념을 이용하여 비 정수 타임 랙을 고려하여 ATP 시스템을 모델링하고, 해당 수리 모형으로부터 효율적으로 해를 얻기 위하여 유전 알고리듬을 개발하였다. 비 정수 타임 랙을 활용한 ATP 시스템은 비 정수 타임 랙을 올림이나 내림을 통하여 정수화 시킨 후 모형 수립하는 기존의 방법보다 정교하게 현실을 반영할 수 있고, ATP 시스템을 위한 유전 알고리듬의 진화 시스템은 문제크기가 작은 것에서부터 큰 것까지 최적해에 매우 근사한 값을 매우 빠른 시간 내에 풀 수 있음을 알 수 있었다.