• 제목/요약/키워드: Space Scheduling

검색결과 213건 처리시간 0.015초

조선 선행탑재 및 탑재 일정계획에서의 부하평준화를 위한 발견적 기법 (Heuristic Algorithms for Resource Leveling in Pre-Erection Scheduling and Erection Scheduling of Shipbuilding)

  • 우상복;류형곤;한형상
    • 산업공학
    • /
    • 제16권3호
    • /
    • pp.332-343
    • /
    • 2003
  • This paper deals with pre-erection scheduling and erection scheduling in shipbuilding. Among shipbuilding scheduling, the ship erection scheduling in a dock is one of the most important since the dock is the most critical resource in a shipyard. However, it is more reasonable to consider pre-erection scheduling and erection scheduling as unified because they compete with the common constrained resources such as labor, crane, space, and so on. It is very hard to consider two scheduling problems simultaneously, and hence, we approach them sequentially. At first, we propose space resource leveling heuristics in pre-erection scheduling given erection date. And then, considering the manpower resource determined by pre-erection scheduling, we also propose manpower resource leveling heuristics in erection scheduling. Various experimental results with real world data show that the proposed heuristics have good performance in terms of scheduling quality and time.

공간제약을 갖는 선박용 엔진 조립공장의 효율적인 일정계획을 위한 발견적 기법 (A Heuristic for Efficient Scheduling of Ship Engine Assembly Shop with Space Limit)

  • 이동현;이경근;김재균;박창권;장길상
    • 산업공학
    • /
    • 제12권4호
    • /
    • pp.617-624
    • /
    • 1999
  • In order to maximize an availability of machine and utilization of space, the parallel machines scheduling problem with space limit is frequently discussed in the industrial field. In this paper, we consider a scheduling problem for assembly machine in ship engine assembly shop. This paper considers the parallel machine scheduling problem in which n jobs having different release times, due dates and space limits are to be scheduled on m parallel machines. The objective function is to minimize the sum of earliness and tardiness. To solve this problem, a heuristic is developed. The proposed heuristic is divided into three modules hierarchically: job selection, machine selection and job sequencing, solution improvement. To illustrate its effectiveness, a proposed heuristic is evaluated with a large number of randomly generated test problems based on the field situation. Through the computational experiment, we determine the job selection rule that is suitable to the problem situation considered in this paper and show the effectiveness of our heuristic.

  • PDF

Genetic algorithm-based scheduling for ground support of multiple satellites and antennae considering operation modes

  • Lee, Junghyun;Kim, Haedong;Chung, Hyun;Ko, Kwanghee
    • International Journal of Aeronautical and Space Sciences
    • /
    • 제17권1호
    • /
    • pp.89-100
    • /
    • 2016
  • Given the unpredictability of the space environment, satellite communications are manually performed by exchanging telecommands and telemetry. Ground support for orbiting satellites is given only during limited periods of ground antenna visibility, which can result in conflicts when multiple satellites are present. This problem can be regarded as a scheduling problem of allocating antenna support (task) to limited visibility (resource). To mitigate unforeseen errors and costs associated with manual scheduling and mission planning, we propose a novel method based on a genetic algorithm to solve the ground support problem of multiple satellites and antennae with visibility conflicts. Numerous scheduling parameters, including user priority, emergency, profit, contact interval, support time, remaining resource, are considered to provide maximum benefit to users and real applications. The modeling and formulae are developed in accordance with the characteristics of satellite communication. To validate the proposed algorithm, 20 satellites and 3 ground antennae in the Korean peninsula are assumed and modeled using the satellite tool kit (STK). The proposed algorithm is applied to two operation modes: (i) telemetry, tracking, and command and (ii) payload. The results of the present study show near-optimal scheduling in both operation modes and demonstrate the applicability of the proposed algorithm to actual mission control systems.

