• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.5
• /
• pp.243-254
• /
• 2005

Soft real-time applications such as multimedia feature highly variable processor requirements and probabilistic guarantees on deadline misses, meaning that each task in the application meets its deadline with a given probability. Thus, for such soft real-time applications, a system designer may want to improve the system utilization by allocating to each task a processor time less than its worst-case requirement, as long as the imposed probabilistic timing constraint is met. In this case, however, we have to address how to schedule jobs of a task that require more than (or, overrun) the allocated processor time to the task. In this paper, to address the overrun problem, we propose an overrun control method, which probabilistically controls the execution of overrunning jobs. The proposed overrun control method probabilistically allows overrunning jobs to complete for better system utilization, and also probabilistically prevents the overrunning jobs from completing so that the required probabilistic timing constraint for each task can be met. In the paper, we show that the proposed method outperforms previous methods proposed in the literature in terms of the overall deadline miss ratio, and that it is possible to synthesize the scheduling parameters of our method so that all tasks can meet the given probabilistic timing constraints.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.10
• /
• pp.493-501
• /
• 2007

The imprecise real-time system provides flexibility in scheduling time-critical tasks. Most scheduling problems of satisfying both 0/1 constraint and timing constraints, while the total error is minimized, are NP-complete when the optional tasks have arbitrary processing times. Liu suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on uniprocessors for minimizing the total error. Song et at suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on multiprocessors for minimizing the total error. But, these algorithms are all off-line algorithms. In the online scheduling, the NORA algorithm can find a schedule with the minimum total error for the imprecise online task system. In NORA algorithm, EDF strategy is adopted in the optional scheduling. On the other hand, for the task system with 0/1 constraint, EDF_Scheduling may not be optimal in the sense that the total error is minimized. Furthermore, when the optional tasks are scheduled in the ascending order of their required processing times, NORA algorithm which EDF strategy is adopted may not produce minimum total error. Therefore, in this paper, an online algorithm is proposed to minimize total error for the imprecise task system with 0/1 constraint. Then, to compare the performance between the proposed algorithm and NORA algorithm, a series of experiments are performed. As a conseqence of the performance comparison between two algorithms, it has been concluded that the proposed algorithm can produce similar total error to NORA algorithm when the optional tasks are scheduled in the random order of their required processing times but, the proposed algorithm can produce less total error than NORA algorithm especially when the optional tasks are scheduled in the ascending order of their required processing times.

• KIEE International Transaction on Electrical Machinery and Energy Conversion Systems
• /
• v.4B no.1
• /
• pp.29-35
• /
• 2004

Locomotive scheduling in railway systems experiences many difficulties because of the complex interrelations among resources, knowledge and various constraints. Artificial intelligence technology has been applied to solve these scheduling problems. These technologies have proved to be efficient in representing knowledge and rules for complex scheduling problems. In this paper, we have applied the CSP (Constraints Satisfaction Problems) programming technique, one of the AI techniques, to solve the problems associated with locomotive scheduling. This method is more effective at solving complex scheduling problems than available mathematical programming techniques. The advanced locomotive scheduling system using the CSP programming technique is realized based on the actual timetable of the Saemaul type train on the Kyong-bu line. In this paper, an overview of the CSP programming technique is described, the modeling of domain and constraints is represented and the experimental results are compared with the real-world existing schedule. It is verified that the scheduling results by CSP programming are superior to existing scheduling performed by human experts. The executing time for locomotive scheduling is remarkably reduced to within several decade seconds, something requiring several days in the case of locomotive scheduling by human experts.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• 2008.11a
• /
• pp.252-255
• /
• 2008

The purpose of construction project management is to achieve planned quality by adequate cost and schedule of the project, thus the effective time management is a critical factor to actualize the object. But the traditional time management by using milestone has several limitations which are not sufficiently considered mutual relation and variated from the task. On this wise, applying the concept and principles of lean construction to the project will be the best way not only reduce waste and variation, but also improve the productivity and ability to overcome limitation as mentioned above. Thus the study, Last Planner System, specially focuses on constraint analysis which is used in lookahead planning system. The results of this research will provide the constraints classification that is able to improve work reliable and percent plan complete when time planning by controlling constraints of project.

• Journal of Navigation and Port Research
• /
• v.31 no.10
• /
• pp.869-877
• /
• 2007

This paper proposes a realtime scheduling method using local search algorithm for non-crossable yard cranes in automated container terminal. To take into consideration the dynamic property of yard crane operation and satisfy the real time constraint, the proposed method repeatedly builds crane schedule for the jobs in a fixed length look-ahead horizon whenever a new job is requested In addition, the proposed method enables the co-operation between yard cranes through prior re-handling and re-positioning in order to resolve the workload imbalance problem between the two cranes, which is one of the primary causes that lower the performance of yard cranes. Simulation-based experiments have shown that the proposed method outperforms the heuristic based methods, and the cooperation scheme contributes a lot to the performance improvement.

