• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1998.10a
• /
• pp.216-219
• /
• 1998

This study proposes JPT(Job-Pair Tardiness) that choose operation to be expected to generate better schedule consequence in comparing schedulable operation sets in pair to minimize total tardiness evaluation function in performing scheduling. In result of comparison with existing assignment rules. JPT generates better solution than most other rules in all kinds of problems. So it is anticipated that this is used for initial solution of heuristic and is used for finding more improved solution.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.37
• /
• pp.201-210
• /
• 1996

Although FMS implementation in Korea is not yet mature, the worldwide empirical data shows the diffusion of FMS is inevitable in near future. As the reletionships between the high capital cost and the relative benefits and advantages are complex to analyse, it is rather beneficial to prepare the effective operation strategies which exploit the FMS flexibility, such as machine loading with alternative routing and dispatching rules. This paper shows the formulation applying a goal programming model for the loading problem with objectives of minimizing the production cost and maximizing the machine utilization, including constraints such as machine tool capacity and demands, etc. A realistic random FMS model is developed for illustration. Since loading and dispatching are a composite of two interdependent tasks, simulation is made to investigate the interactions between the two.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.50
• /
• pp.161-170
• /
• 1999

This paper evaluates forty different dispatching rules with respect to twenty different performance measures of job shop scheduling under seven levels of workload imbalance. Computer simulation is used as a tool to determine rankings of the dispatching rules for a given workload imbalance. The experiments results show rankings of dispatching rules are different in the job shop with unbalanced machine workloads. As variations of workload imbalance increase from 7% to 78%, the performance of dispatching rules is gradually deteriorated in measure related to completion time and due date. These results guide scheduling practitioners not only to choosing dispatching rules but also to developing the model of facility investment for workload balance, when there are different levels of workload imbalance.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2002.05a
• /
• pp.99-105
• /
• 2002

컨테이너 터미널의 수출 장치장은 수출될 컨테이너들이 지속적으로 반입되어 해당 선박에 선적되기까지 일시적으로 보관되는 장소이다. 장치장의 공간 활용도를 높이면서 선적 시 작업의 능률을 극대화하기 위해서는 여러 가지 제약조건과 장치 규칙에 따라 컨테이너들의 장치 위치를 결정해야 할 뿐 아니라, 소정의 기간을 대상으로 그 동안 반입 예정인 전 컨테이너들에 대한 적절한 공간할당 계획을 미리 수립해 두어야 한다. 본 논문에서는 수출 장치장 계획 문제를 제약조건만족 문제로 보고 이를 효과적으로 해결하기 위한 탐색 기법을 제시하고 있다 대규모의 탐색공간으로부터 효율적으로 해를 찾기 위해 dependency-directed backtracking 기법을 적용하였고, 탐색 중에 제약조건을 만족하는 해를 찾기 어렵다고 판단될 경우에는 일부 제약조건을 완화하여 해를 재 탐색하는 제약조건 완화 기법을 적용하였다. 실제 부산 신선대 컨테이너 터미널의 데이터를 이용한 실험 결과 만족할 만한 수준의 계획을 빠른 시간 내에 수립할 수 있음을 확인하였다

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.25 no.3
• /
• pp.41-49
• /
• 2002

In the study, for the practical approaches of job shop scheduling, we propose the new dispatching rules of job shop scheduling in order to complement the practical applications in the existing researches. The assumed situation for the practical approaches considers the following; relaxation of assumption for capacity constraint by machine flexibility, the addition of the common use of jig and fixture, unbalanced machine workloads and duedate tightness, and produces fast rescheduling that reflects unexpected situations. The performance of the new dispatching rules is compared and analyzed with the existing methods through the computer experiments in the assumed conditions. The results can be useful to improving a field application of the job shop scheduling.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.396-399
• /
• 2013

TDMA(Time-Division Multiple Access)는 한정된 채널을 시간상에서 여러 개의 구간으로 분할하고, 자신에게 할당된 시간 구간에서 정보를 전송하는 기법이다. 본 논문은 TDMA 알고리즘의 한 종류인 DESYNC 알고리즘을 소규모 네트워크에 적용하여 별도의 동기화 작업 없이 간단한 규칙으로 동기화를 유지하는 기법을 소개 한다. 기존의 DESYNC 알고리즘은 모든 노드들이 전송 영역 안에 있어야 하고, 전부 연결되어있어야 한다는 단점이 있다. 이 문제점을 해결하고자 중앙제어장치인 CU(Central Unit)을 네트워크에 배치하여 2-홉 형태의 중앙 집중방식 네트워크가 운영되도록 하였다. 제시하는 알고리즘은 기존의 DESYNC 알고리즘과 마찬가지로 복잡한 동기화 과정 없이 단순한 방식으로 TDMA가 동작할 수 있도록 하면서, 전송 범위는 기존의 DESYNC 알고리즘의 성능에 비해 우수하다.

