• 산업공학
• /
• 제14권4호
• /
• pp.394-402
• /
• 2001

In this study, we deal a spatial scheduling system for the block painting process in the shipbuilding industry. In general, the spatial scheduling for the block painting process is a very complicated task. Because spatial allocation of each block in blasting and painting cells is considered simultaneously. Thus the spatial scheduling for the block painting process is the problem of planning and control of operation, which arises in shipyard. This system is developed for blocks to meet the delivery date given by the shipyard production planning system, to maximize space utilization of blasting and painting cells and to balance workload among working teams. And it has been tested using actual scheduling data from a shipyard and successfully applied in a paint shop in a shipbuilding company.

• 한국철도학회논문집
• /
• 제9권1호
• /
• pp.50-56
• /
• 2006

This paper presents a mathematical model of the long-term track tamping scheduling problem in the Korean highspeed railway system. The presented model encompasses various operational field constraints, moreover improves a state-of-the-art model in extending the feasible space. We show the model is sized up to intractable scale, then propose another approximation model that is possible to handle with the present computer system and commercial optimization package, directly. The aggregated index, lot, is selected, considering the resolution of the planning horizon as well as scheduling purpose. Lastly, this paper presents two test results for the approximation model. The results expose the approximation model to quite promising in deploying it into an operational software program for the long-term track tamping scheduling problem.

• 한국통신학회논문지
• /
• 제33권12A호
• /
• pp.1209-1216
• /
• 2008

무선통신 시스템에 있어서 스펙트럼 효율성과 전송속도의 극대화를 위해 MIMO(Multiple Input Multiple Output) 기술을 시스템에 적용하는 노련이 계속되고 있다. 최근 대두되고 있는 WiMAX와 LTE는 OFDM 기반 기술로서 CDMA보다 MIMO기술을 적용하기 쉽다는 장점에 의해 MIMO 기술을 기본으로 채택하고 있다. 하향 링크에서는 STC(Space Time Coding) 방식과 SM(Spatial Multiplexing) 방식을 사용하여 MIMO 방식을 기본 기술로 적용하였으며 상향링크에서는 C-MIMO(Collaborative MIMO) 기술이 사용된다. 특히, 상향링크는 양방향 데이터 통신을 활용한 다양한 신규 서비스가 제안되고 있어 전송 성능을 개선시킬 수 있는 C-MIMO의 성능향상이 기술 쟁점이 되고 있다. 본 논문에서는 C-MIMO 성능 향상을 위하여 기존에 사용되고 있는 신호간 직교성(OF: Orthogonal Factor)의 성질을 이용하여 단말 조합을 선택하는 방식(DPS: Determinant Pairing Scheduling)과 신호간 직교성을 사용하지 않고 단말 조합을 선택하는 방식(RPS: Random Pairing Scheduling)을 분석하였다. 또한 DPS와 RPS 방식을 보완한 새로운 알고리즘을 제안 하여 스펙트럼 효율을 높이는 방법을 고안하였다. 결과에 의하면 새로운 알고리즘을 통하여 RPS 대비 $2{\sim}3dB$ 이득을 보았으며 DPS에 비하여 현격하게 복잡도를 감소 시켰다.

• 한국정보처리학회논문지
• /
• 제4권6호
• /
• pp.1481-1494
• /
• 1997

실시간 시스템에서 시간적 제약의 불이행의 커다란 손실을 가져오며, 이를 위한 동적 스케쥴링은 유연성을 제공하는 대신 스케쥴링 오버헤드와 분석작업의 복잡성으로 인하여 스케쥴성을 예측하기 어려움이 있다. 반면, 정적 스케쥴링은 수행 중 오버헤드가 없으므로 정확한 시간을 예측할 수 있는 장점이 있다. 따라서 명령어 수준의 정적 스케쥴링과 시간 분석을 통하여 시스템의 시간적 정확도를 보장할 수 있다. 본 논문에서는 확정된 시간 분석을 위하여 befor와 after의 시간 제약을 고급 언어에 표현하고 이를 근거로 시간적 분석에 기반을 둔 컴파일러의 명령어 수준의 스케쥴링 알고리즘을 제안하였다. 이 스케쥴링의 특징은 명령어 수준의 스케쥴링을 위한 도메인이 지나치게 과대하므로 향상된 적합 유전자 알고리즘을 적용한 것이다.

• ETRI Journal
• /
• 제30권1호
• /
• pp.129-140
• /
• 2008

