• Proceedings of the Korea Society for Simulation Conference
• /
• 2005.05a
• /
• pp.29-33
• /
• 2005

Grid computing is widely applicable to various fields of industry including process control and manufacturing, military command and control, transportation management, and so on. In a viewpoint of application area, grid computing can be classified to three aspects that are computational grid, data grid and access grid. This paper focuses on computational grid which handles complex and large-scale computing problems. Computational grid is characterized by system dynamics which handles a variety of processors and jobs on continuous time. To solve problems of system complexity and reliability due to complex system dynamics, computational grid needs scheduling policies that allocate various jobs to proper processors and decide processing orders of allocated jobs. This paper proposes the service prediction-based job scheduling model and present its algorithm that is applicable for computational grid. The service prediction-based job scheduling model can minimize overall system execution time since the model predicts a processing time of each processing component and distributes a job to processing component with minimum processing time. This paper implements the job scheduling model on the DEVSJAVA modeling and simulation environment and simulates with a case study to evaluate its efficiency and reliability Empirical results, which are compared to the conventional scheduling policies such as the random scheduling and the round-robin scheduling, show the usefulness of service prediction-based job scheduling.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2369-2373
• /
• 2001

Usually the static scheduling algorithms such as DMS (Deadline Monotonic Scheduling) or RMS(Rate Monotonic Scheduling) are used for CAN scheduling due to its ease with implementation. However, due to their inherently low utilization of network media, some dynamic scheduling approaches have been studied to enhance the utilization. In case of dynamic scheduling algorithms, two considerations are needed. The one is a priority inversion due to rough deadline encoding into stricted arbitration fields of CAN. The other is an arbitration delay due to the non-preemptive feature of CAN. In this paper, an extended algorithm is proposed from an existing EDS(Earliest Deadline Scheduling) approach of CAN scheduling algorithm haying a solution to the priority inversion. In the proposed algorithm, the available bandwidth of network media can be checked dynamically by all nodes. Through the algorithm, arbitration delay causing the miss of their deadline can be avoided in advance. Also non real-time messages can be processed with their bandwidth allocation. The proposed algorithm can achieve full network utilization and enhance aperiodic responsiveness, still guaranteeing the transmission of periodic messages.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.30 no.4D
• /
• pp.413-421
• /
• 2010

Scheduling management is one of the most important factors for the efficient performance of construction projects. Various computer-aided solutions for schedule management have been developed, but they are not commonly used in practice. This study conducted surveys on scheduling management methods and the related solutions to identify their status and problems in practice. Based on the results of the surveys, this study also developed a scheduling assistant program to improve the usability of scheduling management solutions. Through the developed program, the usability of scheduling management solutions will be improved in practice, thus enabling efficient scheduling management.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.758-759
• /
• 1995

In large-scale industry such as shipbuilding, aircraft manufacturing, and construction industry etc., it is required to consider two or three-dimensional spatial availability as one of bottlenecked resource constraints. We call this kind of scheduling a spatial scheduling, which considers the dynamic spatial layouts of objects as well as the traditional resource constraints. Since 1991, we have researched on the spatial scheduling for shipbuilding plant (Lee & Lee, 1992; Lee et al., 1994, Lee et al., 1995). In this paper, we present the various issues of spatial scheduling for the researchers and developers attacking spatial scheduling problems.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.482-487
• /
• 1991

The scheduling algorithm based on the hierarchical scheduling policy is presented for the Job Shop type FMC control, and the simulation results using this hierarchical scheduling policy are with the results which are based on the heuristic scheduling policy. The results show that the hierarchical ling policy is more efficient than the heuristic scheduling policy in either case that there exist machine failures in the FMC or not.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.370-375
• /
• 1992

This paper deals with the scheduling and simulation for FMC(Flexible Manufacturing Cells). In order to achieve CIM, there is a critical need to link factory level and machine level. The primary functions performed by this link for all jobs issued to the shop floor and cell include short-term scheduling and dynamic operational scheduling. Here, hierarchical control structure is introduced to define these functions. And Intelligent scheduling through expert module is adopted for efficiency of FMC operation. Computer simulation reveals that expert scheduling method is better than heuristics in various performance index.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.4 no.4
• /
• pp.1-13
• /
• 1981

This paper analyses the efficiency of performance measures from the point of total cost on the accuracy of due date around various measures of performance be in mainly use in the flow shop scheduling theory. For this purpose, complete enumeration method for small problems seems to be the only possible means of evaluation and analysis. Using of the above technique, calculates the 800 Scheduling Problems, and represents it by the cumulative distributions.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.39-41
• /
• 2004

In this paper, I propose a thread scheduling policy for faster packet processing on the network processors with multithreaded multiprocessor architecture. To implement the proposed policy, I derived several basic parameters related to the thread scheduling and included a new parameter representing the packet contents and the features of the multithreaded architecture. Through the empirical study using a network processor, I proved the proposed scheduling ploicy provides better throughput and load balancing compared to the generally used thread scheduling policy.

• Journal of the military operations research society of Korea
• /
• v.31 no.2
• /
• pp.60-74
• /
• 2005

The main purpose of this study is to develop an watch duty scheduling focused on Korea Navy Ship, PCC class, in port. The watch duty scheduling is a type of a scheduling problem which both considers the readiness of the ship and fair duty for each person. In this study, we analyzed the personal ability and military occupational speciality and developed a manpower scheduling by using heuristic. We find an efficient and effective watch duty schedule which improved results.

• IE interfaces
• /
• v.12 no.3
• /
• pp.362-373
• /
• 1999

Resource Constrained Dynamic Multi-Projects Scheduling (RCDMPS) is intended to schedule activities of two or more projects sequentially arriving at die shop under restricted resources. The aim of this paper is to develop a new problem solving method for RCDMPS to make an effect schedule based by constraint programming. The constraint-based scheduling method employs ILOG Solver which is C++ constraint reasoning library for solving complex resource management problems and ILOG Schedule which is a add-on library to ILOG Solver dedicated to solving scheduling problems. And this method interfaces with ILOG Views so that the result of scheduling displays with Gantt chart. The scheduling method suggested in this paper was applied to a company scheduling problem and compared with the other heuristic methods, and then it shows that the new scheduling system has more preference.