• Title/Summary/Keyword: time schedule

검색결과 1,364건 처리시간 0.022초

A Progress-based Expert System for Quantitative Assessments of Project Delay

  • Yoo, Wi Sung
    • Architectural research
    • /
    • 제10권1호
    • /
    • pp.41-48
    • /
    • 2008
  • Construction projects have frequently exceeded their schedule despite reliable estimates at the start of a project. This problem was attributed to unpredictable causes at the beginning and to shortage of proper tools to accurately predict project completion date. To supplement this difficulty, project managers need a comprehensive system that can be employed to monitor the progress of an ongoing project and to evaluate potential delay for achieving the goal on time. This paper proposed a progressive-based expert system for quantitative assessments of project delay at the early stages of the execution. Furthermore, the system is used to inspect the change of the uncertainty on completion date and its magnitude. The proposed expert system is helpful for furnishing project managers a warning signal as a project is going behind schedule and for tracking the changed uncertainty at a desired confidence level. The main objectives of this paper are to offer a new system to overcome the difficulties of conventional forecasting tools and to apply a construction project into the system to illustrate its effectiveness. This paper focuses on construction phase of project development and is intended for the use by project managers.

Enhanced resource scheduling in Grid considering overload of different attributes

  • Hao, Yongsheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권3호
    • /
    • pp.1071-1090
    • /
    • 2016
  • Most of scheduling methods in the Grid only consider one special attribute of the resource or one aspect of QoS (Quality of Service) of the job. In this paper, we focus on the problem that how to consider two aspects simultaneously. Based on the requirements of the jobs and the attributes of the resources, jobs are categorized into three kinds: CPU-overload, memory-overload, and bandwidth-overload jobs. One job may belong to different kinds according to different attributes. We schedule the jobs in different categories in different orders, and then propose a scheduling method-MTS (multiple attributes scheduling method) to schedule Grid resources. Based on the comparisons between our method, Min-min, ASJS (Adaptive Scoring Job Scheduling), and MRS (Multi-dimensional Scheduling) show: (1) MTS reduces the execution time more than 15% to other methods, (2) MTS improves the number of the finished jobs before the deadlines of the jobs, and (3) MTS enhances the file size of transmitted files (input files and output files) and improves the number of the instructions of the finished jobs.

자동화 공정에서 워크스테이션 컨트롤러의 스케줄러 개발

  • 이원배;도성희;박경진;강무진
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 1992년도 춘계학술대회 논문집
    • /
    • pp.359-363
    • /
    • 1992
  • As the demands of manufacturing automation is increasing, lots of efforts are devoted to the applications of Computer Integrated Manufacturing(CIM) concept in manufacturing shop floor. A workstation is a computer which controls differnet machines in the low level of factory(shop floor). A workstation can be utilized efficiently to enhance the coopetative work of machines. A scheduler is a component program in a workstation and it controls the operation of machines according to a fixed plan. A scheme for the scheduler has been developed for selected machines and software has been made. The fixed plan is stored in a schedule file which keeps machine names, communications methods, information for communications and time for the usages, etc. The scheduler carries out its role by the information in the schedule file. Although the developed software has some Iimitations, the test results show that the scheduler can be applied easily to the automation of the low level of factory.

영업사원 관제시스템의 효율적인 경로 스케줄링 (Efficient Scheduling for Salesperson Monitoring System)

  • 김승;민영빈;이우기;배혜림
    • 대한산업공학회지
    • /
    • 제37권4호
    • /
    • pp.382-389
    • /
    • 2011
  • Salesperson Monitoring System (SMS) is geographic based information system that supports business auditing, sales area coordinating and customer management for each salesperson. Conventional SMSs focus mainly on the monitoring or logging functions, i.e., a salesperson locating or moving trail tracking. However, the schedules have been planned by human planner, and they have rarely been managed with a software system like SMS. In this paper, a mixed integer programming model for a salesperson routing schedule is provided. Then, 2-phase Genetic Algorithm (GA) is proposed to make salesperson routing schedule. Experimental results show a validity of the proposed method.

Multiple Product Single Facility Stockout Avoidance Problem (SAP) and Weighted Stockout Problem (WSP)

  • Moon, Il-Kyeong
    • 한국경영과학회지
    • /
    • 제17권3호
    • /
    • pp.137-158
    • /
    • 1992
  • We study the Multiple Product Single Facility Stockout Avoidance Problem (SAP). That is the problem of determining, given initial inventories, whether there is a multiple product single facility production schedule that avoids stockouts over a given time horizon. The optimization version of the SAP where stockouts are pnelized linearly is also studied. We call this problem the Weighted Stockout Problem (WSP). Both problems are NP-hard in the strong sense. We develop Mixed Integer Linear Programming (MIP) formulations for both the SAP and the WSP. In addition, several heuristic algorithms are presented and performances are tested using computational experiments. We show that there exist polynomial algorithms for some special cases of the SAP and the WSP. We also present a method to phase into a target cyclic schedule for infinite horizon problems. These can be used as a practical scheduling tool for temporarily overloaded facilities or to reschedule production after a disruption.

  • PDF