조선 산업에서의 정반배치 계획시스템 개발의 효율화에 관한 연구

  • 박주호;박주철
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2001년도 추계학술대회 논문집
    • /
    • pp.283-285
    • /
    • 2001
  • The most work-space invest much time and labor for optimal arrangement. The work-plates of the work-space should be arranged, processed and assembled under the restricted work space. The optimal arrangement under the terms of a restriction arrange the maximum work-plates in appointed work-space. It's the central aim. The work-plates arrangement scheduling of the most work-space are achieved through the experience of the planner. Like this, if the work-plates arrangement is worked by hand, there spend much time for the training planner. And the burden of the personnel expenses occur for using the master worker, also there are dangerous factors to be able to bring the bottleneck circumstance for the process planning, because the quick work planning does not accomplish. With such problems, the biggest problem is inferior the value of the plan. For solved the such problem of hand-operating, some work-spaces developed and used the work-plate arrangement scheduling system for the special quality of themselves. This paper make research into a plan to develop the work-plate arrangement scheduling system efficiently.

  • PDF

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

  • 류한국;김태희
    • 한국건설관리학회논문집
    • /
    • 제12권1호
    • /
    • pp.23-32
    • /
    • 2011
  • 국내 일부 건설사는 초고층 건축공사와 같이 반복 공종이 많은 건축물에 일종의 선형 공정계획인 택트 공정계획을 수립하고 수행하고 있다. 선형 공정계획 모델(Linear Scheduling Model: LSM)은 작업 공간과 시간의 정보를 제공하는 시각적 도구로써 연구가 되어왔다. CPM 네트워크 공정표의 구속조건(종료 후 종료, 시작 후 종료, 종료 후 시작, 시작 후 시작)과 마찬가지로 선형계획모델 또한 작업간의 관계간의 구속조건이 발생한다. 특히, 네트워크 공정표를 호환하기 위하여 작업간의 중요 속성간의 관계성의 경계 조건을 정의하는 것이 필요하다. 따라서 본 연구는 선형 공정계획을 수립 시 발생하는 액티비티간의 공간상의 경계조건을 분석한다. 또한 선형 공정계획의 액티비티 간의 관계성을 고려하여 현재 일부 건설회사를 중심으로 사용하고 있는 택트 공정계획에 제안한 경계조건을 반영하여 택트 공정계획 수립과 관리를 위해 고려해야 하는 주요 사항을 제시하는 것이 본 연구의 목적이다.

DESIGN AND IMPLEMENTATION OF THE MISSION PLANNING FUNCTIONS FOR THE KOMPSAT-2 MISSION CONTROL ELEMENT

  • Lee, Byoung-Sun;Kim, Jae-Hoon
    • Journal of Astronomy and Space Sciences
    • /
    • 제20권3호
    • /
    • pp.227-238
    • /
    • 2003
  • Spacecraft mission planning functions including event prediction, mission scheduling, command planning, and ground track display have been developed for the KOMPSAT-2 mission operations. Integrated event prediction functions including satellite orbital events, user requested imaging events, and satellite operational events have been implemented. Mission scheduling functions have been realized to detect the mission conflicts considering the user specified constraints and resources, A conflict free mission scheduling result is mapped into the spacecraft command sequences in the command planning functions. The command sequences are directly linked to the spacecraft operations using eXtensible Markup Language(XML) for command transmission. Ground track display shows the satellite ground trace and mission activities on a digitized world map with zoom capability.

USING GIS TO IMPROVE ROADWAY CONSTRUCTION PLANNING

  • Sanghyeok Kang;Jongwon Seo
    • 국제학술발표논문집
    • /
    • The 1th International Conference on Construction Engineering and Project Management
    • /
    • pp.643-648
    • /
    • 2005
  • The planning process for roadway construction involves a large amount of information on design, construction methods, quantities, unit costs, production rates, and site conditions. Therefore, it is very important to acquire, manage, and process the necessary information efficiently to produce a rigorous construction plan. GIS (Geographic Information System) is a very effective tool for integrating and managing various types of information including spatial and non-spatial data required for roadway construction planning. This paper proposes a GIS-based system for improving roadway construction planning with its 'Interactive Space Scheduling' and 'Operation Level Planning' functions. The proposed system can assist construction planners in a unique way by integrating design and construction information and creating modularized design elements for space scheduling in real time. It is expected that the proposed system could improve the efficiency of roadway construction planning.

  • PDF

