• The Journal of Society for e-Business Studies
• /
• v.25 no.1
• /
• pp.1-12
• /
• 2020

Recently, research using machine learning have shown remarkable results in various domains, leading to the fact that leaning-based dispatchers have intrigued interest in both academia and industry. To improve the performance of the dispatcher, each dispatch decision needs to be evaluated in detail. However, existing studies on visualization techniques for manufacturing lines have mainly focused on illustrating the performance indicators or abnormal patterns. In this paper, we propose a monitoring system that displays a variety of information about the manufacturing line along with alternatives at the time of each dispatching decision being made. Furthermore, the proposed system effectively represents the cause of the idle time of resources and the change of the performance index over time.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.1
• /
• pp.33-40
• /
• 2019

This study focuses on a job-shop scheduling problem with the objective of minimizing total tardiness for the job orders that have different due dates and different process flows. We suggest the dispatching rule based scheduling algorithm to generate fast and efficient schedule. First, we show the delay schedule can be optimal for total tardiness measure in some cases. Based on this observation, we expand search space for selecting the job operation to explore the delay schedules. That means, not only all job operations waiting for process but also job operations not arrived at the machine yet are considered to be scheduled when a machine is available and it is need decision for the next operation to be processed. Assuming each job operation is assigned to the available machine, the expected total tardiness is estimated, and the job operation with the minimum expected total tardiness is selected to be processed in the machine. If this job is being processed in the other machine, then machine should wait until the job arrives at the machine. Simulation experiments are carried out to test the suggested algorithm and compare with the results of other well-known dispatching rules such as EDD, ATC and COVERT, etc. Results show that the proposed algorithm, MET, works better in terms of total tardiness of orders than existing rules without increasing the number of tardy jobs.

• Journal of Korean Port Research
• /
• v.13 no.2
• /
• pp.189-198
• /
• 1999

The purpose of this paper is to develop a knowledge-based real-time decision support system to support decision makers for efficient berth operation of Inchon Port. In these days the berth operation problems have been many studied. The berth operation rules differ from port to port and the problem is highly dependent on natural geographical and operational environment of port. In Inchon Port the ship’s entrance into port and departure from port is extremely affected status of dock. In this paper we analyzed some effects of dock a specific character of Inchon Port with a real data of ship’s in Inchon Port. And reconstruct a previous expert’s knowledge of berth allocating problem in Inchon Port. Also the mechanism for the efficient berth operation has been studied by repeatedly dispatching in order to obtain a best effect of berth allocation, with real-time updated information for delay at service time of a specific berth and changing of a working-berth. The system is developed with graphic user interface(GUI) concept using user interactive approach. And this system will be provide decision support maker with an efficient and fast way to berth allocating and reduce wastes of time space and manpower in Inchon Port operation.

• IE interfaces
• /
• v.11 no.3
• /
• pp.181-191
• /
• 1998

In the make-to-order (MTO) manufacturing environment, one of the important issues is setting attainable delivery dates for customer orders, which significantly affects the performance of the MTO manufacturing. Although this topic has received considerable attention in the literature, most of the efforts took a lower level approach that is concerned primarily with the effect of various delivery date assignment methods on the relative performance of some dispatching rules. This paper proposes the delivery date decision support system which takes a higher level approach of integrating the marketing and production planning functions with the consideration of the current capacity and the workload smoothing. The proposed system has been implemented in a Rotating Machinery Shop and the results of the implementation showed good performance.

• 제어로봇시스템학회:학술대회논문집
• /
• 1994.10a
• /
• pp.390-394
• /
• 1994

A elevator group supervisory system is designed to perform efficient operation of multiple elevators, and its basic function is to assign an appropriate elevator to a given hall-cell. In this paper, in order to improve elevator group control performance, we propose a new dispatching system which includes fuzzy multi-attribute decision making(MADM). In most cases, the purpose of group control is to maximize control goals as much as possible. Unfortunately, the decision of optimal elevator to a given hall cell is made with very uncertain information of the system, and some of control goals are related each other. The uncertainty is mainly resulted from car calls generated by serving hall calls. A fuzzy MADM algorithm is proposed to deal with these problems to improve system performance.

