• Journal of Korean Society for Quality Management
• /
• v.50 no.2
• /
• pp.265-286
• /
• 2022

Purpose: The time and cost of a project activity exists in a selected mode and there is a quality level for the selected mode, and the time and cost of the current activity is determined by the quality level of the preceding activity. When an activity is a predecessor activity of an activity, it is characterized as a trade-off problem in which the time and cost of the activity are determined according to the quality level of the activity. Methods: A neighbor search heuristic algorithm obtains a solution by (1) randomly determining the mode, quality level, and assignment order for each activity. (2) get a solution by improving the solution by changing the possible modes and quality levels; (3) to find a solution by improving the solution from the point where it is feasible to advance the start time. Here, Case[1] is a method to find the optimal solution value after repeating (1). Case [2] is a method for finding a solution including (1) and (2). Case [3] refers to a method for finding solutions including (1), (2), and (3). Results: It can be seen that the value of the objective function presented by the algorithm changes depending on how the model of the heuristic algorithm is designed and applied. In other words, it suggests the importance of algorithm design and proves the importance of the quality problem of activities in the project schedule. Conclusion: A study significance of the optimization algorithm and the heuristic algorithm was applied to the effect of the quality of the preceding activity on the duration and cost of itself and the succeeding activity, which was not addressed in the project schedule problem.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.2
• /
• pp.207-216
• /
• 1995

Constructing a distributed management system has its own advantages in addressing the issue of implementing a quick responsive management system in dynamically changing environment of enterprise. We suggest a basic scheduling methodology applicable to a distributed production management system. A new concept of "flexible schedule" is introduced as a tool to accommodate dynamically changing situations of job shops. Then a search technique (referred to as CSP-CBA search) is presented to obtain such a schedule for the job shop scheduling problem, which is converted into a constraint satisfaction problem(CSP), by using the constraint based analysis(CBA). This approach is tested on more than 100 test problems. The results show that the suggested approach required shorter CPU time and solved more problems in given time than another fixed schedule method.

• Proceedings of the KSR Conference
• /
• 2008.11b
• /
• pp.1132-1137
• /
• 2008

Automatic Operation based on ATO (Automatic Train Operation) is necessary for driverless Light Rail Transit business. When this kind of driverless LRT operation plan is made, TPS (Train Performance Simulation) is traditionally simulated at all-out mode and coasting mode based on manual operation. Commercial schedule speed equals to all-out speed minus $9{\sim}15%$ make-up margin. Coasting mode TPS simulation is also run at commercial schedule speed to calculate run time and energy consumption. But TPS based on manual operation should make an improvement on accuracy in case of driverless LRT operation Plan. In this paper, new fast mode TPS simulation using ATO pattern is proposed and show near actual ATO result. The actual ATO pattern can be accurately simulated with the introduction of 4 parameters such as commercial braking rate, jerk, station stop profile and grade converted distance. Normal mode TPS simulation for commercial schedule speed can be designed to have fast mode trip time plus 3 seconds/km margin recommended by korean standard LRT specification.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.8 s.179
• /
• pp.2131-2142
• /
• 2000

As recent production facilities are usually operated with unmanned material-handling system, the development of an efficient schedule with deadlock avoidance becomes a critical problem. Related researches on deadlock avoidance usually focus on real-time control of manufacturing system using deadlock avoidance policy. But little off-line optimization of deadlock-free schedule has been reported. This paper presents an optimization method for deadlock-free scheduling for Job-Shop system with no buffer. The deadlock-free schedule is acquired by the procedure that generates candidate lists of waiting operations, and applies a deadlock avoidance policy. To verify the proposed approach, simulation resultsare presented for minimizing makespan in three problem types. According to the simulation results the effect of each deadlock avoidance policy is dependent on the type of problem. When the proposed LOEM (Last Operation Exclusion Method) is employed, computing time for optimization as well as makespan is reduced.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.12
• /
• pp.1899-1904
• /
• 2017

