• Title/Summary/Keyword: Block lifting scheduling

Search Result 2, Processing Time 0.02 seconds

Optimal Block Lifting Scheduling Considering the Minimization of Travel Distance at an Idle State and Wire Replacement of a Goliath Crane (골리앗 크레인의 공주행 거리와 와이어 교체 최소를 고려한 최적 블록 리프팅 계획)

  • Roh, Myung-Il;Lee, Kyu-Yeul
    • Korean Journal of Computational Design and Engineering
    • /
    • v.15 no.1
    • /
    • pp.1-10
    • /
    • 2010
  • Recently, a shipyard is making every effort to efficiently manage equipments of resources such as a gantry crane, transporter, and so on. So far block lifting scheduling of a gantry crane has been manually performed by a manager of the shipyard, and thus it took much time to get scheduling results and moreover the quality of them was not optimal. To improve this, a block lifting scheduling system of the gantry crane using optimization techniques was developed in this study. First, a block lifting scheduling problem was mathematically formulated as a multi-objective optimization problem, considering the minimization of travel distance at an idle state and wire replacement during block lifting. Then, to solve the problem, a meta-heuristic optimization algorithm based on the genetic algorithm was proposed. To evaluate the efficiency and applicability of the developed system, it was applied to an actual block lifting scheduling problem of the shipyard. The result shows that blocks can be efficiently lifted by the gantry crane using the developed system, compared to manual scheduling by a manager.

Efficient VLSI Architecture for Lifting-Based 2D Discrete Wavelet Transform Filter (리프팅 기반 2차원 이산 웨이블렛 변환 필터의 효율적인 VLSI 구조)

  • Park, Taegu;Park, Taegeun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.11
    • /
    • pp.993-1000
    • /
    • 2012
  • In this research, we proposed an efficient VLSI architecture of the lifting-based 2D DWT (Discrete Wavelet Transform) filter with 100% hardware utilization. The (9,7) filter structure has been applied and extendable to the filter length. We proposed a new block-based scheduling that computes the DWT for the lower levels on an "as-early-as-possible" basis, which means that the calculation for the lower level will start as soon as the data is ready. Since the proposed 2D DWT computes the outputs of all levels by one row-based scan, the intermediate results for other resolution levels should be kept in storage such as the Data Format Converter (DFC) and the Delay Control Unit (DCU) until they are used. When the size of input image is $N{\times}N$ and m is the filter length, the required storage for the proposed architecture is about 2mN. Since the proposed architecture processes the 2D DWT in horizontal and vertical directions at the same time with 4 input data, the total period for 2D DWT is $N^2(1-2^{-2J})/3$.