• Title/Summary/Keyword: Schedule Compression

Search Result 15, Processing Time 0.032 seconds

Cost-Schedule Tradeoff in Software Project (소프트웨어 프로젝트의 비용-일정 타협)

  • Lee, Sang-Un;Choi, Myeong-Bok
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.4
    • /
    • pp.99-106
    • /
    • 2013
  • Generally, software development schedule compression is decided within 75% of nominal schedule. However, there are some difficulties when we judge the possibility of development schedule compression because a nominal schedule has not been definitely. Therefore, this paper investigates various nominal schedule estimation models and decides the optimum range. Basing on the performance of ISBSG Release 8,614 projects are extracted from the actual 1,595 projects. We presented development effort estimation model from those data. Also, we derived the development schedule model from the development effort. When you apply the proposed model, you will be able to estimate development effort and schedule required for the development more actually.

Modified Software Equation for Software Cost-Schedule Tradeoff (소프트웨어 비용-일정 타협을 위한 수정된 소프트웨어 공식)

  • Lee, Sang-Un;Choi, Myeong-Bok
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.9
    • /
    • pp.35-43
    • /
    • 2011
  • To develop a software, there is a relationship between development organization's productivity, effort, development schedule, and software size. It is software equation that motive these relations. Basically, relationship between size-effort and size-schedule is applied. If this relationship is not proper, there would be no effect of the cost-schedule tradeoff equation that is derived from software equation, and the manpower profile analysis, etc. To solve these unwanted problems, we presented a modified software equation and a cost-schedule tradeoff model based on the modified software equation. To improve software development success rate, applying proposed model will help in contract negotiation or bid.

Contingency Estimation Method based on Stochastic Earned Value Management System (추계적 EVMS 기반 예비비 산정 방법론)

  • Gwak, Han-Seong;Choi, Byung-Youn;Yi, Chang-Yong;Lee, Dong-Eun
    • Proceedings of the Korean Institute of Building Construction Conference
    • /
    • 2018.05a
    • /
    • pp.72-73
    • /
    • 2018
  • The accuracy of contingency estimation plays an important role for dealing with the uncertainty of the financial success of construction project. Its' estimation may be used for various purposes such as schedule control, emergency resolve, and quality expense, etc. This paper presents a contingency estimation method which is schedule control specific. The method 1) implements stochastic EVMS, 2) detects a specific timing for schedule compression, 3) identifies an optimal strategy for shortening planned schedule, 4) finds a probability density function (PDF) of project cost overrun, and 5) estimates the optimal contingency cost based on the level of confidence. The method facilitates expeditious decisions involved in project budgeting. The validity of the method is confirmed by performing test case.

  • PDF

OVERALL BENEFIT-DURATION OPTIMIZATION (OBDO) FOR OWNERS IN LARGE-SCALE CONSTRUCTION PROJECTS

  • Seng-Kiong Ting;Heng Pan
    • International conference on construction engineering and project management
    • /
    • 2005.10a
    • /
    • pp.780-785
    • /
    • 2005
  • This paper aims to consider an overall benefit-duration optimization (OBDO) problem for the sake of maximizing owner's economic benefits, whilst considering influences of schedule compression incurred opportunity income on the profitability of a large-scale construction project. Unlike previous schedule optimization models and techniques that have focused on project duration or cost minimization, with greater weight on contractors' interests, OBDO facilitates owner's economic benefits through overall benefit-duration optimization. In this paper, the objective function of OBDO model is formulated. An example is illustrated to prove the feasibility and practicability of the overall benefit-duration optimization problem. The significance of employing OBDO model and future research work are also described.

  • PDF

Network Compression by Saying Idle Time of Resources and Spaces for Repetitive Activities (작업공간과 자원의 여유시간 최소화를 통한 반복작업 공정계획기법)

  • Yi Kyoo Jin
    • Korean Journal of Construction Engineering and Management
    • /
    • v.1 no.3 s.3
    • /
    • pp.75-80
    • /
    • 2000
  • In scheduling multi-unit projects, several alternatives can exist in network construction due to repetitiveness of their activities. Project duration is affected not only by the duration of each activity but also by the arrangement of repeating activities in such projects. This paper provides a network compression method that assigns predecessors to each activity to minimize its float time. Different to the previous efforts that utilized line of balance as the base scheduling-model, this research adopts precedence diagram arranged in two coordinates, the space axis and the resource one. This method seeks the most appropriate predecessors for each activity in each direction of the two coordinates for the purpose of minimizing the idle resource and space. This activity arrangement method was applied to a multi-unit apartment-construction project, to prove its capability of network compression. The result shows that the method successfully sought room for saving construction duration by changing the activity arrangement. The network compression method presented in this research can be utilized in multi-unit construction projects such as apartment complex projects.

  • PDF

