• Tunnel and Underground Space
• /
• v.19 no.3
• /
• pp.167-173
• /
• 2009

Underground storage cavern is known as the most complicated underground project because of the complexity of construction schedule, tunnel size, and geological problems. In order to optimize the construction schedule of underground storage cavern, two up-to-date technologies were applied. The first technology was 3 dimensional visualization of complicated underground structures, and the second was 4 dimensional simulation considering construction resources, geological conditions and construction schedule. This application case shows that we can achieve optimized construction schedule in the ways to optimize the number of work teams, fleets, the sequence of tunnel excavation, the commencement time of excavation and the hauling route of materials and excavated rocks. 3 dimensional modeling can help designer being able to understand the status of complicated underground structures and to investigate the geological data in the exact 3 dimensional space. Moreover, using 4 dimensional simulation, designer is able to determine the bottle neck point which appear during hauling of excavated rocks and to investigate the daily fluctuation in cost.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.04a
• /
• pp.343-352
• /
• 1993

In this study, a modified algorithm for the exchange heuristic is developed and applied to a resource-constrained scheduling problem. The problem involves multiple projects and multiple resource categories and allows flexible resource allocation to each activity. The objective is to minimize the maximum completion time. The exchange heuristkc is a multiple pass algorithm which makes improvements upon a given initial feasible schedule. Four different modified algorithms are proposed. The original algorithm and the new algorithms were compared through an experimental investigation. All the proposed algorithms reduce the maximum completion time much more effectively than the original algorithm. Especially, one of four proposed algorithms obviously outperforms the other three algorithms. The algorithm of the best performance produces significantly shorter schedules than the original algorithm, though it requires up to three times more computation time. However, in most situations, a reduction in schedule length means a significant reduction in the total cost.

• IE interfaces
• /
• v.14 no.3
• /
• pp.218-226
• /
• 2001

Scheduling for shipbuilding processes has many alternative solutions since it has long time horizon and handles many jobs. This requests the scheduling system to generate and search feasible alternative solutions in short period of time. Among shipbuilding schedules, the ship erection schedule in a dock is the most important since the dock is the most critical resource in shipyard. In this research, we model the erection scheduling problem for shipbuilding and develop a new problem solving method using CST(Constraint Satisfaction Technique) and ILOG Scheduler. Experimental results show that the proposed scheduling method outperforms the existing manual scheduling methods in terms of schedule performance and required time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.11
• /
• pp.5717-5730
• /
• 2019

LBlock-s is the core block cipher of authentication encryption algorithm LAC, which uses the same structure of LBlock and an improved key schedule algorithm with better diffusion property. Using the differential properties of the key schedule algorithm and the cryptanalytic technique which combines impossible boomerang attacks with related-key attacks, a 15-round related-key impossible boomerang distinguisher is constructed for the first time. Based on the distinguisher, an attack on 22-round LBlock-s is proposed by adding 4 rounds on the top and 3 rounds at the bottom. The time complexity is about only 2^68.76 22-round encryptions and the data complexity is about 2⁵⁸ chosen plaintexts. Compared with published cryptanalysis results on LBlock-s, there has been a sharp decrease in time complexity and an ideal data complexity.

• Journal of Korean Society of Transportation
• /
• v.18 no.6
• /
• pp.111-124
• /
• 2000

본 연구에서 다루고자 하는 문제는 서비스시간 제약을 갖는 도시부 복합교통망에서의 기종점을 잇는 합리적인 최단경로를 탐색하고자 하는 것이다. 서비스시간 제약은 도시부 복합교통망에서의 현실성을 보다 더 사실적으로 표현하지만 기존의 알고리즘들은 이를 고려하지 않고 있다. 서비스시간 제약은 환승역에서 여행자가 환승차량을 이용해서 다른 지점으로 여행할 수 있는 출발시간이 미리 계획된 차량운행시간들에 의해 제한되어지는 것이다. 환승역에 도착한 여행자는 환승차량의 정해진 운행시간에서만 환승차량을 이용해서 다른 지점으로 여행할 수 있다. 따라서 서비스시간 제약이 고려되어지는 경우 총소요시간에는 여행시간과 환승대기시간이 포함되어지고, 환승대기시간은 여행자가 환승역에 도착한 시간과 환승차량의 출발이 허용되어지는 시간에 의존해서 변한다. 본 논문에서는 이러한 문제를 해결할 수 있는 링크기반의 최단경로탐색 알고리즘을 개발하였다. Dijkstra 알고리즘과 같은 전통적인 탐색법에서는 각 노드까지의 최단도착시간을 계산하여 각 노드에 표지로 설정하지만 제안된 알고리즘에서는 각 링크가지의 최단도착시간과 각 링크에서의 가장 빠른 출발시간을 계산하여 각 링크의 표지로 설정한다. 제안된 알고리즘의 자세한 탐색과정이 간단한 복합교통망에 대하여 예시되어진다.

