• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.9
• /
• pp.133-141
• /
• 2019

Crew rostering in railway operations is usually done by arranging a crew diagram in accordance with working standards every month. This study was done to identify the problems related to the creation of crew rosters in railway operations and to suggest an optimum crew rostering method that can be applied in railway operations planning. To do this, the work standards of a railway company were identified, and a genetic algorithm was used to develop an optimal roster with equal working time while considering actual working patterns. The optimization process is composed of analysis of the input data, creation of work patterns, creation of a solution, and optimization steps. To verify the method, the roster derived from the proposed process was compared with a manually created roster. The results of the study could be used to reduce the deviation of business hours when generating a roster because the standard deviation of working time is the objective function.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.40 no.6
• /
• pp.551-561
• /
• 1991

The probabilistic generation simulation plays a key role in power system expansion and operational planning especially for the calculation of expected energy, loss of load probaility and unserved energy expected. However, it is crucial to develop a probabilistic generation simulation algorithm which gives sufficiently precise results within a reasonable computation time. In a previous paper, we have proposed an efficent method using Fast Hartley Transform in convolution process for considering the thermal and nuclear units. In this paper, a method considering the scheduling of pumped-storage plants and hydro plants with energy constraint is proposed. The method also adopts FHT techniques. We improve the model to include multi-state and multi-block generation. The method has been applied for a real size model system.

• IE interfaces
• /
• v.16 no.4
• /
• pp.463-472
• /
• 2003

In this study we consider the problem of MPS(master production planning) of TFT-LCD(Thin Film Transistor - Liquid Crystal Display) production factory. Due to the complexities of the TFT-LCD production processes, it is difficult to build effective MPS. This study presents an algorithm having a concept of IDPQ(Ideal Daily Production Quantity) that considers line balancing of TFT-LCD production process. In general, the MPS building procedure does not consider line balancing in non-bottleneck processes. MPS without considering line balancing may make ineffective schedule. We present algorithms for building MPS considering factory capacity and line balancing according to the sales order.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.4
• /
• pp.115-131
• /
• 1997

The problem addressed in this paper is to minimize the deviations of workloads assigned to worker and to maximize the total utilizations(degree of skill) between workers and machines simultaneously. Each worker can handle the set of machines with the different degree of skill and each machine has the workloads needed to be processed. Also, each worker has to be assigned to at least one machine with the minimum workload deviation. This problem can be formulated as a preemptive goal programming with generalized assignment constraints. The proposed algorithm consists of two phases. First, a capacitated circulation network is constructed to assign the workers to machines with the maximum total utilizations while considering workloads balance. Then, a refinement process is applied to the split machines to satisfy the feasibility condition. The real industrial application in a plastic extrusion manufacturer is included along with several computational experiments.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.26 no.2
• /
• pp.68-74
• /
• 2003

Modem automated manufacturing processes employ automated guided vehicles(AGVs) for material handling, which serve several machining centers(MCs) in a factory. Optimal scheduling of AGVs can significantly help to increase the efficiency of the manufacturing process by minimizing the idle time of MCs waiting for the raw materials. In this paper, we will analyse the requirements for an optimal schedule and then provide a mathematical framework for an efficient schedule of material delivery by an AGV. With this model, the optimal number of MCs to be utilized will also be determined. Finally, the material delivery schedule employing multiple journeys to the MCs by the AGV will be carried out. Through rigorous analysis and simulation experiments, we shall show that such a delivery strategy will optimize the overall performance.

• Proceedings of the KIEE Conference
• /
• 1989.11a
• /
• pp.194-196
• /
• 1989

The production costing plays a key role in power system expansion and operations planning especially for the calculation of expected energy, loss of load probability and unserved energy. Therefore, it is crucial to develope a probabilistic production costing algorithm which gives sufficiently precise results within a reasonable computational time. In this respect, a number of methods of solving production simulation have been proposed. In previous paper we proposed the method used Fast Hartley Transform in convolution process with considering only the thermal units. In this paper, the method considering the scheduling of pumped-storage plants and hydro plants with energy constraints is proposed.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.26 no.9
• /
• pp.1888-1896
• /
• 2002

This study presents a new type of CNC interpolator that is capable of generating cutter paths for ball-end milling of NURBS surfaces. The proposed surface interpolator comprises real-time algorithms for cutter contact (CC) path scheduling and CC path interpolator. Especially in this study, a new interpolator module to regulate cutting forces is developed. This propose algorithm utilizes variable-feedrate commands along the CC path according to the curvature of machined surfaces during the interpolation process. Additionally, it proposes an OpenGL graphic library for computer graphics and animation of interpolated tool-position display. The proposed interpolator is evaluated and compared with the existing method based on constant feedrates through computer simulations.

• Proceedings of the KAIS Fall Conference
• /
• 2010.05b
• /
• pp.1180-1180
• /
• 2010

본 연구는 비안정적인 rework 발생 확률 자체가 납기 및 제품 품질에 매우 나쁜 영향을 미치는 복잡한 제조공정을 대상으로 rework 발생 확률의 변화에 따라 작업의 투입정책(dispatching policy)을 동적으로 변화시킬 수 있는 스케줄링 기법을 제안한다. 본 연구에서는 강화학습(reinforcement learning) 기법을 이용하여 시간의 흐름에 따라 변화하는 rework 발생 확률을 기반으로 작업 투입정책의 모수를 동적으로 조정함으로써 효율적인 투입계획을 수립하는 적응형 스케줄링 알고리즘을 제안하고, 다양한 현실적인 시나리오를 개발하여 그 성능을 테스트한다.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.1
• /
• pp.129-139
• /
• 2013

In this paper, we proposed a new hardware architecture for calculating digital holograms at high speed, and verified it with field programmable gate array (FPGA). First, we rearranged memory scheduling and algorithm of computer generated hologram (CGH), and then introduced pipeline technique into CGH process. Finally we proposed a high-performance CGH processor. The hardware was implemented for the target of FPGA, which calculates a unit region of holograms, and it was verified using a hardware environment of NI Inc. and a FPGA of Xilinx Inc. It can generate a hologram of $16{\times}16$ size, and it takes about 4 sec for generating a hologram of a $1,024{\times}1,024$ size, using 6K point sources.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.31 no.4
• /
• pp.106-113
• /
• 2008

본 논문에서는 유한용량 재진입 생산라인에서의 스케줄링 문제에 대한 유전자적 접근 방법을 제안하였다. 알고리즘에서 사용되는 염색체의 구조는 워크스테이션의 버퍼레벨에 대한 모든 가능한 경우를 고려하여 정의되었으며, 염색체의 각 유전자에는 그에 대응되는 시스템 상태에서 우선 순위를 갖는 작업 단계의 값이 할당되도록 하였다. 또한, 제안된 알고리즘의 구현 방법으로서 워크스테이션의 버퍼와 프로세싱 자원을 할당할 때 작업 간 우선 순위를 고려하는 동시에 각 워크스테이션의 로컬 유휴 상태를 지양하는 우선순위 기반 랜덤화 정책 알고리즘을 제안하였다. 실험을 통하여 제안된 알고리즘의 성능을 평가하였으며, 기존에 무한용량 재진입 생산라인 스케줄링 문제에 많이 이용되었던 휴리스틱과 비교하여 보다 효율적임을 보였다.