• Journal of Korea Society of Industrial Information Systems
• /
• v.14 no.4
• /
• pp.75-90
• /
• 2009

Improvement of productivity and efficient process management need to define the problem of the previous work. If it takes long time to gather necessary information, it becomes difficult to continuously manage processes to satisfy customers' needs and to enhance business efficiency. This paper proposes methods and a context awareness system for decision making to solve problems originated in management of manufacturing process through real-time information acquisition. We implement the context awareness by suggesting decision logics that automatically classify works with acquired information. And we also implement a system for case study which makes workers recognize problems and notifies instructions to them. Consistency between real object and stored data and continuous process monitoring with this system could find inefficient resources or delayed works, resolve them and improve processes efficiency.

• Journal of the Korea Society for Simulation
• /
• v.18 no.2
• /
• pp.29-38
• /
• 2009

In the computing environment with heterogeneous resources, a job scheduling model is necessary for effective resource utilization and high-speed data processing. And, the job scheduling model has to cope with a dynamic change in the condition of resources. There have been lots of researches on resource estimation methods and heuristic algorithms about how to distribute and allocate jobs to heterogeneous resources. But, existing researches have a weakness for system compatibility and scalability because they do not support the standard language. Also, they are impossible to process jobs effectively and deal with a variety of computing situations in which the condition of resources is dynamically changed in real-time. In order to solve the problems of existing researches, this paper proposes a semantic computing-based dynamic job scheduling model that defines various knowledge-based rules for job scheduling methods adaptable to changes in resource condition and allocate a job to the best suited resource through inference. This paper also constructs a resource ontology to manage information about heterogeneous resources without difficulty as using the OWL, the standard ontology language established by W3C. Experimental results shows that the proposed scheduling model outperforms existing scheduling models, in terms of throughput, job loss, and turn around time.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.4
• /
• pp.21-29
• /
• 2023

In this paper, we propose an AI-based system for automatically classifying industry and occupation codes in the population census. The accurate classification of industry and occupation codes is crucial for informing policy decisions, allocating resources, and conducting research. However, this task has traditionally been performed by human coders, which is time-consuming, resource-intensive, and prone to errors. Our system represents a significant improvement over the existing rule-based system used by the statistics agency, which relies on user-entered data for code classification. In this paper, we trained and evaluated several models, and developed an ensemble model that achieved an 86.76% match accuracy in industry and 81.84% in occupation, outperforming the best individual model. Additionally, we propose process improvement work based on the classification probability results of the model. Our proposed method utilizes an ensemble model that combines transfer learning techniques with pre-trained models. In this paper, we demonstrate the potential for AI-based systems to improve the accuracy and efficiency of population census data classification. By automating this process with AI, we can achieve more accurate and consistent results while reducing the workload on agency staff.

• Journal of Navigation and Port Research
• /
• v.39 no.1
• /
• pp.45-53
• /
• 2015

These days Container Terminals are focusing on increasing the quantity of containers and shipping lines choose Terminals by referring to the key elements of a terminal to perform the overall operation the fastest such as the location of the terminal, discharging ability, keeping environment, and other elements related to shipping in general. Container terminal is able to offer On-Dock service has become an important factor for shipping lines to choose that terminal. In this paper, we propose an algorithm for On-Dock system work algorithm, the algorithm Empty container exports, Full Container algorithm and The aim of our study focus on both container's gate out time and search for the effective terminal operation which is using the general On-Dock system through several algorithm like container batch priority, gate in and out job priority and empty container yard equipment allocation rule based on the automatic allocation method and manual allocation scheme for container. Gathering these information, it gives the priority and yard location of gate-out containers to control. That is, by selecting an optimum algorithm container, container terminals Empty reduces the container taken out time, it is possible to minimize unnecessary re-handling of the yard container can be enhanced with respect to the efficiency of the equipment. Operations and operating results of the Non On-Dock and On-Dock system is operated by the out work operations (scenarios) forms that are operating in the real Gwangyang Container Terminal derived results. Gwangyang Container terminal and apply the On-Dock system, Non On-Dock can be taken out this time, about 5 minutes more quickly when applying the system. when managing export orders for berths where On-Dock service is needed, ball containers are allocated and for import cargoes, D/O is managed and after carryout, return management, container damage, cleaning, fixing and controlling services are supported hence the berth service can be strengthened and container terminal business can grow.