• International conference on construction engineering and project management
• /
• 2013.01a
• /
• pp.521-524
• /
• 2013

Schedule management of construction work is important in order to complete construction projects within a given period of time. Many efforts have been made and many tools have been developed in order to manage construction projects by a smart device such as smart phones and smart pads. This research proposed a basic design to manage construction schedules via a smart device using Flash. The interactive and graphic property of Flash enables a field manager to manage schedules easily and efficiently. A basic structure was designed for a user to be able to make and change a schedule by touching the smart device's screen. And a prototype was implemented by Adobe Flash/Flex Builder, it is applied to a sample network in a smart phone.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.330-333
• /
• 1992

• Journal of Digital Convergence
• /
• v.19 no.12
• /
• pp.165-173
• /
• 2021

The purpose of this study was to provide directions to help enter and expand long-distance routes by analyzing the characteristics of AirAsia X's network construction with Malaysia Airlines. To this end, long-distance route data was extracted from the OAG Schedule Analyzer and the network was analyzed on a two-period basis using SNA. Since AirAsia X's entry into long-range routes, Malaysia Airlines has steadily reduced its routes across the entire region. On the other hand, it is analyzed that AirAsia X is building an expanded network by increasing its network in Northeast Asia instead of ultra-long range routes. Studies have shown that LCCs also have potential growth in the long-distance route market of less than 7,000 km. The results of this study may help LCC establish a long-distance market entry and network deployment strategy.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.37
• /
• pp.211-220
• /
• 1996

We consider the problem of scheduling a maximal amount of additional, low priority transport through a large multiperiod network, given that we may not interfere with an existing schedule for high priority transport. The problem is transformed into the Time-Expanded network(TENET) without traverse time using TENET Generator (TENETGEN). We describe two specialized heuristic algorithms that guarantee the optimal solutions and show the effectiveness of them by comparing quite favorably with Dinic.

• Journal of the Korean Society for Railway
• /
• v.15 no.6
• /
• pp.662-669
• /
• 2012

In 2004, KTX operated in Korea on the 5th in the world. But there are various factor on planed schedule delay of Big National Construction Project like Seoul-Busan High Speed Rail Project(Seoul-Busan HSR). For example, Often change of government policy, project management control problem of design and construction, conflict of interested party like environmental organization/resident are the main delay factors. The suggestions for improvement of the construction schedule through the Seoul-Busan HSR will help to make a new leap forward in rail construction.

• Journal of the Korean Institute of Navigation
• /
• v.14 no.1
• /
• pp.21-38
• /
• 1990

This paper discusses the various modes of operations of cargo ships which are liner operations, tramp shipping and industrial operations, and mathematical programming, simulation , and heuristic method that can be used to solve ships routing and scheduling problems for each of these operations. In particular, this paper put emphasis on a crude oil tanker scheduling problem. The problem is to achieve an optimal sequence of cargoes or an optimal schedule for each ship in a given fleet during a given period. Each cargo is characterized by its type, size, loading and discharging ports, loading and discharging dates, cost, and revenue. Our approach is to enumerate all feasible candidate schedate schedules for each ship, where a candidate schedule specifies a set of cargoes that can be feasibly carried by a ship within the planning horizon , together with loading and discharging dates for each cargo in the set. Provided that candidate schedules have been generated for each ship, the problem of choosing from these an optimal schedule for each ship is formulated as a set partitioning problem, a set packing problem, and a integer generalized network problem respectively. We write the PASCAL programs for schedule generator and apply our approach to the crude oil tanker scheduling problem similar to a realistic system.

• Journal of Advanced Navigation Technology
• /
• v.2 no.2
• /
• pp.143-156
• /
• 1998

Incheon International Airport(IIA) is planned to open in about two years. Korean government has an ambition to make IIA a major hub airport in Northeast Asia. The most essential and required condition for an airport to be a successful hub airport in a certain region is to have more efficient flight service network than the other airports in the same region. IIA should compete with Japanese airports to be a major hub in Northeast Asia because Japanese government also has a plan to expand greatly the airport capacity in Tokyo area and Kansai airport in Osaka. It is necessary for both IIA and Korean national air carriers to compose efficient flight service network considering hub competition with Japanese major airports. As the liberalization of international air transport industry would give more marketing freedom to airlines, they would plan the flight service network and flight schedule based on market analysis instead of governmental regulations. In the economically liberalized environment, it is very required to analyze air passengers' flight choice behaviour in order to induce other carriers and passengers through IIA's attractive flight service network. Disaggregate model is more appropriate than aggregate model to analyze consumers' behaviour. The information derived from disaggregate choice model of air passengers could be utilized in devising efficient flight network and schedule plan. Value of travel time or trade off ratio between flight frequency and travel time which could be estimated from discrete choice model could be utilized for scheduling an efficient flight plan for airlines and composing efficient flight service network for IIA.

• Journal of Korean Society of Transportation
• /
• v.35 no.3
• /
• pp.247-259
• /
• 2017

This study analyzed the network of low cost carriers (LCCs) to investigate the structural characteristics of airport networks. 71 LCCs in Asian major airports from January 2010 to January 2016 were queried from the SRS Analyzer Schedule Database of IATA's Airport Intelligence Service, and analyzed international routes excluding domestic flights. We analyzed the network connection mechanism focusing on Incheon International Airport, Hong Kong, Singapore, Narita, Kansai, Pudong, Kaohsiung, Gimpo and Jeju airports as well as structural changes in the LCC network using four centrality analysis concepts. The outcomes showed that the LCC network is formed in these airports and the density of connectivity to other airports increased. In recent years, LCC has launched LCCs-Alliances and would be considered to operate a hub-and-spoke network.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.227-230
• /
• 2011

In this paper, we are proposed ECOPS(Energy Conserving optimal Path Schedule) algorithm that according to ALPS(Ad hoc network Localized Positioning System) algorithm the location information is received and the new head node is selected considering the energy efficiency. The proposed algorithm follows RODMRP(Resilient Ontology-based Dynamic Multicast Routing Protocol) structure, that is the hierarchic cluster structure. And by using the location information of the node, it maintains the cluster which the energy is efficient with the production. It increases the life time of the total routing structure.

• Journal of KIISE:Information Networking
• /
• v.31 no.5
• /
• pp.450-459
• /
• 2004

This paper studies the collective communication in the grid computing environment, which is characterized by the combination of heterogeneous networks as well as uneven, long communication delay. Efficient collective communication requires communication schedule, which in turn requires network information. When the network information is not accurate or network faults occur, the performance of collective communication can be markedly degraded. This paper proposes TTCC(Two-Tree Collective Communication) for scheduling collective communication in the grid. It Provides an efficient and reliable schedule even In this unfavorable network condition by maintaining two disjoint communication trees. Benefits of the proposed method are manifested via simulation, where the performance degradation with TTCC is much slower than those using conventional scheduling algorithms.