• Title/Summary/Keyword: 작업 순서

Search Result 456, Processing Time 0.087 seconds

Integrated Decision-making for Sequencing and Storage Location of Export Containers at a Receiving Operation in the Container Terminal with a Perpendicular Layout (수직 배치형 컨테이너 터미널 반입작업에서 수출 컨테이너의 작업순서와 장치위치 통합 의사결정)

  • Bae, Jong-Wook;Park, Young-Man
    • Journal of Navigation and Port Research
    • /
    • v.35 no.8
    • /
    • pp.657-665
    • /
    • 2011
  • This study deals with an integrated problem for deciding sequencing and storage location of export containers together at its receiving operation in the container terminal with a perpendicular layout. The preferred storage location of an export container varies with the priority of the corresponding loading operation and the waiting time of an external truck depends on its storage time. This paper proposes the mixed integer programming model considering the expected arrival time and expected finish time of an external truck and the preferred storage location for its loading operation. And we suggest the heuristic algorithm based on a simulated annealing algorithm for real world adaption. We compare the heuristic algorithm with the optimum model in terms of the computation times and total cost and the performance of the heuristic algorithm is analyzed through a numerical experiment.

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.

Inter-bay Re-marshalling Planning in the Automated Container Terminal (자동화 컨테이너 터미널의 베이간 컨테이너 재배치작업 계획)

  • Bae, Jong-Wook;Park, Young-Man
    • Journal of Navigation and Port Research
    • /
    • v.44 no.3
    • /
    • pp.219-226
    • /
    • 2020
  • The container terminal operators established a re-marshalling plan to reduce the loading operation time and the release operation time. Re-marshalling is to rearrange the containers in the container yard to the advantageous position to shorten the working time using the spare time of the automated yard crane. This study assumed the automated container terminal with a perpendicular layout and deals with the inter-bay re-marshalling planning problem in a yard block. The inter-bay re-marshalling plan determines the container to be moved, the location to be relocated, and the sequence of relocation operations. This study presents a mixed integer programming model that simultaneously determines the storage location and the operation sequence while satisfying the spatial availability during the re-marshalling. Numerical experiments are conducted to understand re-marshalling operation using a beam search method.

Quay Crane Scheduling Considering the Workload of Yard Blocks in an Automated Container Terminal (장치장 블록의 작업부하를 고려한 안벽크레인 작업계획)

  • Lee, Seung-Hwan;Choe, Ri;Park, Tae-Jin;Kim, Kap-Hwan;Ryu, Kwang-Ryel
    • Journal of Intelligence and Information Systems
    • /
    • v.14 no.4
    • /
    • pp.103-116
    • /
    • 2008
  • This paper proposes quay crane (QC) scheduling algorithms that determine the working sequence of QCs over ship bays in a container vessel in automated container terminals. We propose two scheduling algorithms that examine the distribution of export containers in the stacking yard and determine the sequence of ship bays to balance the workload distribution among the yard blocks. One of the algorithms is a simple heuristic algorithm which dynamically selects the next ship bay based on the entropy of workloads among yard blocks whenever a QC finishes loading containers at a ship bay and the other uses genetic algorithm to search the optimal sequence of ship bays. To evaluate the fitness of each chromosome in the genetic algorithm, we have devised a method that is able to calculate an approximation of loading time of container vessels considering the workloads among yard blocks. Simulation experiments have been carried out to compare the efficiency of the proposed algorithms. The results show that our QC scheduling algorithms are efficient in reducing the turn-around time of container vessels.

  • PDF

Multi-Agent Coordination by Hierarchical Workflow (계층적 작업흐름에 의한 멀티 에이전트 조정)

  • 박정훈;안세용;최중민
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1998.10c
    • /
    • pp.120-122
    • /
    • 1998
  • 최근의 에이전트 시스템 연구는 간단한 작업을 처리하는 단일 에이전트들이 모여 하나의 서비스를 제공하는 멀티 에이전트 시스템 분야에서 활발히 이루어지고 있다. 이러한 멀티 에이전트 시스템에서는 요구된 서비스를 구성원들이 효율적으로 협동하여 제공하기 위해 이들을 통합하고 실행순서 등을 조정하는 것이 중요하다. 본 논문에서는 계획, 그룹, 작업의 세가지 단계로 구분되는 규칙과 ECA 규칙을 사용하여 계층적 작업흐름을 정의하고 이를 통하여 에이전트들을 조정하는 방법을 제안한다. 계층적 작업흐름의 사용으로 기존의 방법과 달리 에이전트를 계층화하여 새로운 서비스를 구성할 경우 세부적인 수행사항에 대한 언급없이 상위 단계의 계획 규칙만을 지정하여 구성할 수 있는 장점이 있다.

  • PDF

A Daily Production Sequence Planning System for the Automobile Assembly Plant (자동차 조립공장의 일일 생산순서계획 시스템)

  • Choi, Won-Joon
    • IE interfaces
    • /
    • v.9 no.2
    • /
    • pp.61-74
    • /
    • 1996
  • 자동차 조립공장의 주요 공정은 차체라인, 도장라인, 조립라인의 순으로 구성되어 있다. 작업의 효율성을 높이기 위하여 차체라인과 조립라인은 주요 부품소모의 평준화를, 도장라인은 동일 색상차체의 연속 생산을 선호하므로, 생산순서의 결정시 상호 상층되는 점이 많다. 본 연구에서는 조립공장전체의 생산성을 극대화하기 위하여 차체라인, 도장라인, 조립라인의 특성을 고려한 일일생산순서결정 방법을 제시한다.

  • PDF

Determining a optimal defragmentation order of fragmented files using GA. (GA를 이용한 최적의 디스크 조각모음 순서 결정)

  • 김미숙;강태원
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.10b
    • /
    • pp.36-38
    • /
    • 2000
  • 디스크상의 개별 파일들은 디스크에 추가, 변경, 그리고 삭제됨에 따라 디스크의 서로 다른 영역으로 분산될 수 있다. 이러한 경우 개별 파일을 구성하고 있는 모든 조각들을 찾는 조각모음은 많은 파일 블록의 이동 때문에 근본적으로 많은 시간이 요구되는 작업이다. 그러나 기존의 방법은 공통적으로 조각모음을 수행하는데 각 조각파일의 모음 순서를 고려하지 않는다. 즉, 조각난 차례대로 조각모음을 수행한다. 이 논문에서는 유전자알고리즘(Genetic Algorithm)을 이용하여 가장 효율적인 조각모음 순서를 결정하는 방법을 제안하고 평가한다.

  • PDF

Design of the Agent Migration Information System for Shortest Migration Order (최단 수행 순서 제공을 위한 에이전트 이주 정보 시스템 설계)

  • Park, Hong-Jin
    • The KIPS Transactions:PartA
    • /
    • v.9A no.4
    • /
    • pp.555-562
    • /
    • 2002
  • The total processing time nay vary according to the order of visit when a mobile agent is sequentially migrated to another node. An effective migration algorithm is one in which the processing time is kept to its minimum from the initial state to the destination state by ordering the process. The total time spend for the process can be minimized by adopting an effective migration algorithm. Existing mobile agents such as Aglets. Voyager, and Odyssey do not guarantee the effectiveness by not taking the status of the network and the node to be moved into upon the migration. This paper proposes AMIS as the method used for the migration of the mobile agent. AMIS minimizes the total migration time of the mobile agent, and provides a firm and safe order for the migration of the mobile agent.