• 제목/요약/키워드: 작업 계획

검색결과 1,434건 처리시간 0.025초

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
    • /
    • 제14권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

Adaptation of The Parameters of Operations for Process Planning (공정계획을 위한 공정파라미터의 적응)

  • Lee, Honghee
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • 제19권37호
    • /
    • pp.145-152
    • /
    • 1996
  • 일반적으로 자동공정계획(CAPP) 시스템에서 사용되는 공정변수의 값들은 한번 적당한 값으로 선택되면 보통 변치 않고 늘 사용된다. 그러나 그것들은 작업상의 여러 조건들에 따라 변하기 마련이다. 이것을 반영하지 않은 공정계획은 정확할 수 가 없다. 본 논문에서는 작업조건 및 환경에 따라 변화하는 공정변수의 값들을 실제의 정확한 값으로 유지하기 위한 방법을 개발하였다. 공정의 성공 여부가 기존의 해당 공정변수의 값들에 반영되어 새로운 값을 구하는 알고리즘이 개발되었다. 한 공정이 선행공정과 얽혀 있는 경우(coupled processes)도 고려되었다. 개발된 알고리즘은 해석적인 방법으로 증명되었다.

  • PDF

An Application of Simulation Method to Planning of Road Pavement Operation (시뮬레이션을 이용한 도로포장 공정계획의 수립방안)

  • Ohn, Seong-Won;Kim, Ok-Ki;Woo, Sung-Kwon
    • Korean Journal of Construction Engineering and Management
    • /
    • 제8권1호
    • /
    • pp.124-131
    • /
    • 2007
  • Project management means usually managing the rate of construction progress. But it also contains preparing scheme of execution and establishing plan for equipment, material, labor force to finish project within expected duration. In this paper to establish effective project planning a road pavement operation is selected as a case and simulation method is used for analyzing it. Next probability distributions are created after analyzing collected data and these are reflected in simulation model. Simulated result is compared with real project planning using models of lean concrete pavement process and concrete slab pavement process to verify efficiency of this model. In the event we know that project planning using simulation is more effective than one of the field in the aspects of duration and cost. Meanwhile simulated result in this paper has a limitation in accuracy because various constraints of filed are not reflected in it. However if we reflect this constraints in model through examining field in future this limitation is expected to be improved.

Analysis of Boundary Conditions for Activities' Relationships in Linear Scheduling Model (선형 공정계획 모델의 액티비티 관계의 경계조건 분석)

  • Ryu, Han-Guk;Kim, Tae-Hui
    • Korean Journal of Construction Engineering and Management
    • /
    • 제12권1호
    • /
    • pp.23-32
    • /
    • 2011
  • Domestic leading construction companies has been establishing and performing TACT scheduling method, similar to linear scheduling model such as line of balance and repetitive schedule, and etc. in which repetitive construction works are involved like high-rise building. Linear scheduling model has been researched as a visual scheduling method presenting the work space and time information. Likewise scheduling constraints of CPM network such as finish-to-finish, start-to-start, finish-to-start, start-to-start, linear scheduling model also has the relationships constraints, namely boundary conditions, between activities. It is especially necessary to define the boundary conditions of the activities' relationships in order to apply the linear scheduling model to be compatible with the network schedule. Therefore, this research considers the boundary conditions between activities for establishing the linear scheduling model. This paper also applies the proposed boundary conditions to TACT schedule and then deduces the main considerations in order to establish and perform TACT schedule.

Platform development of adaptive production planning to improve efficiency in manufacturing system (생산 시스템 효율성 향상을 위한 적응형 일정계획 플랫폼 개발)

  • Lee, Seung-Jung;Choi, Hoe-Ryeon;Lee, Hong-Chul
    • Journal of Korea Society of Industrial Information Systems
    • /
    • 제16권2호
    • /
    • pp.73-83
    • /
    • 2011
  • In the manufacturing system, production-planning is very important in effective management for expensive production facilities and machineries. To enhance efficiency of Manufacturing Execution System(MES), a manufacturing system that reduces the difference between planning and execution, certain production-planning needs a dispatching rule that is properly designed for characteristic of work information and there should be a appropriate selection for the rule as well. Therefore, in this paper dispatching rule will be selected by several simulations based on characteristics of work information derived from process planning data. By constructing information that are from simulation into ontology, one of the knowledge-based-reasoning, production planning platform based on the selection of dispatching rule will be demonstrated. The platform has strength in its wider usage that is not limited to where it is applied. To demonstrate the platform, RacerPro and Prot$\acute{e}$g$\acute{e}$ are used in parts of ontology reasoning, and JAVA and FlexChart were applied for production-planning simulation.

