• Title/Summary/Keyword: Scheduling Plan

Search Result 173, Processing Time 0.03 seconds

Optimal Routing and Uncertainty Processing using Geographical Information for e-Logistics Chain Execution

  • Kim, Jin Suk;Ryu, Keun Ho
    • Management Science and Financial Engineering
    • /
    • v.10 no.2
    • /
    • pp.1-28
    • /
    • 2004
  • The integrated supply chain of business partners for e-Commerce in cyber space is defined as Logistics Chain if the cooperative activities are logistics-related. Logistics Chain could be managed effectively and efficiently by cooperative technologies of logistics chain execution. In this paper, we propose a routing and scheduling algorithm based on the Tabu search by adding geographical information into existing constraint for pick-up and delivery process to minimize service time and cost in logistics chain. And, we also consider an uncertainty processing for the tracing of moving object to control pick-up and delivery vehicles based on GPS/GIS/ITS. Uncertainty processing is required to minimize amount of telecommunication and database on vehicles tracing. Finally, we describe the Logistics Chain Execution (LCE) system to perform plan and control activities for postal logistics chain. To evaluate practical effects of the routing and scheduling system, we perform a pretest for the performance of the tabu search algorithm. And then we compare our result with the result of the pick-up and delivery routing plan generated manually by postmen.

Automation of block assignment planning using a diagram-based scenario modeling method

  • Hwang, In Hyuck;Kim, Youngmin;Lee, Dong Kun;Shin, Jong Gye
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.6 no.1
    • /
    • pp.162-174
    • /
    • 2014
  • Most shipbuilding scheduling research so far has focused on the load level on the dock plan. This is because the dock is the least extendable resource in shipyards, and its overloading is difficult to resolve. However, once dock scheduling is completed, making a plan that makes the best use of the rest of the resources in the shipyard to minimize any additional cost is also important. Block assignment planning is one of the midterm planning tasks; it assigns a block to the facility (factory/shop or surface plate) that will actually manufacture the block according to the block characteristics and current situation of the facility. It is one of the most heavily loaded midterm planning tasks and is carried out manually by experienced workers. In this study, a method of representing the block assignment rules using a diagram was suggested through analysis of the existing manual process. A block allocation program was developed which automated the block assignment process according to the rules represented by the diagram. The planning scenario was validated through a case study that compared the manual assignment and two automated block assignment results.

Risk-based Operational Planning and Scheduling Model for an Emergency Medical Center (응급의료센터를 위한 위험기반 운영계획 모델)

  • Lee, Mi Lim;Lee, Jinpyo;Park, Minjae
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.42 no.2
    • /
    • pp.9-17
    • /
    • 2019
  • In order to deal with high uncertainty and variability in emergency medical centers, many researchers have developed various models for their operational planning and scheduling. However, most of the models just provide static plans without any risk measures as their results, and thus the users often lose the opportunity to analyze how much risk the patients have, whether the plan is still implementable or how the plan should be changed when an unexpected event happens. In this study, we construct a simulation model combined with a risk-based planning and scheduling module designed by Simio LLC. In addition to static schedules, it provides possibility of treatment delay for each patient as a risk measure, and updates the schedule to avoid the risk when it is needed. By using the simulation model, the users can experiment various scenarios in operations quickly, and also can make a decision not based on their past experience or intuition but based on scientific estimation of risks even in urgent situations. An example of such an operational decision making process is demonstrated for a real mid-size emergency medical center located in Seoul, Republic of Korea. The model is designed for temporal short-term planning especially, but it can be expanded for long-term planning also with some appropriate adjustments.

Optimization of T/C Lifting Plan using Dependency Structure Matrix (DSM) (DSM을 활용한 타워크레인 양중계획 최적화에 관한 연구)

  • Kim, Seungho;Kim, Sangyong;Jean, Jihoon;An, Sung-Hoon
    • Journal of the Korea Institute of Building Construction
    • /
    • v.16 no.2
    • /
    • pp.151-159
    • /
    • 2016
  • Tower crane (T/C) is one of the major equipment that is highly demanded in construction projects. Especially, most high-rise building projects require T/C to perform lifting and hoisting activities of materials. Therefore, lifting plan of T/C needs to reduce construction duration and cost. However, most lifting plan of the T/C in construction sites has still performed depending on experience and intuition of the site manager without systematic process of rational work. Dependency structure matrix (DSM) is useful tool in planning the activity sequences and managing information exchanges unlike other existing tools. To improve lifting plan of T/C efficiently, this study presents a framework for the scheduling T/C using DSM through the case study in real world construction site. The results of case study showed that the scheduling T/C using DSM is useful to optimize the T/C lifting plan in terms of easiness, specially in the typical floor cycle lifting planning.

Mathematical Models for Leasing Purchasing Empty Containers (공 컨테이너의 임대 계획을 위한 수리계획모형 및 해법)

  • Park, Sun Wook;Jeon, Su Min;Kim, Kap Hwan
    • Journal of Intelligence and Information Systems
    • /
    • v.12 no.4
    • /
    • pp.39-51
    • /
    • 2006
  • This study addresses how to plan purchasing and leasing of containers to satisfy the demand on containers. The problem can be further decomposed into the long-term planning and the short-term scheduling. The long-term plan specifies the composition of owned containers, long-term leasing containers, and short-term containers. The short-term plan considers the seasonality of demand and determines the time of leasing and the amount of the short-term and the long-term leasing containers. The length of the planning horizon is 10-20 years for the long-term planning, while it is one year for the short-term planning. The time unit is one year for the long-term planning, while it is one month for the short-term planning. This study discusses how to estimate the demand of containers and proposes deterministic models for scheduling purchasing and leasing of containers.

  • PDF

