• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.370-375
• /
• 1992

This paper deals with the scheduling and simulation for FMC(Flexible Manufacturing Cells). In order to achieve CIM, there is a critical need to link factory level and machine level. The primary functions performed by this link for all jobs issued to the shop floor and cell include short-term scheduling and dynamic operational scheduling. Here, hierarchical control structure is introduced to define these functions. And Intelligent scheduling through expert module is adopted for efficiency of FMC operation. Computer simulation reveals that expert scheduling method is better than heuristics in various performance index.

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

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.8
• /
• pp.1622-1626
• /
• 2011

Recently, interests on microgrids have been growing as clean power systems. Microgrids include small scaled distributed generation such as wind and solar power as well as diesel generators as main power sources. To operate a microgrid effectively, optimal scheduling for the microgrid is important. Especially, in the grid-connected mode, power trades between the microgrid and the power grid should be considered in optimal scheduling. In this paper, mathematic models for optimal operation of a microgrid were established based on the linear programming. In particular, the shiftable load was considered in the models to optimize it in microgrid operation. To show feasibility of the proposed models, they were applied to optimal microgrid operation and the results were discussed.

• Proceedings of the KIEE Conference
• /
• 1995.11a
• /
• pp.513-515
• /
• 1995

A computer aided process is inevitable for the optimization of train operation planning. Developing of train diagrams is very important for the train operation planning. In this paper, the user friendly program related to the train scheduling that can be used for the basic data on developing of train diagram is introduced. It can also provide basic data for other train operation plannings, such as Timetabling, Crew Operation Scheduling, etc. It provides the planner with data moving, data changing and zooming functions, and it can assist the user easily produces their optimal solution. All this operations are performed interactively through graphic windows.

• Journal of Energy Engineering
• /
• v.6 no.1
• /
• pp.19-25
• /
• 1997

This paper presents the short-term operation scheduling on cogeneration system connected with auxiliary equipment by using the possibility fuzzy theory. The possibility fuzzy theory is a method to obtain the possibility boundary of the solution from the fuzzification of coefficients. Simulation is carried out to obtain the boundary of heat production in each time interval. Simulation results show the flexible operation boundary to establish effectively operation scheduling.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.41 no.1
• /
• pp.9-17
• /
• 1992

Proper resource allocation is also a very important topic in power system problems, especially in operation and planning. One such is optimal maintenance problem in operation and planning. Least cost and highest reliability should be the subjects to be pursued. A probabilistic operation simulation model developed recently by authors is applied to the proboem of optimal maintenance scheduling. Three different methods are compared, marginal maintenance cost, levelized risk and maintenance space. The method by the marginal maintenance costs shows the least cost, the highest reliability and the highest maintenance outage rates. This latter characteristics may considerably influence the results of genetation planning, because the usual maintenance outages obtained from the other methods have shown to be lower.

• IE interfaces
• /
• v.13 no.4
• /
• pp.680-687
• /
• 2000

The objectives of this research are to establish the operation scheduling and the preventive maintenance system in order to optimize the operation of mailing center. For the optimal operation scheduling of mailing process, the existing workflow of mailing process and that of required time are investigated prior to simulation modeling. The simulation experiments are conducted to increase the nextday delivery rate. The best alternative whose nextday delivery rate up to 100% is selected based the AHP(Analytic Hierarchy Process) method. The optimal work scheduling of all mailing centers are also presented. In addition, the CMMS(Computerized Maintenance Management System) for preventive maintenance is introduced for efficient operation of highly automated facilities of mailing center.

• Journal of Korean Institute of Industrial Engineers
• /
• v.41 no.1
• /
• pp.1-9
• /
• 2015

In shipbuling processes, a quay wall is a major resource for additional operations after an erection operation at dock. A quay wall is becoming a new bottleneck instead of docks, while ship types with long operation time at quay wall are increasing recently. We developed a quay wall scheduling algorithm for the quayside operations of ships in this paper. The objective function is to minimize the sum of not assigned days of ships which have to be assigned to any quay wall under limited numbers of quay walls. The scheduling algorithm is based on an assignment method to assign each ship to a quay wall among its alternative quay walls at the time of launching or moving to another quay wall. The scheduling algorithm is also using Tabu Search algorithm to optimize assignment sequence of ships. The experiment shows that the algorithms in this paper are effective to make schedule of the quayside operations of ships.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.1
• /
• pp.85-101
• /
• 1995

Automated Guided Vehicles(AGVs) are widely used in computer integrated manufacturing(CIM) systems for material handling purposes. Although automated guided vehicles provide higher levels of flexibility and computer integrability, the installations are limited in number and one of the critical reasons lies in the complexity involved in the operation. The main objective of this research is to alleviate this problem by proposing efficient integrated operational control methods for AGV-based CIM systems. Particularly, this research is concerned with the mixed problem of dispatching automated guided vehicles and scheduling machines operation. The proposed dynamic heuristic algorithm uses various priority schemes and relevant information concerning the load of the system, the status of queues, and the position of AGVs in the scheduling process. The scheduling decision process is hierarchical in the sense that different decision criteria are applied sequentially to identify the most appropriate part to be served. This algorithm consists of two sections, the section of part selection by AGVs for the next service whenever an AGV completes the current assignment, and the section of part selection by machines for next service whenever a machine completes the current operation. The proposed algorithm has been compared with other scheduling schemes using the performance measure of mean flow-time and mean tardiness. Simulation results indicate that the proposed algorithm can reduce the mean flow-time and mean tardiness significantly.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.2
• /
• pp.260-267
• /
• 2007

Systematic studies on the dispatch scheduling algorithm can enhance the efficiency of electricity market operation. In addition, as the dispatching policies in competitive electricity markets directly affect the market participants' profits, the dispatch scheduling procedure should be reasonable, systematic, and transparent. In this paper, we propose an unconstrained/constrained pre-dispatch scheduling algorithm and develop corresponding programs applicable to wholesale electricity markets.