• Korean Journal of Construction Engineering and Management
• /
• v.17 no.5
• /
• pp.54-61
• /
• 2016

The initial planned annual cost is frequently adjusted under the construction process in construction projects. If the annual cost is reduced than the initial planned cost, the number of possible activities is also reduced from initial planned progress schedule. In such cases, project manager need to replan the progress schedule with possible activities within changed annual cost. However, most project manager will proceed as planned schedule without any change. After the project cost has been exhausted, there are many cases to stop the operation of the construction site. This study developed active 5D CAD system that can replan the progress schedule within changed annual cost and simulate the cost status according to the changed schedule for cost visualization. This system can be used as a decision-making tool in the replaning progress schedule and will be able to increase the practical usability of 5D CAD system.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.6
• /
• pp.3851-3857
• /
• 2014

Shippers' requests of freight trains vary with time, but generating an additional schedule of freight trains is not easy due to many considerations, such as the line capacity, operation rules, and conflicts with existing trains. On the other hand, an additional freight train schedule has been continuously requested and manually processed by domestic train operation companies using empirical method, which is time consuming. This paper proposes a model to determine the additional freight train schedule that assesses the feasibility of the added freight trains, and generates as many additional schedules as possible, while minimizing the delay of the existing schedules. The problem is presented using time-space network, modeled as multi-commodity flow problem, and solved using the column generation method. Three levels of experiment were conducted to show validity of the proposed model in the computation time.

• Journal of Information Management
• /
• v.35 no.1
• /
• pp.71-91
• /
• 2004

This study focuses on establishing a base for approaching record disposition schedules, which may be felt unfamiliar, through the overview of record disposition schedules. For this purpose, this study examined the meaning of record disposition schedules, the significance and principle of their elements, and their operation. In addition, it presented tasks to perform for record disposition schedules to play a central role of record management in the future. This study showed that record disposition schedules authorize people to control and process records, and are closely related to the development and the stability of record disposition system in Korea. What is more, it proved that record disposition schedules enable the assessment of the historical values of records, so it is possible to maintain records from the perspective of historical records. Besides, record disposition schedules are important in that they contain information on organizations and their functions, based on which we can preserve and manage extrinsic information about records.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.4
• /
• pp.425-432
• /
• 2008

While the Vendor-Managed Inventory(VMI) is a convenient inventory replenishment policy for the customer company, the supplier usually bears the burden of higher inventory and urgent shipments to avoid shortage. Recently some manufacturers begin to fix the production schedule for the next few days (such as three days). Utilizing that information can improve the efficiency of the VMI. In this study, we present a myopic optimization model using a mixed inter programming; and a heuristics algorithm. We compare the performance of the two proposed methods with the existing (s, S) reorder policy. We consider the total cost as the sum of transportation cost and inventory cost at the customer's site. Numerical tests indicate that the two proposed methods significantly reduce the total cost over the (s, S) policy.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.3
• /
• pp.75-88
• /
• 1996

This paper presents an efficient heuristic technique for minimizing the objectives related to tardiness such as total tardiness, maximum tardiness and root mean of tardiness in the job shop scheduling. The heuristic technique iteratively improves an active schedule through exploring the schedule's neighborrhood, using operation move methods. The move operatio is defined on an active chain of tardy jobs in the active schedule. To find the move operations which have a high probability of reducing tardiness, we develop move methods by exploiting the properties of active chains. Our technique is compared with the two existing heuristic techniques, that is, MEHA(Modified Exchange Heuristic Algorithm) and GSP(Global Scheduling Procedure) under the various environmental with the three levels of due date tightness and several sized problems. The experimental results show that the proposed technique outperforms the two exissting techiques in terms of solution quality and computation time.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.27-37
• /
• 2007

