• Title/Summary/Keyword: Weighted scheduling

Search Result 134, Processing Time 0.018 seconds

Web-based Three-step Project Management Model and Its Software Development

  • Hwang Heung-Suk;Cho Gyu-Sung
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.05a
    • /
    • pp.373-378
    • /
    • 2006
  • Recently the technical advances and complexities have generated much of the difficulties in managing the project resources, for both scheduling and costing to accomplish the project in the most efficient manner. The project manager is frequently required to render judgments concerning the schedule and resource adjustments. This research develops an analytical model for a schedule-cost and risk analysis based on visual PERT/CPM. We used a three-step approach: 1) in the first step, a deterministic PERT/CPM model for the critical path and estimating the project time schedule and related resource planning and we developed a heuristic model for crash and stretch out analysis based upon a time-cost trade-off associated with the crash and stretch out of the project. 2) In second step, we developed web-based risk evaluation model for project analysis. Major technologies used for this step are AHP (analytic hierarchy process, fuzzy-AHP, multi-attribute analysis, stochastic network simulation, and web based decision support system. Also we have developed computer programs and have shown the results of sample runs for an R&D project risk analysis. 3) We developed an optimization model for project resource allocation. We used AHP weighted values and optimization methods. Computer implementation for this model is provided based on GUI-Type objective-oriented programming for the users and provided displays of all the inputs and outputs in the form of GUI-Type. The results of this research will provide the project managers with efficient management tools.

  • PDF

A study on the performance improvement of an adaptive, real-time traffic assignment scheduler using the TP coefficient (TP 계수를 이용한 적응적 실시간 트래픽 할당 스케듈러의 성능 향상에 관한 연구)

  • Park, Nho-Kyung;Jin, Hyun-Joon;Yun, Eui-Jung
    • Journal of Internet Computing and Services
    • /
    • v.11 no.4
    • /
    • pp.1-10
    • /
    • 2010
  • As recent fusion industry and ubiquitous technology have grown fast, network contents, which require high load, are provided in various infrastructures and facilities such as u-city and smart phones. Therefore, it is anticipated that the playback quality of multimedia compared to network loads degrades dramatically due to the drastic increment of real-time reference of conventional high load contents (eg. multimedia data). In this paper, we improved the method of the traffic assignment based on MPP which elevated the playback quality of multimedia by assigning discriminately the possible traffic of MMS with TP coefficients. When the TP coefficient which combines content preference with media preference was applied to a real-time traffic assignment scheduler, the simulation results showed that the multimedia playback stream was assigned within the possible traffic of a server. The real-time scheduling algorithm was improved by using the TP coefficient that combines the time-dependent image contents and the weighted value of media preference. It was observed from the experiment that the loss of the possible traffic decreases to 3.91% and 3.88% for three and four clients respectively.

Function Approximation for accelerating learning speed in Reinforcement Learning (강화학습의 학습 가속을 위한 함수 근사 방법)

  • Lee, Young-Ah;Chung, Tae-Choong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.13 no.6
    • /
    • pp.635-642
    • /
    • 2003
  • Reinforcement learning got successful results in a lot of applications such as control and scheduling. Various function approximation methods have been studied in order to improve the learning speed and to solve the shortage of storage in the standard reinforcement learning algorithm of Q-Learning. Most function approximation methods remove some special quality of reinforcement learning and need prior knowledge and preprocessing. Fuzzy Q-Learning needs preprocessing to define fuzzy variables and Local Weighted Regression uses training examples. In this paper, we propose a function approximation method, Fuzzy Q-Map that is based on on-line fuzzy clustering. Fuzzy Q-Map classifies a query state and predicts a suitable action according to the membership degree. We applied the Fuzzy Q-Map, CMAC and LWR to the mountain car problem. Fuzzy Q-Map reached the optimal prediction rate faster than CMAC and the lower prediction rate was seen than LWR that uses training example.

Automated Stacking Crane Dispatching Strategy in a Container Terminal using Genetic Algorithm (유전 알고리즘을 이용한 자동화 컨테이너 터미널에서의 장치장 크레인의 작업 할당 전략)

  • Wu, Jiemin;Yang, Young-Jee;Choe, Ri;Ryu, Kwang-Ryel
    • Journal of Navigation and Port Research
    • /
    • v.36 no.5
    • /
    • pp.387-394
    • /
    • 2012
  • In an automated container terminal, automated stacking cranes(ASCs) take charge of handling of containers in a block of the stacking yard. This paper proposes a multi-criteria strategy to solve the problem of job dispatching of twin ASCs which are identical to each another in size and specification. To consider terminal situation from different angles, the proposed method evaluates candidate jobs through various factors and it dispatches the best score job to a crane by doing a weighted sum of the evaluated values. In this paper, we derive the criteria for job dispatching strategy, and we propose a genetic algorithm to optimize weights for aggregating evaluated results. Experimental results are shown that it is suitable for real time terminal with lower computational cost and the strategy using various criteria improves the efficiency of the container terminal.