• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.29 no.11 s.242
• /
• pp.1463-1471
• /
• 2005

This paper proposes an agent-based scheduling method fur semiconductor wafer fabrication facilities with hard inter-operation temporal constraints. The scheduling problem is to find the feasible schedules that guarantee both logical and temporal correctness. A proposed multi-agent based architecture is composed of scheduling agents, workcell agents, and machine agents. A scheduling agent computes optimal schedules through bidding mechanisms with a subset or entire set of the workcell agents. A dynamic planning-based approach is adopted for the scheduling mechanism so that the dynamic behaviors such as aperiodic job arrivals and reconfiguration can be taken into consideration.

• Proceedings of the KIEE Conference
• /
• 1997.11a
• /
• pp.109-112
• /
• 1997

A Discrete Event Dynamic System is a system whose states change in response to the occurrence of events from a predefined event set. A major difficulty in developing analytical results for the systems is the lack of appropriate modeling techniques. This paper proposes the use of Real-time Temporal Logic as a modeling tool for the modeling and control of fixed-time traffic control problem which by way of a DEDS. The Real-time Temporal Logic Frameworks is extended with a suitable structure of modeling hard real-time constraints. Modeling rules are developed for several specific situations. It is shown how the graphical model can be translated to a system of linear equations and constraints.

• Proceedings of the KIEE Conference
• /
• 1997.07b
• /
• pp.590-592
• /
• 1997

A Discrete Event Dynamic System is a system whose states change in response to the occurrence of events from a predefined event set. A major difficulty in developing analytical results for the systems is the lack of appropriate modeling techniques. This paper proposes the use of Real-time Temporal Logic as a modeling tool for the analysis and control of DEDS. The Real-time Temporal Logic Frameworks is extended with a suitable structure of modeling hard real-time constraints. Modeling rules are developed for several specific situations. It is shown how the graphical model can be translated to a system of linear equations and constraints.

• Journal of Engineering Education Research
• /
• v.18 no.6
• /
• pp.52-56
• /
• 2015

Usually, students write on a paper using writing materials and submit it to teachers when they do a homework or take an exam. However, there are temporal and spacial constraints because teachers and students should be in the same place at the time in this system. In addition, it is hard for teachers to maintain numerous papers from students. Applying a digital pen produced by Pen Generations Corporation to education system, we developed a smart education system transmitting image data from written papers using digital pen. As a result, teachers and students can use this system without any constraints. In addition, teachers are able to maintain their papers from students more effectively.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1333-1343
• /
• 1999

경성 실시간 시스템의 태스크들은 논리적으로 올바른 결과를 산출해야 하지만 또한 각자의 시간 제한 조건을 만족하여야 한다. 간격제한 스케줄링은 시간 제한 조건이 시간 간격 제한으로 주어지는 실시간 태스크들을 스케줄하기 위하여 도입되었다. 간격제한 스케줄링에서의 각 태스크들은 시간 간격 제한 조건을 갖는데, 이것은 태스크의 두 연속적인 수행의 종료시간에 대해 제한을 가한다. 다시 말해, 간격제한 스케줄링에서의 각 태스크 수행은 그 태스크의 직전 수행 완료 시간으로부터 발생하는 데드라인을 갖는다. 간격제한 태스크 스케줄링에 관한 많은 연구는 단순화 방법에 기초하고 있다. 그러나, 우리는 이 논문에서 단순화 방법을 사용하지 않고, 정적 우선순위 및 정적 분리 제한 정책을 채용한 새로운 간격제한 태스크 스케줄링 방법을 제안한다. 제안된 정적 할당 방법은 스케줄링 분석 및 구현을 매우 간단히 할 수 있으며, 또한 스케줄러의 실행시간 오버헤드를 줄일 수 있다.Abstract Tasks in hard real-time systems must not only be logically correct but also meet their timing constraints. The distance-constrained scheduling has been introduced to schedule real-time tasks whose timing constraints are characterized by temporal distance constraints. Each task in the distance-constrained scheduling has a temporal distance constraint which imposes restriction on the finishing times of two consecutive executions of the task. Thus, each execution of a task in the distance-constrained scheduling has a deadline relative to the finishing time of the previous execution of the task.Much work on the distance-constrained task scheduling has been based on the reduction technique. In this paper, we propose a new scheme for the distance-constrained task scheduling which does not use the reduction technique but adopts static priority and static separation constraint assignment policy. We show that our static assignment approach can simplify the scheduling analysis and its implementation, and can also reduce the run-time overhead of the scheduler.

• Korean Management Science Review
• /
• v.12 no.2
• /
• pp.43-62
• /
• 1995

For a complex scheduling system like time table construction, its optimal solution, if exists, is hard to obtain. In this paper, the scheduling environment is reasonably confined as where objects have their own events competing for better slots on boards, and objects have their own board slot preferences and belong to one or more classes of the society which globally constrains them. Here, two phase method is suggested, where the first phase is human-like preference driven and the second phase is for fine tuning by considering all the factors given. Designed and implemented in our system HI-SCHED are dynamic object switching, temporal-constraint-driven intelligent backtracking, case-based revisions, object-based approach, and so on. Some satisfaction degrees are also defined to measure the usefulness of our method. In addition, look-ahead dynamic object switching is considered, and additional global constraints are introduced and processed. A simple scheme is also used to verify the usefulness of the post processing scheme.