• International conference on construction engineering and project management
• /
• 2013.01a
• /
• pp.403-411
• /
• 2013

Horizontal construction projects such as oil and gas pipeline projects typically involve repetitive-work activities with the same crew and equipment from one end of the project to the other. Repetitive scheduling also known as linear scheduling is known to have superior schedule management capabilities specifically for such horizontal construction projects. This study discusses on expanding the capabilities of repetitive scheduling to account for the variance in production rates and visual representation by developing an automated alignment based linear scheduling program for applying temporal and spatial changes in production rates. The study outlines a framework to apply changes in productions rates when and where they will occur along the horizontal alignment of the project and illustrates the complexity of construction through the time-location chart through a new linear scheduling model, Linear Scheduling Model with Varying Production Rates (LSM_VPR). The program uses empirically derived production rate equations with appropriate variables as an input at the appropriate time and location based on actual 750 mile natural gas liquids pipeline project starting in Wyoming and terminating in the center of Kansas. The study showed that the changes in production rates due to time and location resulted in a close approximation of the actual progress of work as compared to the planned progress and can be modeled for use in predicting future linear construction projects. LSM_VPR allows the scheduler to develop schedule durations based on minimal project information. The model also allows the scheduler to analyze the impact of various routes or start dates for construction and the corresponding impact on the schedule. In addition, the graphical format lets the construction team to visualize the obstacles in the project when and where they occur due to a new feature called the Activity Performance Index (API). This index is used to shade the linear scheduling chart by time and location with the variation in color indicating the variance in predicted production rate from the desired production rate.

• ETRI Journal
• /
• v.30 no.1
• /
• pp.1-12
• /
• 2008

In this paper, we propose an efficient single-resource task scheduling algorithm for the Communication, Ocean, and Meteorological Satellite. Among general satellite planning functions such as constraint check, priority check, and task scheduling, this paper focuses on the task scheduling algorithm, which resolves conflict among tasks which have an exclusion relation and the same priority. The goal of the proposed task scheduling algorithm is to maximize the number of tasks that can be scheduled. The rationale of the algorithm is that a discarded task can be scheduled instead of a previously selected one depending on the expected benefit acquired by doing so. The evaluation results show that the proposed algorithm enhances the number of tasks that can be scheduled considerably.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.9
• /
• pp.3663-3679
• /
• 2020

Scheduling plays a dynamic role in cloud computing in generating as well as in efficient distribution of the resources of each task. The principle goal of scheduling is to limit resource starvation and to guarantee fairness among the parties using the resources. The demand for resources fluctuates dynamically hence the prearranging of resources is a challenging task. Many task-scheduling approaches have been used in the cloud-computing environment. Security in cloud computing environment is one of the core issue in distributed computing. We have designed a deep learning-based security model for scheduling tasks in cloud computing and it has been implemented using CloudSim 3.0 simulator written in Java and verification of the results from different perspectives, such as response time with and without security factors, makespan, cost, CPU utilization, I/O utilization, Memory utilization, and execution time is compared with Round Robin (RR) and Waited Round Robin (WRR) algorithms.

• The KSFM Journal of Fluid Machinery
• /
• v.15 no.2
• /
• pp.36-40
• /
• 2012

Pitch control of wind turbine is activated above rated wind speed for the purpose of rated power regulation. When we design pitch controller, its gain-scheduling is essential due to nonlinear characteristics of aerodynamic torque. In this study, 2-mass model including a vibration mode of drive-train for a 2 MW wind turbine is considered and pitch control with gain-scheduling using a linearization analysis of the nonlinear aerodynamic torque is applied. Some simulation results for the pitch gain-scheduling under step wind speed are presented and investigated. It is shown that gain-scheduling in pitch control is important especially in the region of high wind speeds when there exists a vibration mode of drive-train.

• ETRI Journal
• /
• v.36 no.1
• /
• pp.69-79
• /
• 2014

