• Title/Summary/Keyword: time schedule

Search Result 1,360, Processing Time 0.03 seconds

Heat Treatment and Drying Methods of Small-Notched Bamboo for Vertical Flute (단소용 대나무재의 열처리 및 건조)

  • 변희섭;오승원;공태석;김종만
    • Journal of Korea Foresty Energy
    • /
    • v.21 no.3
    • /
    • pp.10-17
    • /
    • 2002
  • This study was carried out to investigate a heat treatment condition and suitable drying schedule of bamboo material(Phyllostachys nigra var. henonis) for a vertical flute with small-notched bamboo. It is very important to prevent drying defects during its drying process. We investigated the effort of heat treatment the most suitable drying schedule for small-notched bamboo vertical flute without drying defects in this research. A direct heat treatment method and drying conditions of 3($20^{\circ}C$ 65%, $40^{\circ}C$ 40%, and dry at air condition) were applied to the Bamboo specimen that felled in several areas for a month. The result suggested that the most suitable drying schedule with the less split and the shortest time was to dry at $40^{\circ}C$, 40% condition and it was useful to direct heat-treatment because of reducing the number and size of split during drying bamboo.

  • PDF

IMPROVING THE USABILITY OF STOCHASTIC SIMULATION BASED SCHEDULING SYSTEM

  • Tae-Hyun Bae;Ryul-Hee Kim;Kyu-Yeol Song;Dong-Eun Lee
    • International conference on construction engineering and project management
    • /
    • 2009.05a
    • /
    • pp.393-399
    • /
    • 2009
  • This paper introduces an automated tool named Advanced Stochastic Schedule Simulation System (AS4). The system automatically integrates CPM schedule data exported from Primavera Project Planner (P3) and historical activity duration data obtained from a project data warehouse, computes the best fit probability distribution functions (PDFs) of historical activity durations, assigns the PDFs identified to respective activities, computes the optimum number of simulation runs, simulates the schedule network for the optimum number of simulation runs, and estimates the best fit PDF of project completion times (PCTs). AS4 improves the reliability of simulation-based scheduling by effectively dealing with the uncertainties of the activities' durations, increases the usability of the schedule data obtained from commercial CPM software, and effectively handles the variability of the PCTs by finding the best fit PDF of PCTs. It is designed as an easy-to-use computer tool programmed in MATLAB. AS4 encourages the use of simulation-based scheduling because it is simple to use, it simplifies the tedious and burdensome process involved in finding the PDFs of the many activities' durations and in assigning the PDFs to the many activities of a new network under modeling, and it does away with the normality assumptions used by most simulation-based scheduling systems in modeling PCTs.

  • PDF

A Study on the Reformation of the Contract Time Extension Process in the Public Construction projects (공공건설사업에서 계약기간 연장처리방법 개선에 관한 연구)

  • Cho Young-Jun;Lee Sang-Beom
    • Korean Journal of Construction Engineering and Management
    • /
    • v.6 no.3 s.25
    • /
    • pp.81-89
    • /
    • 2005
  • Delay schedule coming about duration extension is happening essentially because public construction project consist of many sub contractor. The method which can calculate delay day is suggested by many studies in case of happing delay schedule, but It is difficult to apply to real construction project because there is no mention about the control of The law of contract according to delay schedule. The law of Contract which is cost of account has more uncertain problem than FIDIC condition of contract. This study suggests method which can make extension of duration procedure clear in case of happing the reason of design change related with activity duration during carrying on construction, and a submission process of the reason of duration extension and modify schedule making way about section which is basis of calculating contract amount clear.

Feasibility Study on the Duration of Shiwha Techno-Valley through Simulation (시뮬레이션을 이용한 시화 테크노 벨리 공기 적정성 검토연구)

  • Kim Kyong-Ju;Kim Byeong-Soo;Chun Jin-Ku;Lee Jeong-Hun;Yun Won-Gun
    • Proceedings of the Korean Institute Of Construction Engineering and Management
    • /
    • autumn
    • /
    • pp.495-499
    • /
    • 2003
  • As an alternative to overcome the limitations of current popular schedule system such as Bar Chart, PERT, CPM in proving the feasibility of a given project schedule and duration, this research applies simulation to the 'Shiwha Techno-Valley project, and then reviews its usability in time management. Shiwha-Techno-Valley is a gigantic project requiring large number of equipment and resulting in traffic congestion. In particular, project site is located near the Shiwha industrial complex and Daeboo-Do tourist place. Therefore, current traffic needs should not be ignored. This research evaluates whether the project can be finished in a given time even if construction equipment increase in addition to the current traffic. Through the analysis of the simulation output, the research identifies the optimal resource input and the needs on alternative schedule for the project.

  • PDF

