• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.1111-1116
• /
• 1993

In this study, we discuss the design of the expert system for the scheduling of the FMC(Flexible Manufacturing Cell) consisting of the several versatile machines. Due to the NP property, the scheduling problem of several machine FMC is very complex task. Thus we proposed the two heuritstic shceduling algorithms for solving the problem and constituted the algorithm based of solving the problem and constituted the algorithm base of ISS(Intelligent Scheduling System) using them. By the rules in the rule base, the best alternative among various algorithms in algorithm base is selected and applied in controlling the FMC. To show the efficiency of ISS, the scheduling output of ISS and the existent dynamic dispatching rule were tested and compared. The results indicate that the ISS is superior to the existent dynamic dispatching rules in various performance indexes.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.6
• /
• pp.539-545
• /
• 2010

Through the AUTOSAR methodology, the embedded software shall become more flexible, reusable, maintainable than ever. However, it is not mentioned about specific timing constraints of software components in AUTOSAR. There are a few basic principles for mapping runnable entities. At this point, AUTOSAR software design with optimal scheduling method is one of the enabling technologies in vehicle embedded system. This paper presents an approach based on mapping runnable entities and task scheduling design method for EPS (Electric Power Steering) software components, based on AUTOSAR. In addition, the experimental results of concurrent simulation show that the proposed scheduling technique and timing synchronization in the software component design can achieve the improved torque ripple performance and it well suited for EPS application software.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2010.05a
• /
• pp.207-211
• /
• 2010

As mega-sized and complex building construction projects are increased, the importance of project scheduling and control is emphasized. Project scheduling and control technic is not used widely yet in Korea, but interests in it is progressively increased. By now, most research projects mainly have focused on scheduling issues. Project progress management is also as much important as project scheduling issues. Current state about project progress management in Korea is analysed and way for improvements are suggested in this paper. At first, research projects undergone and practice are analysed and fields experts are survey about current state about project progress management. This study suggests the progress management method for quantitative and qualitative project progress analysis.

• Journal of Communications and Networks
• /
• v.7 no.4
• /
• pp.408-416
• /
• 2005

Quality of service (QoS) provision is an important and indispensable function for multi-service wireless networks. In this paper, we present a new scheduling/admission control frame­work, including an efficient rate-guaranteed opportunistic scheduling (ROS) scheme and a coordinated admission control (ROS­CAC) policy to support statistic QoS guarantee in multi-service wireless networks. Based on our proposed mathematical model, we derive the probability distribution function (PDF) of queue length under ROS and deduce the packet loss rate (PLR) for individual flows. The new admission control policy makes admission decision for a new incoming flow to ensure that the PLR requirements of all flows (including the new flow) are satisfied. The numerical results based on ns-2 simulations demonstrate the effectiveness of the new joint packet scheduling/admission control framework.

• Journal of Communications and Networks
• /
• v.16 no.3
• /
• pp.293-300
• /
• 2014

As energy harvesting communication systems emerge, there is a need for transmission schemes that dynamically adapt to the energy harvesting process. In this paper, after exhibiting a finite-horizon online throughput-maximizing scheduling problem formulation and the structure of its optimal solution within a dynamic programming formulation, a low complexity online scheduling policy is proposed. The policy exploits the existence of thresholds for choosing rate and power levels as a function of stored energy, harvest state and time until the end of the horizon. The policy, which is based on computing an expected threshold, performs close to optimal on a wide range of example energy harvest patterns. Moreover, it achieves higher throughput values for a given delay, than throughput-optimal online policies developed based on infinite-horizon formulations in recent literature. The solution is extended to include ergodic time-varying (fading) channels, and a corresponding low complexity policy is proposed and evaluated for this case as well.

• Journal of Electrical Engineering and information Science
• /
• v.3 no.1
• /
• pp.1-7
• /
• 1998

High-Level synthesis of digital circuits calls for automatic translation of a behavioral description to a structural design entity represented in terms of components and connection. One of the critical steps in high-level synthesis is to determine a particular scheduling algorithm that will assign behavioral operations to control states. A new scheduling algorithm called Data Availability Scheduling (DAS) for high-level synthesis is presented. It can determine an appropriate scheduling algorithm and minimize the number of states required using data availability and dependency conditions extracted from the behavioral code, taking into account of states required using data availability and dependency conditions extracted from the behavioral code, taking into account resource constraint in each control state. The DAS algorithm is efficient because data availability conditions, and conditional and wait statements break the behavioral code into manageable pieces which are analyzed independently. The output is the number of states in a finite state machine and shows better results than those of previous algorithms.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.2
• /
• pp.196-204
• /
• 1996

This paper presents a new scheduling algorithm, which is the most improtant subtask in the high level synthesis. The proposed algorithm performs scheduling in consideration of resource sharing concept based on characteristics of conditionsla bransches in the intermediate data structure. CDFG (control data flow graph) generated by a VHDL analyzer. This algorithm constructs a conditon graph based on time frame of each operation using both the ASAP and the ALAP scheduling algorithm. The conditon priority is obtained from the condition graph constructed from each conditional brance. The determined condition priority implies the sequential order of transforming the CDFG with conditonal branches into the CDFG without conditional branches. To minimize resource cost, the CDFG with conditional branches are transformed into the CDFG without conditonal brancehs according to the condition priority. Considering the data dependency, the hardware constraints, and the data execution time constraints, each operation in the transformed CDFG is assigned ot control steps. Such assigning of unscheduled operations into contorl steps implies the performance of the scheduling in the consecutive movement of operations. The effectiveness of this algorithm is hsown by the experiment for the benchmark circuits.

• ETRI Journal
• /
• v.24 no.5
• /
• pp.360-372
• /
• 2002

In this paper, we propose the modified dynamic weighted round robin (MDWRR) cell scheduling algorithm, which guarantees the delay property of real-time traffic and also efficiently transmits non-real-time traffic. The proposed scheduling algorithm is a variation of the dynamic weighted round robin (DWRR) algorithm and guarantees the delay property of real-time traffic by adding a cell transmission procedure based on delay priority. It also uses a threshold to prevent the cell loss of non-real-time traffic that is due to the cell transmission procedure based on delay priority. Though the MDWRR scheduling algorithm may be more complex than the conventional DWRR scheme, considering delay priority minimizes cell delay and decreases the required size of the temporary buffer. The results of our performance study show that the proposed scheduling algorithm has better performance than the conventional DWRR scheme because of the delay guarantee of real-time traffic.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.181-195
• /
• 2006

Resource-constrained project scheduling problems with variant processes can be represented and solved using a logic-based terminological language called RSV (resource constrained project scheduling with variant processes). We consider three different variants for formalizing the RSV-scheduling problem, the optimizing variant, the number variant and the decision variant. Using the decision variant we show that the RSV- problem is NP-complete. Further we show that the optimizing variant (or number variant) of the RSV-problem is computable in polynomial time iff. the decision variant is computable in polynomial time.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.369-372
• /
• 1996

The factory under this study consists of mixed-model assembly lines and workcenters which provide parts to the main lines. Parts produced by the workcenter have different specifications for different product models. The workcenters fabricate parts in batches, and they are divided into two types. A type 1 center supplies parts only to the main line that is designated to the center while type 2 center provides parts to all the main lines. The purpose of this study is to develop a scheduling scheme for the workcenter, and the main objective of the schedules is to provide parts for the main lines without delay. The facts that make the scheduling challengeable are that 1) the different models existing together on a main line request different parts, 2) the spaces for part inventories are limited and 3) set up times are sequence dependent and long in some cases. This study presents developed scheduling schemes for the type 1 center and explains the scheduling and control structure used.