• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.26 no.4
• /
• pp.82-90
• /
• 2003

The Systems Engineering, as a methodology for engineering and management of today's ever-growing complex system, is a comprehensive and iterative problem-solving process. The process centers on the analysis and management of the stakeholders' needs throughout the entire life-cycle of a system and searches for an optimized system architecture. There are many essential needs and requirements to be met when a system development task is carried out. Systems Engineering Management Plan(SEMP), as a specification for system development process, must be established to satisfy constraints and requirements of stakeholders successfully and to prevent cost overrun and schedule delay. SEMP defines technical management functions and comprehensive plans for managing and controlling the entire system development process, specialty engineering processes, etc. Especially. in the case of a large-scale complex system development program where various disciplinary engineering such as mechanical; electrical; electronics; control; telecommunication; material; civil engineering etc. must be synthesized, it Is essential to develop SEMP to ensure systematic and continuous process improvements for quality and to prevent cost/schedule overruns. This study will enable the process knowledge management on the subject of SEMP as a core systems engineering management effort, that is, definitely defining and continuously managing specification of development process about requirements, functions, and process realization of it using a computer-aided systems engineering software. The paper suggests a systematic SEMP development process and demonstrates a data model and schema for computer-aided systems engineering software, RDD-100, for use in the development and management of SEMP. These are being applied to the systems engineering technology development task for the next-generation high-speed railway systems in progress.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.10 no.4
• /
• pp.71-77
• /
• 2011

In this paper, we propose a conversational quality measurement (CQM) system for providing the objective QoS of high quality mobile VoIP voice telecommunication. For measuring the conversational quality, the VoIP telecommunication system is implemented in two smart phones connected with VoIP. The VoIP telecommunication system consists of echo cancellation, noise reduction, speech encoding/decoding, packet generation with RTP (Real-Time Protocol), jitter buffer control and POS (Play-out Schedule) with LC (loss Concealment). The CQM system is connected to a microphone and a speaker of each smart phone. The voice signal of each speaker is recorded and used to measure CE (Conversational Efficiency), CS (Conversational Symmetry), PESQ (Perceptual Evaluation of Speech Quality) and CE-CS-PESQ correlation. We prove the CQM system by measuring CE, CS and PESQ under various SNR, delay and loss due to IP network environment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.7
• /
• pp.1585-1592
• /
• 2015

Currently, the existing schedule management of ship repair has depended on hand-written notes of engineering manager in the repair ship yard. Simple management based on the hand-written notes is inefficient because current states of equipments and staff are not graspable in real-time. To solve this problem, the ICT based scheduling method is required in ship repair industry. In this paper, we propose a system based on ICT which manages schedules for repairing ships. The proposed system solves the problem occurred by the management to use the hand-written notes. Because the system has a function to report the current state of ship repair, it is able to cope with various problems, such as delay, wrong repair and so on. Moreover, the system is able to maximize the efficiency of ship repair process due to efficient management to staff and equipment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.5
• /
• pp.1037-1050
• /
• 2000

A goal of a BISDN network is to provided integrated transport for a wide range of applications such as teleconferencing, Video On Demand etc. There require multipoint communications in addition to conventional point-to-point connections. Therefore multicast capabilities are very essential in multimedia communications. In this paper, we propose a new multicast cell scheduling method on the Parallel Multicast Packet Switch with Ring network: PMRN which are based on separated HOL. In this method, we place two different HOLs, one for unicast cells and the other for multicast cells. Then using non-FIFO scheduling, we can schedule both unicast cells and multicast cells which are available at the time in the input buffer. The simulation result shows that this method reduces the delay in the input buffer and increases the efficiency of both point-to-point network and ring network and finally enhances the bandwidth of the overall packet switch. A goal of a BISDN network is to provided integrated transport for a wide range of applications such as teleconferencing, Video On Demand etc. There require multipoint communications in addition to conventional point-to-point connections. Therefore multicast capabilities are very essential in multimedia communications. In this paper, we propose a new multicast cell scheduling method on the Parallel Multicast Packet Switch with Ring network: PMRN which are based on separated HOL. In this method, we place two different HOLs, one for unicast cells and the other for multicast cells. Then using non-FIFO scheduling, we can schedule both unicast cells and multicast cells which are available at the time in the input buffer. The simulation result shows that this method reduces the delay in the input buffer and increases the efficiency of both point-to-point network and ring network and finally enhances the bandwidth of the overall packet switch.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.30 no.6D
• /
• pp.623-629
• /
• 2010

Recently, the Shield TBM (Tunnel Boring Machine) construction method is used gradually to increase at the Tunnel Constructin site. However the design and application of the Shield TBM were carried out without sufficient investigation of the ground conditions in the construction site. Due to insufficient understanding to the corresponding equipment is frequently occurring unexpected construction cost and extension of a construction period. The most suitable alternative construction method was determined by analyzing tunneling rate, duration, construction cost of shield machine and tunneling data of alternative method. The result of the case study is suggested as follows. First, the accurate soil exploration on the construction site should be preceded to prevent from tunneling stoppage and schedule delay. Second, the most suitable selection of the shield machine to the ground conditions of the construction site should be executed based on the investigation. Third, the best alternative method for boring of hard rock section is 'hard rock blasting after open cut and cover method'.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.41 no.9
• /
• pp.681-688
• /
• 2013

