• Title/Summary/Keyword: Combine and schedule

Search Result 22, Processing Time 0.024 seconds

DSL: Dynamic and Self-Learning Schedule Method of Multiple Controllers in SDN

  • Li, Junfei;Wu, Jiangxing;Hu, Yuxiang;Li, Kan
    • ETRI Journal
    • /
    • v.39 no.3
    • /
    • pp.364-372
    • /
    • 2017
  • For the reliability of controllers in a software defined network (SDN), a dynamic and self-learning schedule method (DSL) is proposed. This method is original and easy to deploy, and optimizes the combination of multiple controllers. First, we summarize multiple controllers' combinations and schedule problems in an SDN and analyze its reliability. Then, we introduce the architecture of the schedule method and evaluate multi-controller reliability, the DSL method, and its optimized solution. By continually and statistically learning the information about controller reliability, this method treats it as a metric to schedule controllers. Finally, we compare and test the method using a given testing scenario based on an SDN network simulator. The experiment results show that the DSL method can significantly improve the total reliability of an SDN compared with a random schedule, and the proposed optimization algorithm has higher efficiency than an exhaustive search.

Combine Harvest Scheduling Program for Rough Rice using Max-coverage Algorithm

  • Lee, Hyo-Jai;Kim, Oui-Woung;Kim, Hoon;Han, Jae-Woong
    • Journal of Biosystems Engineering
    • /
    • v.38 no.1
    • /
    • pp.18-24
    • /
    • 2013
  • Purpose: This study was conducted to develop an optimal combine scheduling program using Max-Coverage algorithm which derives the maximum efficiency for a specific location in harvest seasons. Methods: The combine scheduling program was operated with information about combine specification and farmland. Four operating types (Max-Coverage algorithm type, Boustrophedon path type, max quality value type, and max area type) were selected to compare quality and working capacity. Result: The working time of Max-Coverage algorithm type was shorter than others, and the total quality value of Max-Coverage algorithm and max quality value type were higher than others. Conclusion: The developed combine scheduling program using Max-Coverage algorithm will provide optimal operation and maximum quality in a limited area and time.

Determination of Work Schedule Type by Dynamic Programming (동적계획모형을 이용한 근무형태 결정)

  • 김중순;안봉근;손달호
    • Korean Management Science Review
    • /
    • v.20 no.2
    • /
    • pp.33-43
    • /
    • 2003
  • In this paper we applied dynamic programming to determining work schedule type. In dynamic programming formulation, each day during a planning horizon represents a stage for which a decision is made. The alternatives are given by work schedule types that combine regular time, overtime, additional shift, and so on. In this case, their associated return function is labor cost. The state is defined as the amount of work time allocated to stage 1, stage 2,…, and current stage. A case study for a real manufacturing company was performed to apply dynamic programming to scheduling daily work hours during a week. The case study showed that total cost of our solution derived from dynamic programming decreased by about 6% as compared with the solution obtained from the previous method.

WIPI based E-mail and Schedule Management System (WIPI 기반의 이메일 및 일정 관리 시스템)

  • Kim Sung-Su;Song Wang-Cheol
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.7
    • /
    • pp.50-57
    • /
    • 2006
  • The implementation of cellular phone based applications has been growing very fast because of WIPI which is one of hardware independent platforms. In this paper, we design and implement a system to combine the animation avatar and e-mail service by using WIPI platform, so that the user can symbolize himself/herself by his/her avatar in using the email. Also, as the general email applications have functions to integrate the email and the scheduling, this system has the integrated email & scheduling functionality. At the same time, This system uses SMS service in order to notify scheduled time and it synchronizes the schedule data with Microsoft Outlook on the computer. So, this system extends the existing email applications by supporting the mobility.

  • PDF

A new approach for minimum aggregation time scheduling in wireless sensor networks (에이전트 시스템 개발도구에 관한 연구)

  • Nguyen, Dung T.;Yeoum, Sanggil;Choo, Hyunseung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2019.05a
    • /
    • pp.79-81
    • /
    • 2019
  • Collecting data in wireless sensor networks in minimum time is a traditional problem which is known NP-hard. Previous studies built the schedule using the node-based or link-based metrics to prioritize the transmissions. In this work, we combine the effect of both metrics to obtain a smaller aggregation time. We compare our work with state of the art schemes and report the improvement.