An Improved Particle Swarm Optimization Algorithm for Care Worker Scheduling

  • Akjiratikarl, Chananes;Yenradee, Pisal;Drake, Paul R.
    • Industrial Engineering and Management Systems
    • /
    • v.7 no.2
    • /
    • pp.171-181
    • /
    • 2008
  • Home care, known also as domiciliary care, is part of the community care service that is a responsibility of the local government authorities in the UK as well as many other countries around the world. The aim is to provide the care and support needed to assist people, particularly older people, people with physical or learning disabilities and people who need assistance due to illness to live as independently as possible in their own homes. It is performed primarily by care workers visiting clients' homes where they provide help with daily activities. This paper is concerned with the dispatching of care workers to clients in an efficient manner. The optimized routine for each care worker determines a schedule to achieve the minimum total cost (in terms of distance traveled) without violating the capacity and time window constraints. A collaborative population-based meta-heuristic called Particle Swarm Optimization (PSO) is applied to solve the problem. A particle is defined as a multi-dimensional point in space which represents the corresponding schedule for care workers and their clients. Each dimension of a particle represents a care activity and the corresponding, allocated care worker. The continuous position value of each dimension determines the care worker to be assigned and also the assignment priority. A heuristic assignment scheme is specially designed to transform the continuous position value to the discrete job schedule. This job schedule represents the potential feasible solution to the problem. The Earliest Start Time Priority with Minimum Distance Assignment (ESTPMDA) technique is developed for generating an initial solution which guides the search direction of the particle. Local improvement procedures (LIP), insertion and swap, are embedded in the PSO algorithm in order to further improve the quality of the solution. The proposed methodology is implemented, tested, and compared with existing solutions for some 'real' problem instances.

Methods of Establishing the Optimal Performance Measurement Baseline and Evaluating the Progress for Implementing EVMS (EVMS 적용을 위한 최적 성과측정기준선 설정 및 진도율 산정 방법)

  • Won Dong-Soo;Kim WooYoung;Lee Hyun-Soo
    • Proceedings of the Korean Institute Of Construction Engineering and Management
    • /
    • autumn
    • /
    • pp.395-400
    • /
    • 2001
  • In construction projects, it is very important to evaluate the performance of works in comparison with the cost and schedule plans. So, on the first of July, 2000, the Ministry of Construction and Transportation announced the EVMS will be applied in public sector soon. However there are still many arguments about how to establish the Performance Measurement Baseline(PMB) and how to evaluate the progress with accuracy. And many people confuse the meaning of EVMS with that of cost and schedule management. So, the purpose of this research is to propose the new useful methods to set up the PMB and to assess the exact progress in consideration of cost, schedule, and float time for successful implementation of EVMS.

  • PDF

Applying tools of Six Sigma and PSP for definition and schedule management of process (프로세스 정의 및 일정 관리를 위한 6시그마와 PSP도구의 적용 방안)

  • Choi, Seung-Yong;Kim, Jeong-Ah
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.11
    • /
    • pp.923-935
    • /
    • 2006
  • As the knowledge-based society has been constructed, the size of work process that has to be done grows bigger and the amount of the information that has to be analyzed increases. So each company is trying to construct more conformable process models in business model. In order to support the process construction of companies practically, in this paper tools of Six Sigma is applied to process definition and tools of PSP is applied schedule management. And to use the proposed tools efficiently, the procedure of process definition and schedule management are suggested. The goal of the proposed method is to achieve the process aim within the Time-To-Market by applying the process management of organizations and persons. And the goal of individuals is to improve personal process with the collected data.

A Broadcast Schedule Generation for Efficient Multiple Data Accesses (효율적인 다중 데이타 접근을 위한 방송 스케쥴 생성)

  • Lee, Sang-Don
    • Journal of KIISE:Databases
    • /
    • v.29 no.4
    • /
    • pp.285-296
    • /
    • 2002
  • When a client requests a set of data items at once, it is crucial to reduce the total time elapsed till the client receives all data items requested. This paper describes a data broadcasting technique that reduces access time for multiple data accesses from clients. The impact of the relative position of each data item in a broadcast schedule is dependent on the degree of data replication between data requests from clients. The relative broadcast frequencies for data items are affected by the degree of access skewness from clients. This paper proposes a technique for generation of a hierarchical data broadcast schedule, which can support multiple data accesses effectively by considering the data sharing among client requests and data access skewness together. Simulation results show that the proposed technique consistently performs better than the previous research results in various environments.

Applications to Recommend Moving Route by Schedule Using the Route Search System of Map API (지도 API의 경로 탐색 시스템을 활용한 일정 별 동선 추천 애플리케이션)

  • Ji-Woo Kim;Jung-Yi Kim
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.2
    • /
    • pp.1-6
    • /
    • 2023
  • The purpose of this study is to research and develop so that users who are gradually progressing in the popularization of smartphones and the calculation of agricultural quality can use more active and flexible applications than existing application fields. People use event management applications to remember what they need to do, and maps applications to get to their appointments on time. You will need to build a glue-delivered application that leverages the Maps API to be able to recommend the glove's path for events so that the user can use the application temporarily. By comparing and analyzing currently used calendar, map, and schedule applications, several Open Maps APIs were compared to supplement the weaknesses and develop applications that converge the strengths. The results of application development by applying the optimal algorithm for recommending traffic routes according to time and place for the schedule registered by the user are described.

On Energy-Optimal Voltage Scheduling for Fixed-Priority Hard Real-Time Systems (고정 우선순위 경성 실시간 시스템에 대한 최적의 전압 스케줄링)

  • 윤한샘;김지홍
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.10
    • /
    • pp.562-574
    • /
    • 2004
  • We address the problem of energy-optimal voltage scheduling for fixed-priority hard real-time systems. First, we prove that the problem is NP-hard. Then, we present a fully polynomial time approximation scheme (FPTAS) for the problem. for any $\varepsilon$>0, the proposed approximation scheme computes a voltage schedule whose energy consumption is at most (1+$\varepsilon$) times that of the optimal voltage schedule. Furthermore, the running time of the proposed approximation scheme is bounded by a polynomial function of the number of input jobs and 1/$\varepsilon$. Experimental results show that the approximation scheme finds more efficient voltage schedules faster than the best existing heuristic.