효율적인 위성 임무 스케줄링 운영을 위한 스케줄링 최적화 알고리즘 비교 연구 (A Comparison of Scheduling Optimization Algorithm for the Efficient Satellite Mission Scheduling Operation)

  • 백승우;조겸래;이대우;김해동
    • 한국항공우주학회지
    • /
    • 제38권1호
    • /
    • pp.48-57
    • /
    • 2010
  • 본 논문에서는 위성 임무 스케줄링을 효율적으로 수행하기 위한 스케줄링 최적화 알고리즘을 타부탐색 알고리즘과 유전 알고리즘을 이용해 디자인하고, 시뮬레이션을 수행한 비교 결과를 기술하였다. 위성 임무 스케줄링은 위성에게 요구된 작업들과 그에 따른 제한사항 및 다양한 변수들을 종합적으로 고려하여 상호간의 시간, 조건 등의 충돌을 회피함과 동시에 위성의 자원을 최대한 활용하여 운용할 수 있는 최적의 작업시간표를 생성하는 것이다. 위성 임무 스케줄링은 동시에 많은 변수를 고려해야 하기 때문에 연산양이 많고, 매 스케줄링 시 마다 동일한 과정을 반복적으로 수행해야 하므로, 스케줄링 최적화 알고리즘과 같은 위성 운영 자동화, 자율화가 요구되는 분야이다. 다양하게 이용되고 있는 두 가지 스케줄링 기법을 위성 임무 스케줄링 최적화에 적용해 보았다.

A Simulation Study on a Workload-based Operation Planning Method in Container Terminals

  • Jeong, Yeon-Ho;Kim, Kap-Hwan;Woo, Youn-Ju;Seo, Bo-Hyeon
    • Industrial Engineering and Management Systems
    • /
    • 제11권1호
    • /
    • pp.103-113
    • /
    • 2012
  • A yard in a container terminal is a temporary storage space before containers are loaded onto the target vessel or delivered to consignees. For improving the utilization of the space in the yard and the efficiency of loading and discharging operations, it is important that operation plans must be carefully constructed in advance. A heuristic method is suggested to solve operation space planning problems considering workloads on handling equipment as well as space availabilities. The operation plans in this paper includes quay crane (QC) schedules and space plans for multiple vessels considering the workload in the container yard of container terminals. This paper evaluates the effectiveness of a space planning method and the performance of a new QC scheduling method using a simulation model.

공항접근영역 항공교통 Dispatching 스케줄링 연구 (Air-traffic dispatching scheduling in terminal airspace)

  • 정순조;조두현;최한림
    • 한국항공우주학회지
    • /
    • 제44권11호
    • /
    • pp.973-980
    • /
    • 2016
  • 항공교통의 수요 증가에 따른 혼잡한 교통상황과 부족한 공항 운항 능력을 해결하고자 항공교통관제(ATM : Air Traffic Management)의 다양한 분야에서 연구가 진행 되고있다. 본 논문에서는 공항 관제 영역에서 공항으로 접근하는 항공기 교통 스케줄링에 대해 연구를 진행하였다. 본 연구의 ATM 문제에서는 안전을 위한 운용 제한 조건인 항공기간의 분리 구간과 추월을 고려하여 접근하였으며, 특정 공항의 문제가 아닌 일반적인 공항의 항공경로와 경로 결합지점을 정의하여 접근하였다. 또한, 항공교통관제 문제를 스케줄링문제로 정의하여 dispatching 휴리스틱기법들을 통해 해결하고자 하였으며, 기존 기법들을 보완한 새로운 기법을 제안하였다. 스케줄링기법 효율성을 분석하고자 항공교통 시뮬레이션 환경을 모사하였으며, 항공 교통 흐름을 정적인 상황과 동적인 상황으로 정의하여 각 스케줄링 기법들에 대해 Monte Carlo Simulation을 수행하였다.