Many problems related to airline business belong to large-scale optimization problems, so that it is expected that the state-of-art optimization techniques are widely applied to making the airline operation effective and competitive. This paper introduces the concepts and mathematical models of various optimization problems in airline system. Airlines involve many activities that utilize airline resources such as aircrafts and crews to make profit. We view the airline activities in the planning and operational aspects. In the planning viewpoint, we discuss the flight schedule design problem that impacts on passenger demand directly. For aircraft and crews, we deal with fleet assignment, aircraft routing, crew pairing optimization, and crew assignment problem. In the operational viewpoint, we concern schedule recovery problems for aircrafts and crew using the method of reassigning available resources when airlines face with the unexpected situations.

• ETRI Journal
• /
• v.37 no.5
• /
• pp.888-897
• /
• 2015

Group scheduling is an operation whereby control packets arriving in a time slot schedule their bursts simultaneously. Normally, those bursts that are of the same wavelength are scheduled on the same channel. In cases where the support of full wavelength converters is available, such scheduling can be performed on multiple channels for those bursts that are of an arbitrary wavelength. This paper presents a new algorithm for group scheduling on multiple channels. In our approach, to reach a near-optimal schedule, a maximum-weight clique needs to be determined; thus, we propose an additional algorithm for this purpose. Analysis and simulation results indicate that an optimal schedule is almost attainable, while the complexity of computation and that of implementation are reduced.

• Science of Emotion and Sensibility
• /
• v.17 no.1
• /
• pp.3-12
• /
• 2014

Quick and accurate learning of diverse electronic products has become an important daily task. In particular, software occupies core status in the control and operation of the products. This research tested the effects of learning method, schedule, and task difficulty in the learning of software. Using 2 (learning method: experiential vs. verbal) ${\times}$ 2 (learning schedule: spaced vs. massed) ${\times}$ 2 (difficulty: easy vs. difficult) between-subjects design, Experiment 1 tested participants' learning of file control using Windows Movie Maker. There was no effect of learning schedule on task completion time, but participants in experiential learning were faster in the completion of evaluation task compared with those in verbal learning condition. Importantly, as task difficulty increases participants in verbal condition showed markedly lower performance than those in experiential condition, which suggests that experiential learning is more effective with more difficult learning task. That is, in case of learning simple operation of software verbal learning using linguistic manual or instruction could be sufficient; on the other hand in case of learning complex operation learning from experience or tutorial mode would be more effective. Additional studies which manipulated task difficulty (Expt. 2) and inter-trial learning interval (Expt. 3) did not produce meaningful results.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.28 no.7
• /
• pp.299-304
• /
• 2016

In recent years, heat source systems which have a principal effect on the performance of buildings are difficult to design optimally as a great number of design factors and constraints in large and complicated buildings need to be considered. On the other hand, it is necessary to design an optimum system combination and operation planning for energy efficiency considering Life Cycle Cost (LCC). This study suggests a multi-level and multi-objective optimization method to minimize both LCC and investment cost using a genetic algorithm targeting an office building which requires a large cooling load. The optimum method uses a two stage process to derive the system combination and the operation schedule by utilizing the input data of cooling and heating load profile and system performance characteristics calculated by dynamic energy simulation. The results were assessed by Pareto analysis and a number of Pareto optimal solutions were determined. Moreover, it was confirmed that the derived operation schedule was useful for operating the heat source systems efficiently against the building energy requirements. Consequently, the proposed optimization method is determined by a valid way if the design process is difficult to optimize.

• Proceedings of the KIEE Conference
• /
• 2007.07a
• /
• pp.806-807
• /
• 2007

Systematic studies on the dispatch scheduling algorithm and related constraints can enhance the effectiveness of electricity market operation. When System Operator (SO) establishes a dispatch schedule, the bid information should be preserved in the schedule as much as possible. In this paper, we introduce a new type of sensitivity factor called Line Outage Impact Factor (LOIF) to screen a transmission line causing the most severe outage when scheduling the dispatch. This screening can assure the stable system operation and make an efficient feedback between the SO and market participants. We propose a transmission line contingency constrained Pre-dispatch algorithm using sensitivity indices in a suitable Pre-dispatch scheduling. The proposed algorithm has been tested on sample system and the results show more secure operation against critical contingencies.