• Title/Summary/Keyword: Skid sequence optimization

Search Result 3, Processing Time 0.017 seconds

Shipyard Skid Sequence Optimization Using a Hybrid Genetic Algorithm

  • Min-Jae Choi;Yung-Keun Kwon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.12
    • /
    • pp.79-87
    • /
    • 2023
  • In this paper, we propose a novel genetic algorithm to reduce the overall span time by optimizing the skid insertion sequence in the shipyard subassembly process. We represented a solution by a permutation of a set of skid ids and applied genetic operators suitable for such a representation. In addition, we combined the genetic algorithm and the existing heuristic algorithm called UniDev which is properly modified to improve the search performance. In particular, the slow skid search part in UniDev was changed to a greedy algorithm. Through extensive large-scaled simulations, it was observed that the span time of our method was stably minimized compared to Multi-Start search and a genetic algorithm combined with UniDev.

Short-term Scheduling Optimization for Subassembly Line in Ship Production Using Simulated Annealing (시뮬레이티드 어닐링을 활용한 조선 소조립 라인 소일정계획 최적화)

  • Hwang, In-Hyuck;Noh, Jac-Kyou;Lee, Kwang-Kook;Shin, Jon-Gye
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.1
    • /
    • pp.73-82
    • /
    • 2010
  • Productivity improvement is considered as one of hot potato topics in international shipyards by the increasing amount of orders. In order to improve productivity of lines, shipbuilders have been researching and developing new work method, process automation, advanced planning and scheduling and so on. An optimization approach was accomplished on short-term scheduling of subassembly lines in this research. The problem of subassembly line scheduling turned out to be a non-deterministic polynomial time problem with regard to SKID pattern’s sequence and worker assignment to each station. The problem was applied by simulated annealing algorithm, one of meta-heuristic methods. The algorithm was aimed to avoid local minimum value by changing results with probability function. The optimization result was compared with discrete-event simulation's to propose what pros and cons were. This paper will help planners work on scheduling and decision-making to complete their task by evaluation.

A mean-absolute-deviation based method for optimizing skid sequence in shipyard subassembly

  • Lee, Kyung-Tae;Kwon, Yung-Keun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.12
    • /
    • pp.277-284
    • /
    • 2022
  • In this paper, we proposes a method of optimizing the processing order of skids to minimize the span time in a conveyor environment of the shipbuilding subassembly process. The subassembly process consists of a series of fixed tasks where the required work time is varied according to the skid type. The loading order of skids on a conveyor which determines the span time should be properly optimized and the problem size exponentially increases with the number of skids. In this regard, we propose a novel method called UniDev by defining a measure of the mean-absolute-deviation about the time difference among simultaneously processed tasks and iteratively improving it. Through simulations with various numbers of skids and processes, it was observed that our proposed method can efficiently reduce the overall work time compared with the multi-start and the 2-OPT methods.