In this paper, we propose a novel ant colony optimization (ACO)-based test scheduling method for testing network-on-chip (NoC)-based systems-on-chip (SoCs), on the assumption that the test platform, including specific methods and configurations such as test packet routing, generation, and absorption, is installed. The ACO metaheuristic model, inspired by the ant's foraging behavior, can autonomously find better results by exploring more solution space. The proposed method efficiently combines the rectangle packing method with ACO and improves the scheduling results by dynamically choosing the test-access-mechanism widths for cores and changing the testing orders. The power dissipation and variable test clock mode are also considered. Experimental results using ITC'02 benchmark circuits show that the proposed algorithm can efficiently reduce overall test time. Moreover, the computation time of the algorithm is less than a few seconds in most cases.

• 대한산업공학회지
• /
• 제21권3호
• /
• pp.409-428
• /
• 1995

Job shop scheduling with m different machines and n different jobs is a NP-hard problem of combinatorial optimization. The purpose of the paper is to develop the heuristic method using tabu search for job shop scheduling to minimize makespan or mean flowtime. To apply tabu search to job shop scheduling problem, in this paper we propose the several move methods that employ insert moves in order to generate the neighbor solutions, and present the efficient rescheduling procedure that yields active schedule for a changed operation sequence by a move of operations. We also discuss the tabu search techniques of diversifying the search of solution space as well as the simple tabu search. By experiments, we find the appropriate tabu list size and tabu attributes, and analyze the proposed tabu search techniques with respect to the quality of solutions and the efforts of computation. The experimental results show that the proposed tabu search techniques using long-term memory function have the ability to search a good solution, and are more efficient in the mean flowtime minimization problem than in the makespan minimization.

• 전자공학회논문지A
• /
• 제28A권12호
• /
• pp.73-87
• /
• 1991

This paper presents a new approach to the scheduling problem in the high level synthesis. In this approach, iterative rescheduling processes starting with ASAP(As Soon As Possible) scheduling result are performed in a branch-and-bound manner so to arrive at the scheduling result of the lowest hardware cost under the given timing constraint. At each iteration step, only the selected nodes are considered for rescheduling, and the lower bound cost estimation is performed to avoid the unnecessary attempts to search for an optimal result. This branch-and-bound method turns out to be effective in pruning the search space, and thus reducing run time considerably in many cases.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
• /
• pp.617-620
• /
• 2000

In this paper, we show an application of constraint logic programming to the operation scheduling on machines in a job shop. Constraint logic programming is a new genre of programming technique combining the declarative aspect of logic programming with the efficiency of constraint manipulation and solving mechanisms. Due to the latter feature, combinatorial search problems like scheduling may be resolved efficiently. In this study, the jobs that consist of a set of related operations are supposed to be constrained by precedence and resource availability. We also explore how the constraint solving mechanisms can be defined over a scheduling domain. Thus the scheduling approach presented here has two benefits: the flexibility that can be expected from an artificial intelligence tool by simplifying greatly the problem; and the efficiency that stems from the capability of constraint logic programming to manipulate constraints to prune the search space in an a priori manner.

• 한국건축시공학회:학술대회논문집
• /
• 한국건축시공학회 2010년도 춘계 학술논문 발표대회 1부
• /
• pp.131-133
• /
• 2010

As linear scheduling method has been used since 1929, Empire State Building linear schedule, it is being applied in various fields such as construction and manufacturing. When addressing concurrent critical path occurring on linear schedule of construction, the empirical researches stress the resource management which should be applied for optimizing work flow, flexible work productivity and continuos resource allocation. However, work relationships has been usually overlooked for making the linear schedule from existing network schedule. Therefore, this research analyze the previous researches related to linear scheduling model and then propose the method that can be applied for adopting the relationships of network schedule to the linear schedule.

• Journal of Communications and Networks
• /
• 제8권4호
• /
• pp.401-409
• /
• 2006

Orthogonal frequency division multiplexing (OFDM) and multiple input multiple output (MIMO) technologies provide additional dimensions of freedom with spectral and spatial resources for radio resource management. Multi-dimensional radio resource management has recently been identified to exploit the full dimensions of freedom for more flexible and efficient utilization of scarce radio spectrum while provide diverse quality of service (QoS) guarantees. In this work, a multi-dimensional radio resource scheduling scheme is proposed to achieve above goals in hybrid orthogonal frequency division multiple access (OFDMA) and space division multiple access (SDMA) systems. Cochannel interference (CCI) introduced by frequency reuse under SDMA is eliminated by frequency division and time division between highly interfered users. This scheme maximizes system throughput subjected to the minimum data rate guarantee. for heterogeneous users and transmit power constraint. By numerical examples, system throughput and fairness superiority of the our scheduling scheme are verified.