Several problems caused by inevitable increment of airplane have been issued. The most effective solution to solve the issues is considered as establishing appropriate Air Traffic Management (ATM) that reduces aircraft's delay at an airport and intensify the airport's capacity. The purpose of this paper is to produce the optimum aircraft schedules that maximize the aircraft throughput by smooth air traffic flow near terminal area of an airport In this paper, mathematical formulations of the scheduling problem are firstly specified. Based on the mathematical modelling, an Optimization-Based Flight Scheduler that provides the optimum flight schedules for arriving aircraft is developed by introducing the Mixed Integer Linear Programming(MILP) and the Genetic Algorithms(GA). With this scheduler, we calculated the optimum schedules to compare to real schedule data from an Incheon Airport. As a result, it is validated that aircraft throughput produced by the optimum schedule is much better than that of the schedule from the Incheon airport. The optimization-based flight scheduler is expected to deal with problems due to the aircraft saturation in near future.

• IE interfaces
• /
• v.17 no.spc
• /
• pp.111-121
• /
• 2004

In this paper, we propose an urgency and efficiency based wireless packet scheduling (UEPS) algorithm that is able to schedule real time (RT) and non-real time (NRT) traffics at the same time. The proposed UEPS algorithm is designed to support wireless downlink packet scheduling in the OFDMA system which is a strong candidate wireless system for the next generation mobile communications. The UEPS algorithm uses the time-utility function as a scheduling urgency factor and the relative status of the current channel to the average one as an efficiency indicator of radio resource usage. The design goal of the UEPS algorithm is to maximize throughput of NRT traffics with satisfying QoS requirements of RT traffics. The simulation study shows that the proposed UEPS algorithm is able to give better throughput performance than existing wireless packet scheduling algorithms such as proportional fair (PF) and modified-largest weighted delay first (M-LWDF) while satisfying QoS requirements of RT traffics such as the average delay and the packet loss rate under various traffic loads.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.2
• /
• pp.60-67
• /
• 2017

A baggage handling system (BHS) in airport is an unified system for moving the passengers' baggage in designated time. Input baggage from the check-in counter travels to the baggage claim area or cargo handling terminal through this system. In particular, entryway BHS consists of conveyors, X-ray and sorters such as tilt-tray to send the baggage to departing airplane and it could have various problems for handling certain amount of baggage in restricted time such as baggage jamming at certain merge point. This causes systemic error such as delay of the time, omissions of the baggage and even breakdown of the equipment and inefficiency. Also the increasing maximum time of the baggage passing through the BHS could delay the flight schedule and finally decrease the service level. Thus, the algorithm for controlling the flow of the merge is essential to the system. The window reservation algorithm is the one of the most frequently used methods to control the merge configuration. Above all, the reserve location, so called reserve ahead point, that allocates the window is important for the performance of the algorithm. We propose the modified window reservation algorithm and the best reserve locations by changing the reserve ahead point in the induction conveyors. The effect of various reserve ahead points such as the capacity and utility of the system were analyzed and the most effective reserve ahead point combination was found. The total baggage processing time and the utilization of the tilt-tray are properly considered when choosing the optimal Reserve ahead point combination. In the layout of this study, the configuration of four conveyors merged into one tilt-tray is studied and simulation analysis is done by AutoMod(R), 3D simulation software. Through the simulation, the window reservation algorithm is effectively operated with the best combination of reserve ahead point which reduces the maximum baggage travel time.

• The Journal of Society for e-Business Studies
• /
• v.25 no.2
• /
• pp.15-27
• /
• 2020

This study starts with the idea that the process of creating a Gantt Chart for schedule planning is similar to Tetris game with only a straight line. In Tetris games, the X axis is M machines and the Y axis is time. It is assumed that all types of orders can be worked without separation in all machines, but if the types of orders are different, setup cost will be incurred without delay. In this study, the game described above was named Gantris and the game environment was implemented. The AI-scheduling table through in-depth reinforcement learning compares the real-time scheduling table with the human-made game schedule. In the comparative study, the learning environment was studied in single order list learning environment and random order list learning environment. The two systems to be compared in this study are four machines (Machine)-two types of system (4M2T) and ten machines-six types of system (10M6T). As a performance indicator of the generated schedule, a weighted sum of setup cost, makespan and idle time in processing 100 orders were scheduled. As a result of the comparative study, in 4M2T system, regardless of the learning environment, the learned system generated schedule plan with better performance index than the experimenter. In the case of 10M6T system, the AI system generated a schedule of better performance indicators than the experimenter in a single learning environment, but showed a bad performance index than the experimenter in random learning environment. However, in comparing the number of job changes, the learning system showed better results than those of the 4M2T and 10M6T, showing excellent scheduling performance.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.2
• /
• pp.63-72
• /
• 2011

Broadcast-based data dissemination has become a widely accepted approach of communication in the mobile computing environment. However, with a large set of data items, the expected delay of receiving a desired data increases due to the sequential nature of the broadcast channel. With the objective of minimizing this wait time, this paper explores the problem of data broadcast over multiple channels. In traditional approaches, data items are partitioned based on their access probabilities and allocated on multiple channels, assuming flat data scheduling per channel. If the data items allocated on the same channel are broadcast in different frequencies based on their access probabilities, the performance will be enhanced further. In this respect, this paper proposes a new broadcast scheduling scheme named two level dynamic programming(TLDP) which can reflect a variation of access probabilities among data items allocated on the same channel.