25MW급 산업용 가스터빈의 저널과 베어링 손상 보수사례에 관한 연구 (A Study on Repair Case of Journal and Bearing Damage for 25MW Industrial Gas Turbine)

  • 김병옥;선경호;이안성
    • 한국유체기계학회 논문집
    • /
    • 제15권6호
    • /
    • pp.64-69
    • /
    • 2012
  • This paper deals with the study on repair case of journal shaft and bearing damage in 25MW industrial gas turbine caused by sudden blackout, operation mistake, and logic abnormal, etc. When a serious accident such as journal and bearing damage in a gas turbine occurs, the domestic local companies having the gas turbine are dependent on manufacturer for all maintenance and repair schedule until now. This case study shows that the damaged gas turbine is normally re-operated itself in domestic by establishing repair schedule in a short period of time, repairing damage journal shaft and tilting pad bearings, and performing rotating test for a reliability check. This paper can be regarded as the important case study of emergency test run experience of the refurbished 25MW gas turbine rotor.

패밀리 셋업이 존재하는 병렬기계 일정계획 수립 (Scheduling for Parallel Machines with Family Setup Times)

  • 권익현;신현준;엄동환;김성식
    • 한국경영과학회지
    • /
    • 제30권1호
    • /
    • pp.27-41
    • /
    • 2005
  • This paper considers identical parallel machine scheduling problem. Each job has a processing time. due date. weight and family type. If a different type of job is followed by prior job. a family setup is incurred. A two phased heuristic is presented for minimizing the sum of weighted tardiness. In the first phase. using roiling horizon technique. group each job into same family and schedule each family. In the second phase. assign each job to machines using schedule obtained in the first phase. Extensive computational experiments and comparisons among other algorithms are carried out to show the efficiency of the proposed algorithm.

다단계 병렬 흐름생산시스템에서 이송크기가 2이상인 경우의 제품별 로트 투입순서 결정 (Transfer Batch Scheduling for a Flexible Flowshop with Identical Parallel Machines at Each Stage)

  • 김중순
    • 한국경영과학회지
    • /
    • 제25권2호
    • /
    • pp.33-46
    • /
    • 2000
  • The problem of scheduling n independent jobs on serial stages with identical parallel machines at each stage is considered. Each job lot is allocated evenly to all machines at each stage for processing and moved in transfer batches between states., This scheduling strategy is called an identical production pattern. The objective is to find a permutation schedule that minimizes makespan. A branch and bound algorithm is suggested to find an optimal permutation schedule for a transformed problem A number examples is presented to illustrate the branch and bound algorithm, Computational results for 640 problems generated randomly show that within a resonable time the suggested algorithm can be used for transfer batch scheduling in a flexible flowshop.

  • PDF

작업분류체계(WBS)를 이용한 안전해체공사 시스템 개발에 관한 연구 (A Study on the Development of Safety Demolition Work System by using Work Breakdown Structure)

  • 김광서;양극영;이용수;윤여완;김천학
    • 한국구조물진단유지관리공학회 논문집
    • /
    • 제2권3호
    • /
    • pp.176-187
    • /
    • 1998
  • The Dismantlement and Construction of the buildings have the characteristic of floating change with repetition within a Time Schedule which has fixed resources, that is, Manpower, Materials and Equipments, and involve many disaster factors in performing each processes. But as these factors are variable, a work supervisor should be able to understand data analysed distinctive factors of each activities systematically, organizationally, and scientifically, and diagrammatic information media so that he can control any complex and situation beyond forecast. Thus this study is intended to be a barometer of weighing if the existing process schedule has taken security into consideration by making the characteristics of organization and action of Work package per process in a building field with more factors like these into a network system and is intended to minimize construction disasters by systematizing this into a Transformational Network.

  • PDF

추가자원제약을 갖는 Job Shop 작업계획의 성능 비교 (A Comparison of Dispatching Rules for Auxiliary Resource Constrained Job Shop Scheduling)

  • 배상윤
    • 산업경영시스템학회지
    • /
    • 제28권1호
    • /
    • pp.140-146
    • /
    • 2005
  • This study presents the new dispatching rules of job shop scheduling with auxiliary resource constraint to improve the schedule performance measures related to completion time and due dates. The proposed dispatching rules consider the information of total work remaining and machine utilization to decrease mean flowtime and mean tardiness. The results of computer experiments show that those schedule performances are significantly improved by using the new dispatching rules. The results provide guidance for the researchers and practitioners of auxiliary resource constrained job shop scheduling to decrease mean flowtime and mean tardiness.