• Proceedings of the KSR Conference
• /
• 2007.11a
• /
• pp.1731-1737
• /
• 2007

This paper considers subway routing problem. Given a schedule of train to be routed by a railway stock, the routing problem determines a sequence of trains while satisfying turnaround time and maintenance restrictions. Generally, the solution of routing problem is generated from set partition formulation solved by column generation method, a typical integer programming approach for train-set. However, we find the characteristics of metropolitan subway which has a simple rail network, a few end stations and 13 departure-arrival patterns. We reflect a turn-around constraint due to spatial limitations has no existence in conventional railroad. Our objective is to minimize the number of daily train-sets. In this paper, we develop two basic techniques that solve the subway routing problem in a reasonable time. In first stage, we formulate the routing problem as a Min-cost-flow problem. Then, in the second stage, we attempt to normalize the distance covered to each routes and reduce the travel distance using our heuristic approach. Applied to the current daily timetable, we could find the subway routings, which is an approximately 14% improvement on the number of train-sets reducing 15% of maximum traveling distance and 8% of the standard deviation.

• Journal of Preventive Medicine and Public Health
• /
• v.24 no.4 s.36
• /
• pp.531-548
• /
• 1991

To assess the adequacy of medical manpower and medical fee for the newborn nursery care, the author visited 20 out of 24 hospitals with the pediatric training program in Youngnam area between July 29 and August 14, 1991. Total number of newborn, both normal and sick, admission and discharge in 1-30 June 1991 was obtained from the logbook of nursery. Head nurse and staff pediatrician of the nursery were interviewed to get the current staffing for the nursery and their subjective opinion on the adequacy of nursery manpower and the difficulties in recruiting manpower. Average medical fee charged for the maternity and normal newborn nursery care was obtained from the division of self-audit of medical insurance claim of each hospital. Average minimum requirement of nursing care time for one normal newborn per day was 179.5 (${\pm}58.6$) minutes; 202.3(${\pm}50.7$) minutes for the university hospitals and 164.2(${\pm}60.5$) minutes for the general hospitals. The ratio of minimum requirement of nursing care time and available nursing time was 1.42 on the average. Taking the additional requirement of nursing care for the sick newborns into consideration, the ratio was 2.06. The numbers of R. N. and A. N. in the nurserys of study hospitals were 31%, and 17%, respectively, of the nursing manpower for the nursery recommended by the American Academy of Pediatrics. These findings indicate that the nursing manpower in newborn nursery is in severe shortage. Ninety percent of the head nurses and 85% of the staff pediatrician stated that the newborn nursery is short of R.N. and 75% of them said that the nurse's aide is also short. Major reason for not recruiting R.N. was the financial constraint of hospital. For the recruitment of nurse's aide, short supply was the second most important reason next to the financial constraint. However, limit of quarter in T.O. was the mar reason for the national university hospitals. Average total medical fee for the maternity and newborn nursery cares of a normal vaginal delivery who stayed two nights and three days at hospital was 219,430won. Out of the total medical fee, 20,323won(9.3%) was for the newborn nursery care. In case of C-section delivery who stayed six nights and seven days, total medical fee was 732,578won and out of the total fee 76,937won (12.0%) was for the newborn care. Cost for a newborn care per day by cost accounting was 16,141won for the tertiary care hospitals and 14,576won for the all other hopitals. The ratio of cost and the fee schedule of the medical insurance for a newborn care per day was 5.0 for the tertiary care hospitals and 4.9 for the all other hospitals. Considering the current wage level of the medical personnel, capital investment for the hospital facilities and equipments, and the cost for hospital maintenance, it is hard to expect adequate quality care in the newborn nursery under the current medical insurance fee schedule.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• 2007.11a
• /
• pp.68-74
• /
• 2007

Critical Chain Project Management(CCPM) is a new project management system paradigm which maintains the advantages of PERT/CPM and improves the shortcomings of it. In CCPM the task durations are determined as 50% time estimates, ie average time discarding the their contingency. CCPM determines the critical chain the constraint of a projects considering the logical precedence relationship and resource conflict resolution. Project buffer is located at the end of critical chain to absorb the variations of critical chain. The size of project buffer is usually calculated as the half of the sum of critical chain length. Also feeding buffer is inserted after each non-critical chain which feeding into the critical chain to prevent the time delay of critical chain from uncertainties of non-critical chains. Resource buffer can be utilized to improve the availability of resources of critical chain. Buffer management is a project execution and control mechanism. Buffers are classified into 3 zones. They are OK zone, Watch and Plan zone and Expediting zone. If the project status is within Watch and Plan zone, contingency plan is established. And if it changes into Expediting zone, the preplanned contingency plan are executed to recover the time delay. In CCPM the workers are asked to work with relay runner work mechanism that they work fast if possible and report their completion to project manager for the succeeding task to start as soon as possible. The task durations are not considered as the promised time schedule. The multi-tasking is prohibited.