http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
작업자 1명이 준비작업을 담당하는 이종병렬기계의 휴리스틱 일정계획
고시근 ( Koh Shiegheun ),김상운 ( Kim Sangwoun ),손준석 ( Sohn Junseok ) 한국경영공학회 2017 한국경영공학회지 Vol.22 No.3
This research deals with a scheduling problem that minimizes makespan in a single setup-operator and non-identical parallel machine system with machine dependent setup and processing times. We first present a mixed integer programming formulation for the problem, and using this formulation, the optimal solutions for small problems can be easily found. However, since the problem is NP-hard and the size of a real problem is large, we propose three genetic algorithm based heuristics to solve the practical big-size problems in a reasonable computational time. To assess the performance of the algorithms, we conduct a computational experiment, from which we found some heuristic algorithms show very good performances.
조선소의 메가블록 조립작업장을 위한 공간계획알고리즘 개발
고시근(Shiegheun Koh),장정희(Jeonghee Jang),최대원(Daewon Choi),우상복(Sangbok Woo) 대한산업공학회 2011 산업공학 Vol.24 No.1
To mitigate space restriction and to raise productivity, some shipbuilding companies use floating-docks on the sea instead of dry-docks on the land. In that case, a floating-crane that can lift very heavy objects (up to 3,600 tons) is used to handle the blocks which are the basic units in shipbuilding processes, and so, very large blocks (these are called the mega-blocks) can be used to build a ship. But, because these mega-blocks can be made only in the area near the floating-dock and beside the sea, the space is very important resource for the process. Therefore, our problem is to make an efficient spatial schedule for the mega-block assembly yard. First of all, we formulate this situation into a mathematical model and find optimal solution for a small problem using a commercial optimization software. But, the software could not give optimal solutions for practical sized problems in a reasonable time, and so we propose a GA-based heuristic algorithm. Through a numerical experiment, finally, we show that the spatial scheduling algorithm can provide a very good performance.