This paper presents a new one-time password approach generated based on $4{\times}4$ pattern schedule. It demonstrates generation of passkey from initial seed of random codes and mapping out in table pattern schedule which will produce a new form of OTP scheme in protecting information or data. The OTP-2FA has been recognized by many organizations as a landmark to authentication techniques. OTP is the solution to the shortcomings of the traditional user name/password authentication. With the application of OTP, some have benefited already while others have had second thoughts because of some considerations like cryptographic issue. This paper presents a new method of algorithmic approach based on table schedule (grid authentication). The generation of OTP will be based on the random parameters that will be mapped out in rows and columns allowing the user to form the XY values to get the appropriate values. The algorithm will capture the values and extract the predefined characters that produce the OTP codes. This scheme can work in any information verification system to enhance the security, trust and confidence of the user.

• Journal of the Korea Society for Simulation
• /
• v.24 no.3
• /
• pp.17-26
• /
• 2015

A cluster tool used in many kinds of semiconductor processes for improving the performance and the quality of wafers has a simple configuration, but its schedule is not easy because of its parallel processing module, a lack of intermediate buffers, and time constraints. While there have been many studies on its schedule, most of them have focused on full cycles in which identical work cycles are repeated under constant task times. In this research, we suggest strategies of start-up transient scheduling which satisfies time constraints and converges into a desirable steady schedule for full work cycle. The proposed schedules are expected robust under the stationary stochastic task times. Finally, we show that the strategies make schedules enters the desirable steady schedule and robust using the simulation.

• Journal of Information Technology Applications and Management
• /
• v.14 no.3
• /
• pp.227-236
• /
• 2007

Students in cyber universities can take every course because there are no physical constraints such as class rooms. On the other hand. cyber universities should take a heavy burden to schedule real-time exams in a designated time period. Any two courses a student takes must not be simultaneously allocated to a time slot in such a schedule. It is well known that the complexity of this kind of scheduling problem increases exponentially as the number of courses does. This research provides a heuristic method to make on-line real-time exam timetables with minimal exam time span. It considers the constraint of not allocating courses a student takes to simultaneous exam time and prioritizes courses by the number of students.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.2
• /
• pp.132-143
• /
• 2011

This paper deals with a coal supply planning problem for power plants. We propose a mathematical optimization model to make decisions for coal pile sections, movement of reclaimers, and operation time of conveyor belts. The objective of the proposed model is to minimize the total operation time of conveyor belts and total movement time of reclaimers. The algorithm firstly selects a pile section by considering both the location of reclaimers and the stock amount on that pile section. And then the shortest path from the selected pile section has to be put into the operation schedule and check whether the total operation time is satisfied. Then finally the new schedule is updated. To this end, we have tested the proposed algorithm comparing with the general standard optimization package for the simplified problem SCSPP. From the numerous test runs for comparing with the existing coal supply scheduling methods, We see that the proposed model may improve the coal supply operation by reducing significant coal supply costs.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.12
• /
• pp.1627-1636
• /
• 2014

In real-time electricity price environment, the energy management system can provide the significant advantage to the residential, commercial and industrial customers since it can reduce the electricity charge by controlling the load operation effectively in response to time-varying price. However, the earlier studies for load management mainly focus on the residential and commercial customers except for the industrial customers because most of load operations in industrial sector are intimately related with production schedule. So, it is possible that the inappropriate control of loads in industrial sector causes huge economic loss. In this paper, therefore, we propose load control algorithm for factory energy management system(F-EMS) to achieve not only minimizing the electricity charges but also maintaining production efficiency by considering characteristics of load operation and production schedule. Considering characteristics of load operation and production schedule, the proposed load control algorithm can reflect the various characteristics of specific industrial customer and control their loads within the range that the production efficiency is maintained. Simulation results show that the proposed load control algorithm for F-EMS leads to significant reduction in the electricity charges and peak power in industrial sector.

• Journal of the Korea Institute of Building Construction
• /
• v.12 no.6
• /
• pp.558-565
• /
• 2012

Schedule management of construction work is critical to completing construction projects within a given period of time. Many efforts have been made and multiple tools have been developed to support the management of construction projects using smart devices such as smartphones and tablet PCs. This study proposed a method for managing construction schedules via a smart device using Flash. The interactive and graphic properties of Flash enable the development of an app that can allow a field manager to manage schedules easily and efficiently. A prototype was implemented using Adobe Flex Builder, and a sample network was applied in a smartphone. It is convenient for a construction manager to manage construction schedules using the tool because Flash controls graphic components easily. In further studies, network diagrams such as CPM (Critical Path Method) should be developed and applied to the app.