An Estimating for Practical Software Development Duration (실현 가능한 소프트웨어 개발기간 추정)

  • Lee, Sang-Un;Choi, Myeong-Bok
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.6
    • /
    • pp.155-164
    • /
    • 2012
  • The compression of software development schedule has a limit without regarding to a development manpower. However, the actually developed softwares includes the impossible short time or unreal long time date. Previously suggested models are driving the development schedule from all of the actually developed software without considering these constraints. This paper recommends a standard of minimum and the most suitable development time period. This paper has chosen a criterion that shows the best development schedule among 5 criteria based on the actually performed projects. Moreover, this paper suggests a model that estimates the development schedule based on the best criterion.

Design of Rolling Path Schedule for Refinement of Austenite Grain (오스테나이트 결정립 미세화를 위한 후판 압연 패스 스케줄의 설계)

  • Hong, Chang-Pyo;Park, Jong-Jin
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.25 no.11
    • /
    • pp.1844-1853
    • /
    • 2001
  • In the present investigation, it was attempted to design the rolling pass schedule fur a clean steel of 0.1C-1.5Mn-0.25Si with the objective of the austenite grain refinement. As the method of approach, a coupled mathematical modeling technique was proposed which consists of a recrystallization model and a flow stress modes. The validity of the coupled model was examined through comparison with results of continuous and discontinuous compression tests at various temperatures, strains and strain rates. The coupled model was incorporated with the finite element method to set up a systematic design methodology far the rolling path schedule for austenite grain refinement. Two path schedules were obtained and discussed in the paper with regard to rolling path time, average grain size, grain size deviation in thickness, etc.

A time-cost tradeoff problem with multiple interim assessments under the precedence graph with two chains in parallel

  • Choi, Byung-Cheon;Min, Yunhong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.23 no.3
    • /
    • pp.85-92
    • /
    • 2018
  • We consider a project scheduling problem in which the jobs can be compressed by using additional resource to meet the corresponding due dates, referred to as a time-cost tradeoff problem. The project consists of two independent subprojects of which precedence graph is a chain. The due dates of jobs constituting the project can be interpreted as the multiple assessments in the life of project. The penalty cost occurs from the tardiness of the job, while it may be avoided through the compression of some jobs which requires an additional cost. The objective is to find the amount of compression that minimizes the total tardy penalty and compression costs. Firstly, we show that the problem can be decomposed into several subproblems whose number is bounded by the polynomial function in n, where n is the total number of jobs. Then, we prove that the problem can be solved in polynomial time by developing the efficient approach to obtain an optimal schedule for each subproblem.

Applying Unit Modular In-Fill Construction Method for High-Rise Buildings

  • Moon, Sangdeok;Kim, Junyoung;Lee, Jaesung;Ock, Jongho
    • International conference on construction engineering and project management
    • /
    • 2015.10a
    • /
    • pp.132-137
    • /
    • 2015
  • A modular construction method includes factory-prefabricated room-sized volumetric units. Although low-rise buildings have been constructed worldwide using this method for more than 30 years, it is a relatively new technology in high-rise construction. There are three basic methods of constructing high-rise buildings using modular construction: the core method, the core-and-podium combination method, and the modular in-fill method. While the first two have been used in the USA and in several European countries, the third method, introduced in 2011 by an international cruise ship development firm, is a rather new approach for which there are few case histories. Therefore, its applicability and construction feasibility should be verified. As a pilot study to test the applicability of the modular in-fill method, a 12-story residential building was built in Korea. This paper describes a case study of the pilot project. The advantages and disadvantages of the method and its applicability in terms of cost effectiveness and construction schedule management were evaluated.

  • PDF

Fine-scalable SPIHT Hardware Design for Frame Memory Compression in Video Codec

  • Kim, Sunwoong;Jang, Ji Hun;Lee, Hyuk-Jae;Rhee, Chae Eun
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.17 no.3
    • /
    • pp.446-457
    • /
    • 2017
  • In order to reduce the size of frame memory or bus bandwidth, frame memory compression (FMC) recompresses reconstructed or reference frames of video codecs. This paper proposes a novel FMC design based on discrete wavelet transform (DWT) - set partitioning in hierarchical trees (SPIHT), which supports fine-scalable throughput and is area-efficient. In the proposed design, multi-cores with small block sizes are used in parallel instead of a single core with a large block size. In addition, an appropriate pipelining schedule is proposed. Compared to the previous design, the proposed design achieves the processing speed which is closer to the target system speed, and therefore it is more efficient in hardware utilization. In addition, a scheme in which two passes of SPIHT are merged into one pass called merged refinement pass (MRP) is proposed. As the number of shifters decreases and the bit-width of remained shifters is reduced, the size of SPIHT hardware significantly decreases. The proposed FMC encoder and decoder designs achieve the throughputs of 4,448 and 4,000 Mpixels/s, respectively, and their gate counts are 76.5K and 107.8K. When the proposed design is applied to high efficiency video codec (HEVC), it achieves 1.96% lower average BDBR and 0.05 dB higher average BDPSNR than the previous FMC design.