• Journal of the Korean Society for Precision Engineering
• /
• v.32 no.1
• /
• pp.25-37
• /
• 2015

This paper suggests a decision tree based approach for flexible job shop scheduling with multiple process plans. The problem is to determine the operation/machine pairs and the sequence of the jobs assigned to each machine. Two decision tree based scheduling mechanisms are developed for static and dynamic flexible job shops. In the static case, all jobs are given in advance and the decision tree is used to select a priority dispatching rule to process all the jobs. Also, in the dynamic case, the jobs arrive over time and the decision tree, updated regularly, is used to select a priority rule in real-time according to a rescheduling strategy. The two decision tree based mechanisms were applied to a flexible job shop case with reconfigurable manufacturing cells and a conventional job shop, and the results are reported for various system performance measures.

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

This paper describes an intelligent user interface to define simulation models from the process and resource models. It also explains an automatic program generator of discrete event simulation model for shop floor control in a flexible manufacturing system. Especially, the paper is focused on the design and development of methodology to automate simulation modeling from the system description. Describing a shop floor control system in simulation is not an easy task since it must resolve various decision problems such as deadlock resolution, part dispatching, resource conflict resolution, etc. The program generator should be capable of constructing a complete discrete simulation models for a multi-product and multi-stage flow shop containing the above mentioned problems.

• Journal of the military operations research society of Korea
• /
• v.12 no.1
• /
• pp.87-105
• /
• 1986

Among the various types of waiting line systems, the elevator servicing system is quite different from the usual queueing system in view of the service characteristics. For example, the FIFO discipline is not always valid depending upon the situation when the direction of first-come customer's is opposite of the operating elevator direction and at that time a later-arrived one has a luck to be served first. In this paper, a simulation model is constructed and tested by the sample data and the results have turned out to be fairly adequate. This model, therefore, will provide a good guide to anyone who is interested in the decision of optimal location selection of no-passenger elevator in high buildings whatsoever. This model is also available, with slight modification, to the problem of city bus dispatching or any other waiting line problems where the servicing equipments are moving.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.4
• /
• pp.1508-1517
• /
• 2015

Optimal Power dispatch is the short-term decision of the optimal output of a number of power generation facilities, to meet the system demand, with the objective of Power dispatching at the lowest possible cost, subject to transmission lines power loss and operational constraints. The operational constraint includes power balance constraint, generator limit constraint, and emission dispatch constraint and valve point effects. In this paper, Opposition based Differential Evolution Algorithm (ODEA) has been proposed to handle the objective function and the operational constraints simultaneously. Furthermore, the valve point loading effects and transmission lines power loss are also considered for the efficient and effective Power dispatch. The ODEA has unique features such as self tuning of its control parameters, self acceleration and migration for searching. As a result, it requires very minimum executions compared with other searching strategies. The effectiveness of the algorithm has been validated through four standard test cases and compared with previous studies. The proposed method out performs the previous methods.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.208-215
• /
• 1995

Numerous solution methods for scheduling problems such as part dispatching problem, operation sequence problem have been suggested as a means to be embedded in hierarchical or centralized shop floor control. Under the preceding control philosophies, however, response to changes in the shop floor status is quite slow and timely decision is sometimes impossible. Moreover, the control software becomes too large and it is almost impossible to modify the control software when the configuration of the shop floor changes. In agile manufacturing which emerged recently to cope with quick response and easy modifiability when unexpected changes occur, a new control policy is needed. CSCW[Computer Supported Cooperative Work] based shop floor control casts a different view on scheduling problems. Decisions are made locally when requested and useful information is scattered among agents for its efficient use. Adaptation is easy because agents are -'plug compatible or portable. In this paper, scheduling problems occurring under CSCW based shop floor control are identified and characterized. Traditional scheduling problems are reviewed from the CSCW viewpoint. All the control entities involved in the shop floor can be found and used to defined agents. With these entities and CSCW concept, possible scheduling problems are identified.