Dual Cycle Plan for Efficient Ship Loading and Unloading in Container Terminals (컨테이너 터미널의 효율적인 선적 작업을 위한 Dual Cycle 계획)

  • Chung, Chang-Yun;Shin, Jae-Young
    • Journal of Navigation and Port Research
    • /
    • 제33권8호
    • /
    • pp.555-562
    • /
    • 2009
  • At container terminals, a major measurement of productivity can be work-efficiency in quay-side. At the apron, containers are loaded onto the ship and unloaded to apron by Q/C(Quay Crane). For improving the productivity of quay crane, the more efficient Y/T(Yard Tractor) operation method is necessary in container terminals. Between quay-side and yard area, current transferring methods is single-cycling which doesn't start loading unless it finishes unloading. Dual-cycling is a technique that can be used to improve the productivity of quay-side and utility of yard tractor by ship loading and unloading simultaneously. Using the dual-cycling at terminals only necessitates an operational change without purchasing extra equipment. Exactly, Y/T operation method has to be changed the dedicate system to pooling system. This paper presents an efficient ship loading and unloading plan in container terminals, which use the dual-cycling. We propose genetic and tabu search algorithm for this problem.

Method of Transforming PDM Overlapping Relationships to BDM Overlapping Relationships in CPM Schedule (CPM 공정계획의 PDM 중복관계를 BDM 중복관계로 전환시키는 방법)

  • Kim, Seon-Gyoo;Yoo, Jae-Woo;Ko, Dae-Gyu
    • Korean Journal of Construction Engineering and Management
    • /
    • 제13권5호
    • /
    • pp.144-152
    • /
    • 2012
  • The reason why most scheduling softwares currently using at construction projects adopt PDM (Precedence Diagramming Method) is that it can express an overlapping relationship between activities. However, the overlapping relationships in PDM are represented only by combinations of four overlapping types that connect the start and finish points of two activities, therefore, PDM cannot express efficiently the relationships between any middle points of two activities if they should be represented. This research proposes the method of transforming the four overlapping types of PDM to the overlapping relationships of BDM(Beeline Diagramming Method), new networking technique, that can connect the inter-relationships at any middle points of two activities as well as express multiple overlapping relationships. The proposed method will help not only to improve an efficiency of scheduling but also to upgrade the scheduling technique because BDM technique has a lot of unique advantages in scheduling.

Construction Progress Management System for PPC Implementation (작업성취율 활용을 위한 공정관리체계)

  • Lim, Chul-Woo;Yu, Jung-Ho;Kim, Chang-Duk
    • Korean Journal of Construction Engineering and Management
    • /
    • 제8권3호
    • /
    • pp.57-65
    • /
    • 2007
  • Last Planner System (LPS) developed by Lean Construction Institute consists of four steps: Master Schedule, Phase Schedule, Lookahead Planning and Weekly Work Plan. This paper focuses on the process of measuring Percent of Plan Completed (PPC) at the weekly Work Plan stage. PPC means the percentage of weekly assignments completed. According to the results of the researches that deal with PPC from many other countries, we can assure the benefits or using PPC. However the concept of PPC is unfamiliar in Korea construction industry. This paper analyzes the cases in which PPC is applied in other countries and compares them with the production control system in Korean construction industry. The results of this research will provide the time management system for using PPC in Korea.

A Development of Ironbar-manufacturing Industry Software using Dynamic Programming (동적계획법을 이용한 철근가공 산업용 소프트웨어 개발)

  • Kim, Seong-Hoon;Park, Choong-Sik
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 한국컴퓨터정보학회 2008년도 제38차 하계학술발표논문집 16권1호
    • /
    • pp.211-216
    • /
    • 2008
  • 이 논문은 철근 가공 산업 현장에서 스프레드쉬트에 의해 수작업으로 행하던 절단 작업의 계획 수립을 자동화된 시스템에 의해 최적의 절단 계획을 생성하도록 하는 소프트웨어의 개발을 다룬다. 이를 위하여, 먼저 시스템의 데이터 표현과 최적 문제 풀이를 위한 자동 계획 알고리듬의 설계가 요구된다. 이것은 다중 규격의 1차원 자재 절단 문제를 푸는 것으로, 동적계획법에 근거하여 자재 절단 문제를 재구성하고, 유한 범위의 조합 열에서도 근사 최적의 해를 찾을 수 있는 탐색 기법을 사용한 자재 절단 계획 알고리듬을 사용하였다. 그리고, 자동화된 철근 가공 산업용 소프트웨어는 작업 환경에 맞게 사용이 편리한 그래픽 화면과 사용자 인터페이스가 요구되는데, 공개 소프트웨어를 활용한 GUI 라이브러리 툴킷인 GTK+를 활용하여 이를 구현하였다.

  • PDF

A Petri Net based Disassembly Sequence Planning Model with Precedence Operations (분해우선작업을 가지는 페트리 넷 기반의 분해순서계획모델)

  • Seo, Kwang-Kyu
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • 제9권5호
    • /
    • pp.1392-1398
    • /
    • 2008
  • This paper presents a Petri Net (PN) based disassembly sequence planning model with precedence operations. All feasible disassembly sequences are generated by a disassembly tree and a disassembly sequence is determined using the disassembly precedence and disassembly value matrix, The precedence of disassembly operations is determined through a disassembly tree and the value of disassembly is induced by economic analysis in the end-of-life phase. To solve the disassembly sequence planning model with precedence operations, a heuristic algorithm based on PNs is developed. The developed algorithm generates and searches a partial reachability graph to arrive at an optimal or near-optimal disassembly sequence based on the firing sequence of transitions of the PN model. A refrigerator is shown as an example to demonstrate the effectiveness of proposed model.