The application of tact time at finish work for building construction - Focused on Office Building - (건축마감공사에서의 택트타임 설정을 통한 작업조정 프로세스 개발 - 오피스 건축물을 중심으로-)

  • Yoon, You-Sang;Suh, Sang-Wook
    • Korean Journal of Construction Engineering and Management
    • /
    • v.6 no.6 s.28
    • /
    • pp.90-97
    • /
    • 2005
  • Poor usage of work-continuity for planning and management is one of the leading causes of decreased productivity in high-rise and complexity construction projects. For efficient finish work, tact scheduling method needs to be implemented according to tact time. But there are the studies about zoning of work area, daily construction information and tact planning and management, there are not the studies about tact time yet. The purpose of this study is to help implementation of tact scheduling by tact time and adjusted work-plan. The main contents of this study are as follow; (1)Tact time has been calculated as coordination of work-plan between a general contractor and specialties. (2)Project-plan can be without delay by tact time calculation method.

The techniques of object-based scheduling for performing art reservation (객체기반 공연예술 예약 스케줄링 기법)

  • Kim, Jin-Bong
    • Journal of the Korea Computer Industry Society
    • /
    • v.9 no.4
    • /
    • pp.171-176
    • /
    • 2008
  • Most booking techniques make a reservation without customer's preference on internet. These techniques have booking problems not to improve customer's preference in the service industry. We have tried to apply object-based scheduling technique to performing art reservation. For customer's satisfaction, we have considered customer's preferences in the reservation scheduling. The scheduling technique for performing art reservation proposed in this thesis is based on object-oriented concepts. To consider the over all satisfaction, the events of every object are alloted to the sitting plan board along its priority. To minimize backtracking or not to fail the allotment of events, we have scheduled to rise customer's preference in the scheduling.

  • PDF

A Study of the Identify about Scheduling Process at Owner's Position (IDEF 방법론을 이용한 발주자 공정관리 프로세스 규명에 관한 연구)

  • Lee Tai Sik;Kim Young Hyun
    • Proceedings of the Korean Institute Of Construction Engineering and Management
    • /
    • autumn
    • /
    • pp.454-457
    • /
    • 2001
  • All of the partner must manage continually scheduling for the successful project in construction. Besides, that is not a important only contracter's managing but also owner's managing which is a very important about project finishing in time. Especially, in the case of mega project, the owner has to manage progress of scheduling to control contractor. And the case of progress to delay or to change, owner, contractor, and inspector must make a plan of recovery scheduling. This study proposes a construction process model from IDEF Methodology.

  • PDF

A Study of Flight Scheduling Problem on Fighter Squadron (전투비행대대 비행스케줄링에 관한 연구)

  • Lee, Moongul;Seo, Sanghoon
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.39 no.2
    • /
    • pp.37-48
    • /
    • 2014
  • Fighter squadron flight scheduling is the integrated air operation plan that is an important role for improving pilot's flight skill and maintaining combat readiness by efficient using available all air resources including pilot, aircrafts, air-weapons, fuel and supporting facilities etc. Korea airforce, however, has a limit as to an effective flight operation due to manual flight scheduling with scheduler's own experience and intuition. Therefore, in our study, we propose the optimization model of flight scheduling based on mixed integer programming. This model includes several constraints of realistic and essential quantified data related with flight schedule and can assign appropriate pilots optimally which are distinctive three type's solutions : flight, alert and duty crew schedules. Proposed solution method can be improved pilot's capability and allocated further air resources systematically and efficiently. In addition, it can be reduced a workload of flight scheduler and minimized obstructed factors of flight safety. Finally, we demonstrate the experiment's results for the check of efficiency and validity of this model.

PartitionTuner: An operator scheduler for deep-learning compilers supporting multiple heterogeneous processing units

  • Misun Yu;Yongin Kwon;Jemin Lee;Jeman Park;Junmo Park;Taeho Kim
    • ETRI Journal
    • /
    • v.45 no.2
    • /
    • pp.318-328
    • /
    • 2023
  • Recently, embedded systems, such as mobile platforms, have multiple processing units that can operate in parallel, such as centralized processing units (CPUs) and neural processing units (NPUs). We can use deep-learning compilers to generate machine code optimized for these embedded systems from a deep neural network (DNN). However, the deep-learning compilers proposed so far generate codes that sequentially execute DNN operators on a single processing unit or parallel codes for graphic processing units (GPUs). In this study, we propose PartitionTuner, an operator scheduler for deep-learning compilers that supports multiple heterogeneous PUs including CPUs and NPUs. PartitionTuner can generate an operator-scheduling plan that uses all available PUs simultaneously to minimize overall DNN inference time. Operator scheduling is based on the analysis of DNN architecture and the performance profiles of individual and group operators measured on heterogeneous processing units. By the experiments for seven DNNs, PartitionTuner generates scheduling plans that perform 5.03% better than a static type-based operator-scheduling technique for SqueezeNet. In addition, PartitionTuner outperforms recent profiling-based operator-scheduling techniques for ResNet50, ResNet18, and SqueezeNet by 7.18%, 5.36%, and 2.73%, respectively.