The scheduling scheme in packet switching networks is one of the most critical features that can affect the performance of the network. Hence, many scheduling algorithms have been suggested and some indices, such as fairness and latency, have been proposed for the comparison of their performances. While the nature of Internet traffic is bursty, traditional scheduling algorithms try to smooth the traffic and serve the users based on this smoothed traffic. As a result, the fairness index mainly considers this smoothed traffic and the service rate as the main parameter to differentiate among different sessions or flows. This work uses burstiness as a differentiating factor to evaluate scheduling algorithms proposed in the literature. To achieve this goal, a new index that evaluates the performance of a scheduler with bursty traffic is introduced. Additionally, this paper introduces a new scheduler that not only uses arrival rates but also considers burstiness parameters in its scheduling algorithms.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.4
• /
• pp.153-158
• /
• 2010

This study presents a single machine scheduling algorithm to minimize total cost(lateness cost, earliness cost and failure cost) by controlling machining speed. Generally, production scheduling uses the information of process planning and machining speed is not changed at production scheduling. And failure cost is not consider for scheduling algorithm. Therefore, the purpose of this study is to consider the change of machining speed for efficient production scheduling. And performance criteria for algorithm considers total cost. Especially, failure cost of product by increasing machining speed is considered.

• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.3
• /
• pp.12-18
• /
• 2003

A web crawler is used widely in a variety of Internet applications such as search engines. As the Internet continues to grow, high performance web crawlers become more essential. Crawl scheduling which manages the allocation of web pages to each process for downloading documents is one of the important issues. In this paper, we identify issues that are important and challenging in the crawl scheduling. To address the issues, we propose a dynamic owl scheduling framework and subsequently a system architecture for a web crawler subject to the framework. This paper presents the architecture of a web crawler with dynamic scheduling support. The result of our preliminary performance evaluation made to the proposed crawler architecture is also presented.

• Journal of Korean Institute of Industrial Engineers
• /
• v.12 no.1
• /
• pp.19-30
• /
• 1986

This paper provides an evaluation of static flowshop scheduling heuristics for minimizing makespan as an objective function in the dynamic flowshop model, in which new jobs with stochastic processing times arrive at the shop randomly over time and are added into the waiting jobs for processing. A total of sixteen scheduling heuristics, including several revisions and combinations of previously reported me-sixteen scheduling heuristics, including several revisions and combinations of previously reported methods, are surmmarized. These scheduling rules are evaluated via computer using a SLAM discrete event simulation model. The results for the simulation are analyzed using both statistical and nonstatistical methods. The results from the study suggest which of the popular scheduling rules hold promise for application to practical dynamic flowshop problems.

• IE interfaces
• /
• v.14 no.3
• /
• pp.218-226
• /
• 2001

Scheduling for shipbuilding processes has many alternative solutions since it has long time horizon and handles many jobs. This requests the scheduling system to generate and search feasible alternative solutions in short period of time. Among shipbuilding schedules, the ship erection schedule in a dock is the most important since the dock is the most critical resource in shipyard. In this research, we model the erection scheduling problem for shipbuilding and develop a new problem solving method using CST(Constraint Satisfaction Technique) and ILOG Scheduler. Experimental results show that the proposed scheduling method outperforms the existing manual scheduling methods in terms of schedule performance and required time.

• Korean Management Science Review
• /
• v.23 no.2
• /
• pp.187-198
• /
• 2006

Efficient scheduling for software development is a major concern for software engineers. Industries simultaneously try to perform a variety of projects with the limited resources on schedule. A way to overcome the limitation of resources is sharing of the resources through the projects. This study discusses the matrix organization for software development. A scheduling for matrix organization is a special case of project management problem. The ultimate goal of scheduling problem in this study is to minimize the overall duration of the multiple projects. A genetic algorithm is presented to solve the scheduling problem of the matrix organization and is substantiated with numerical results.