Parallel Machines Scheduling with Rate-Modifying Activities to Minimize Makespan (Rate-Modifying 활동이 있는 병렬기계의 Makespan 최소화를 위한 일정 계획)

  • Cho, Hang-Min;Yim, Seung-Bin;Jeong, In-Jae
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.30 no.2
    • /
    • pp.44-50
    • /
    • 2007
  • This paper deals with the problem of scheduling jobs and rate-modifying activities on parallel machines. A rate-modifying activity is an activity that changes the production rate of equipment such as maintenance and readjustment. If a job is scheduled after the rate-modifying activity, then the processing time varies depending on the modifying rate of the activity. In this study, we extend the single machine problem to parallel machines problem and propose algorithms is to schedule the rate-modifying activities and jobs to minimize the makespan on parallel machines which is NP-hard. We propose a branch and bound algorithm with three lower bounds to solve medium size problems optimally. Also we develop three heuristics, Modified Longest Processing Time, Modified MULTIFIT and Modified COMBINE algorithms to solve large size problems. The test results show that branch and bound algorithm finds the optimal solution in a reasonable time for medium size problems (up to 15 jobs and 5 machines). For large size problem, Modified COMBINE and Modified MULTIFIT algorithms outperform Modified LPT algorithm in terms of solution quality.

WIPI based E-mail and Schedule Management System (WIPI 기반의 이메일 시스템 및 일정 관리 시스템)

  • Lee Jung-Yun;Lee Kyung-Jin;Song Wang-Cheol
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2005.05a
    • /
    • pp.333-336
    • /
    • 2005
  • The implementation of cellular phone based applications have been growing very fast because of WIPI which is a hardware independent platform. In this paper, we design and Implement a system to combine the animation avatar and e-mail service by using WIPI platform. Also, this system manages scheduling at the same time. This system uses SMS service in order to notify scheduled time and it synchronizes the schedule data with Outlook Express on the computer.

  • PDF

Development of Unit Commitment Methodology Considering Direct Load Control by 3-Dimensional Dynamic Programming (3차원 동적계획법에 의한 직접부하제어를 고려한 기동정지계획 방법론의 개발)

  • Lee, Buhm;Kim, Yong-Ha;Choi, Sang-Kyu;Kim, Hyeong-Jung
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.51 no.12
    • /
    • pp.591-596
    • /
    • 2002
  • This Paper Presents a new methodology for Direct Load Control(DLC) and Unit Commitment. To consider economical effect of DLC, we developed 3-Dimensional dynamic programming which can combine unit commitment and DLC. Traditional dynamic programming has 2-Dimensional which consist of state and stage, but newly developed dynamic programming has DLC state, U.C. state, and stage. As a result, economical DLC and unit commitment schedule of the power system is possible. This method is applied to the test system, and the usefulness of the method is verified.

THE APPLICATION OF THEORY OF CONSTRAINT IN SCHEDULING

  • Tsung-Chieh Tsai;Min-Lan Young
    • International conference on construction engineering and project management
    • /
    • 2005.10a
    • /
    • pp.902-907
    • /
    • 2005
  • This study was undertaken to develop a comprehensive scheduling method which applied the core concept(DBR) of TOC to PERT, and to combine Monte Carlo Simulation to revise the uncertainties of activities then to eliminate project duration uncertainty. Most of the project duration overlooks the fact that in spite of minimizing the project duration, the uncertainty of constrained resources still puts the reliability of project duration in jeopardy. For the contractor, however, the most important thing is to comply the project scheduling with the planning to reduce the uncertainty of the project activities, operational interaction and project duration. In order to demonstrate that the model can be used in construction project, the scheduling of a steel-structure project was used as a case study to verify the validity of this model.

  • PDF

Management of Risk Scenarios based on Ground Conditions under Construction of a Subsea Tunnel (해저터널 시공중 지반조건별 위험 시나리오 관리기법)

  • Park, Eui-Seob;Shin, Hee-Soon;Shin, Yong-Hoon;Kim, Taek-Gon
    • Tunnel and Underground Space
    • /
    • v.19 no.4
    • /
    • pp.275-286
    • /
    • 2009
  • In order to establish the causes and measures for technical risks that occur in various ground conditions when a subsea tunnel is excavated, it is important to configure expected risk scenarios. In addition, when the risk scenarios are classified because the scenario that occurs along all tunnel route and the scenario limited to some area are considered together, a logical framework with systematic and organized responses can be provided for project managements. In this research, project risk scenarios and management elements were configurated, and the project schedule was established for the management techniques to the risk scenario. The risk scenarios expected in a subsea tunnel were classified into a common risk scenario and a special risk scenario, and the concept which can combine with the project management elements was derived.