• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.59
• /
• pp.11-20
• /
• 2000

The Job Shop Scheduling Problem(JSSP) is one of the most general and difficult of all traditional scheduling problems. The goal of this research is to develop an efficient scheduling method based on single genetic algorithm(SGA) and parallel genetic algorithm (PGA) to address JSSP. In this scheduling method, new genetic operator, generating method of initial population are developed and island model PGA are proposed. The scheduling method based on PGA are tested on standard benchmark JSSP. The results were compared with SGA and another GA-based scheduling method. The PGA search the better solution or improves average of solution in benchmark JSSP. Compared to traditional GA, the proposed approach yields significant improvement at a solution.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.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.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.1
• /
• pp.87-95
• /
• 2004

We proposed the division algorithm that was aimed at dividing system models. It used a transitive matrix to express the relation between place and transition. And the division algorithm was applied to the scheduling problem, with the division-scheduling algorithm. The division-scheduling algorithm was able to calculate the divided subnet table. And it is able to reduce the analysis complexity. In this study, we applied the proposed division algorithm and division-scheduling algorithm to flexible manufacturing system models. We compared the efficiency and performance of the division-scheduling algorithm with the Hillion algorithm, Korbaa algorithm, and Unfolding algorithm proposed in previous researches.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2004.10a
• /
• pp.416-421
• /
• 2004

Off-line feedrate scheduling is presented as the advanced technology to regulate cutting forces at the desired level through change of feedrates. In rough cutting, the feedrate scheduling aims at reducing the machining time, which is the most important factor for better productivity. Thus, the largest force which can avoid breakage of tool shank and tooth is a reference force for feedrate scheduling in rough cutting. In this paper, a calculation method of the reference cutting force for feedrate scheduling is developed. This model calculates rupture plane of tooth using the FEM analysis of a tool and computes the reference force using the transverse rupture strength of a tool. Experiments validate that the presented feedrate scheduling model reduced machining time drastically and regulate cutting forces at the reference cutting force.

• International Journal of Contents
• /
• v.6 no.3
• /
• pp.19-24
• /
• 2010

Task scheduling is an integrated component of computing with the emergence of grid computing. In this paper, we address two different task scheduling models, which are static Round-Robin (RR) and dynamic Fastest Site First (FSF) task scheduling method, using extended timed marked graphs, which is a special case of Stochastic Petri Nets (SPN). Stochastic reward nets (SRN) is an extension of SPN and provides compact modeling facilities for system analysis. We build hierarchical SRN models to compare two task scheduling methods. The upper level model simulates task scheduling and the lower level model implements task serving process for different sites with multiple servers. We compare these two models and analyze their performances by giving reward measures in SRN.

• The KIPS Transactions:PartC
• /
• v.11C no.3
• /
• pp.337-344
• /
• 2004

In this paper, we propose a thread scheduling algorithm for faster packet processing on the network processors with multithreaded multiprocessor architecture. To implement the proposed algorithm. we derived several basic parameters related to the thread scheduling and included a new parameter representing the packet contents and the multithreaded architecture. Through the empirical study using a simulator, we proved the proposed scheduling algorithm provides better throughput and load balancing compared to the general thread scheduling algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5A
• /
• pp.574-582
• /
• 2004

This paper shows the performance comparisons of several different rate scheduling schemes for non-real time data service over the uplink of burst switching-based direct sequencecode division multiple access (DS/CDMA) system to support the integrated voice/data service. The closed-form solution of optimal scheduling formulation, which minimizes average transmission delay when all of the active data users are transmitting simultaneously, is presented and mathematical analyses with other rate scheduling schemes, which provide efficiency criterion of transmission delay for rate scheduling schemes, are performed. Numerical results show the analyses explicitly.

• Korean Journal of Community Nutrition
• /
• v.12 no.5
• /
• pp.630-638
• /
• 2007

The purpose of this study is to investigate an efficient use of labor in personnel scheduling for the restaurant industry. More specifically, this study attends to reduce overall labor cost while not sacrificing both full-time and part-time employees' schedules. The customers' demands were measured by sales in this analysis. Historically, server scheduling in the restaurant has been practiced by manager's experience and intuition; however, those practices provided drawbacks because managers often fail to consider external factors such as a employees' working conditions and change in a restaurant's size. The result of a new method in personnel scheduling provided significant cost saving compared to a previous scheduling technique. This study found that a new method in personnel scheduling allowed the restaurant to save labor cost. The outcome of this study should of for important strategic implication for the restaurant managers.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.29 no.11 s.242
• /
• pp.1463-1471
• /
• 2005

This paper proposes an agent-based scheduling method fur semiconductor wafer fabrication facilities with hard inter-operation temporal constraints. The scheduling problem is to find the feasible schedules that guarantee both logical and temporal correctness. A proposed multi-agent based architecture is composed of scheduling agents, workcell agents, and machine agents. A scheduling agent computes optimal schedules through bidding mechanisms with a subset or entire set of the workcell agents. A dynamic planning-based approach is adopted for the scheduling mechanism so that the dynamic behaviors such as aperiodic job arrivals and reconfiguration can be taken into consideration.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.944-948
• /
• 2002

In industrial production setting scheduling problems of detalied day-to-day operations are often ordeals to production practitioners. For those who have scheduling experience with the Gantt Chart, the job oriented heuristic scheduling has illustrated its merits in solving practically large stale scheduling problems. It schedules all operations of a job within a finite capacity before considering the next job. This paper introduces a new LSB (load smoothing backward) scheduling algorithm for the job oriented heuristic scheduling. Through the computer simulation in a hypothetical setting, this paper provides a comparison of LSB scheduling with existing algorithms and a guideline for selecting the suitable algorithm for certain industrial setting.