• ETRI Journal
• /
• v.34 no.3
• /
• pp.462-465
• /
• 2012

This letter proposes a new distributed scheduling scheme combined with routing to support the quality of service of real-time applications in wireless mesh networks. Next, this letter drives average end-to-end delay of the proposed scheduling scheme that sequentially schedules the slots on a path. Finally, this letter simulates the time division multiple access network for performance comparison. From the simulation results, when the average number of hops is 2.02, 2.66, 4.1, 4.75, and 6.3, the proposed sequential scheduling scheme reduces the average end-to-end delay by about 28%, 10%, 17%, 27%, and 30%, respectively, compared to the conventional random scheduling scheme.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2002.04a
• /
• pp.27-34
• /
• 2002

In the case of reinforced concrete structures, the knowledge of load transfer in the long-term behavior analysis considering construction sequence is very important. Even though long-term behavior of concrete structures has been widely studied, the studies on the time-dependent axial force variation of shore have been scarce to date. In order to investigate the shore behaviors under actual construction conditions, a three-story test frame was constructed on a construction site. The entire construction schedule for the test frame was made to follow the schedule of an actual three-story frame. To analyze the data collected from the test frame, an analysis method based on the Winkler foundation model was developed. This analysis method accurately Predicts the time-dependent behavior of shore. The analysis results coincide well with those obtained by the Midas GENw program

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.43
• /
• pp.1-16
• /
• 1997

This paper improves the autonomy for supplier's schedule and the flexibility of the final assembly line. The final assembly line is a single work station and each product taking different assembly time is considered. In the assembly schedule, the heuristic method based on the goal chasing method is used. Consequently, suppliers can independently determine their output rates and thus, change their workload pattern according to their needs and priorities. Moreover, this flexibility can help to avoid expensive final-assembly-line stoppages in case of sudden part supply disruptions. The sequencing method can be easily implemented into an existing just-in-time system. In addition, the mathematical model was formulated and the algorithm was explained through the flow chart. The numerical example was given and the efficiency of this method is shown through the analysis of computational results of that example.

• Proceedings of the KIEE Conference
• /
• 1987.07a
• /
• pp.288-292
• /
• 1987

The purpose of this paper is to develope the parallel computation algorithm that enables it to minimize the completion tine of computation execution of the entire subtasks, under the constraints of the series-parallel precedence relation in each subtask. The developed algorithm was applied to the control of a robot manipulator functioned by multi-CPU's and to obtain the minimum time schedule so that real time control may be achieved. The completion time of computation execution was minimized by applying "Variable" Branch and Bound algorithm which was developed In this paper in determining the optimum ordered schedule for each CPU.

• Journal of Korean Ophthalmic Optics Society
• /
• v.20 no.1
• /
• pp.43-49
• /
• 2015

Purpose: This study was to compare the habitual soft contact lens wear to recommended wearing schedule for subjects and suggest a clinical guideline for prescribing contact lens. Methods: 611 adults (39 men and 572 women) with contact lens experience took part in this study. The survey collected information about current wearing schedule (hours/day and days/week), types of lenses worn and awareness of recommended wear schedule. Results: The subjects wore the daily contact lens for $7.97{\pm}3.60$ hours/day in average. Of these, 247 subjects (40.4%) exceeded the recommended wear schedule and 36 (5.9%) wore for over 15 hours. It turned out that subjects with 3-month extended contact lenses and the ones with the conventional daily wear wore for $9.79{\pm}2.68$ hours and $8.98{\pm}3.30$ hours/day, respectively. For subjects wearing contact lenses longer than five days/week it tended to wear for over 9 hours. Those who were aware of the wear schedule were 293 (48.0%), and those not were 318 (52.0%). 56.7% of subjects who were aware of the wear schedule respected the recommendation whereas only 22.3% of those unaware of it were found to respect it. The possibility to respect the wear schedule was 4.55 times higher when wearers were aware of it. Conclusions: Korean office workers wearing contact lenses wore for $7.97{\pm}3.60$ hours/day. 247 (40.4%) of subjects wore contact lens longer than recommended wear schedule. This implies that it will need to educate contact lens wearer about recommended wear schedule and advice for the long time wearer.