• The Journal of Korean Association of Computer Education
• /
• v.7 no.1
• /
• pp.97-106
• /
• 2004

Recently, the demand for the customized courseware which is required from the learners is increased. Therefore the needs of the efficient and automated education agents in the web-based instruction are recognized. In this paper we propose a multi-agent system for course scheduling of learner-oriented using weakness analysis algorithm. At first proposed system analyze learner's result of evaluation and calculates learning accomplishment. From this accomplishment the multi-agent schedules the suitable course for the learner. The learner achieves an active and complete learning from the repeated and suitable course.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.1
• /
• pp.197-213
• /
• 1997

It is not easy to find a good production schedule which can be used in practice. Therefore, production scheduling simulation with a simple dispatching rule or a set of dispatching rules is used. However, a simple dispatching rule may not create a robust schedule, for the same rule is blindly applied to all internal production processes. The presumption is that there might be a specific combination of appropriate rules that can improve the efficiency of a total production system for a certain type of orders. In order to acquire a better set of dispatching rules, simulation is used to examine the performance of various combinations of dispatching rule sets. There are innumerable combination of rule sets. Hence it takes too much computer simulation time to find a robust set of dispatching rule for a specific production system. Therefore, we propose a concept of the knowledge based simulation to circumvent the problem. The knowledge based simulation consists of knowledge bases, an inference engine and a simulator. The knowledge base is made of rule sets that is extracted from both simulation and human intuition obtained by the simulation studies. For a certain type of orders, the proposed system provides several sets of dispatching rules that are expected to generate better results. Then the scheduler tries to find the best by simulating all proposed set of rules with the simulator. The knowledge-based simulator armed with the acquired knowledge has produced improved solutions in terms of time and scheduling performance.

• Management Science and Financial Engineering
• /
• v.18 no.1
• /
• pp.1-12
• /
• 2012

In this paper, we report a case study on the common due-date assignment and scheduling problem in a paper remanufacturing system that produces corrugated cardboards using collected waste papers for a given set of orders under the make-to-order (MTO) environment. Since the system produces corrugated cardboards in an integrated process and has sequence-dependent setups, the problem considered here can be regarded as common due-date assignment and sequencing on a single machine with sequence-dependent setup times. The objective is to minimize the sum of the penalties associated with due-date assignment, earliness, and tardiness. In the study, the earliness and tardiness penalties were obtained from inventory holding and backorder costs, respectively. To solve the problem, we adopted two types of algorithms: (a) branch and bound algorithm that gives the optimal solutions; and (b) heuristic algorithms. Computational experiments were done on the data generated from the case and the results show that both types of algorithms work well for the case data. In particular, the branch and bound algorithm gave the optimal solutions quickly. However, it is recommended to use the heuristic algorithms for large-sized instances, especially when the solution time is very critical.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.4
• /
• pp.646-652
• /
• 2015

In this paper, the system-level performance is evaluated for the feedback scheme on the pre-coding matrix index (PMI) and channel quality indication (CQI), which are required for user selection in the multi-user MIMO system. Our analysis demonstrates that the number of users, the number of selected users, and codebook size are the key factors that govern the performance of the best companion grouping (BCG)-based user scheduling. Accordingly, we have confirmed that the probability of forming the co-scheduled user group is determined by these factors, which implies that the number of PMI's and codebook size can be dynamically determined so as to maximize the average system throughput as the number of users varies in the cell.

• Proceedings of the KSR Conference
• /
• 2008.06a
• /
• pp.1359-1370
• /
• 2008

In the track geometry such as rails, sleepers, ballasts and fastener, track deterioration occurs by repetitive train weight and the high-speed railway takes a trend faster than normal. Track deterioration of over threshold value harms ride comfort and furthermore affect in trains safety seriously. An organic and systematic track maintenance system is very important because a trend of the track deterioration effects on track life-cycle and running safety. Also costs of the railway track permanent way and its maintenance are extremely large, forming a significant part of the total infrastructure expenditure. Therefor reasonable and efficient track maintenance has to be planed on a budget. It is required to carry out not only corrective maintenance but preventive maintenance for the track maintenance. In order to perform maintenance jobs in the boundary of the machines and resources given regarding the type and amount jobs, it is necessary to determine feasible or optimal scheduling considering the priority. In this study, the system organization and required functions for the development of track maintenance system supported track deterioration prediction and optimal scheduling are proposed.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.3
• /
• pp.93-100
• /
• 2004

Test scheduling of SoC (System-on-a-chip) is very important because it is one of the prime methods to minimize the testing time under limited power consumption of SoC. In this paper, a heuristic algorithm, in which test resources are selected for groups and arranged based on the size of product of power dissipation and test time together with total power consumption in core-based SoC is proposed. We select test resource groups which has maximum power consumption but does not exceed the constrained power consumption and make the testing time slot of resources in the test resource group to be aligned at the initial position in test space to minimize the idling test time of test resources. The efficiency of proposed algorithm is confirmed by experiment using ITC02 benchmarks.

• IE interfaces
• /
• v.13 no.4
• /
• pp.564-571
• /
• 2000

Manufacturing companies are implementing a so-called customer-centered supply chain management to have a competitive advantage. In these efforts, collaboration not only within a company but also with suppliers, partners and customers is emphasized. The fast delivery, reducing the total lead-time from development to delivery, is pursued more than ever, though the quality and cost are still importantly regarded. Die manufacturing companies are not exception from these trends, because a die is a necessary tool for almost manufacturing industries. The planning and scheduling system plays an important role in supply chain management. In this study, we address a scheduling problem of a die manufacturing company. The problem is very complex due to many reasons including the uncertainty in environment and the complexity of constraints. Considering the importance of due-date satisfaction and human planners' roles, we designed the solution algorithm and the user interface respectively. In the implementation phase, modeling constructs and basic solution algorithms of ILOG solver and ILOG scheduler are used. In the paper, the problem and the algorithm are described with ILOG constructs, and the experience of use is also addressed.

• Industrial Engineering and Management Systems
• /
• v.15 no.3
• /
• pp.278-288
• /
• 2016

Automation ensures accurate and well-organized container transportation in container terminals. This paper addresses operational issues such as equipment scheduling and the coordination between various pieces of equipment in a rail-based automated container terminal. Containers are relayed using multiple types of equipment from road trucks to a vessel and vice versa. Therefore, handshaking is required during a container transfer between different pieces of equipment. Synchronization between the schedules of all the equipment is important to reduce equipment waiting times and the time required for transporting containers, which results in a short turnaround time for a vessel. This paper proposes an integrated control system with the objective of synchronizing the operations of different types of equipment, provides a list of decisions to be made by the control module of each type of equipment, and shows all the required information transfers between control modules. A scheme for the integrated scheduling of multiple types of equipment is proposed. The decisions made by each control module in a real-time fashion are listed with detailed explanations, and the information transfer between managers in a real-time situation at the proposed terminal is described.

• 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.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.1
• /
• pp.103-109
• /
• 2019

The automotive electronic system should provide a method that can be safely performed by loading a number of application programs having time constraints in several electronic control devices. In this paper, we propose a timing protection mechanism for AUTOSAR, which is a real - time operating system specification for automotive field, in order to observe the deadline of each task when scheduling real - time tasks. We propose a dynamic non-preemption algorithm to guarantee a flexible deadline for fixed priority or dynamic priority tasks, and a location where execution time can be monitored for errors, and suggest ways to implement the AUTOSAR time protection mechanism.