• Journal of Korean Institute of Industrial Engineers
• /
• v.14 no.2
• /
• pp.53-61
• /
• 1988

Games such as baseball, soccer are scheduled by a given game type such as tournament, league or their mixed form. The objective of this paper is to find an efficient game-scheduling method with respect to traveling distance, break-time and other conditions. In this paper we first present two models which minimize traveling distance. The first model that a match is played once each other is solved by a heuristic method. In the second model that a match is played more than once, teams are paired by a modified 0 - 1 programming, and the pairs are rearranged in order to generate a number of workable schedules. Then Expert Systems is applied to solve breake-time and other conditions. In order to represent expertise's knowledge effectively, we present a new design of knowledge-base and data-base, inference engine including many rules and meta-rules which controls the global system. In knowledge-base, binary relation among various attributes is used to ease not only knowledge acquisition but also system execution.

• The Journal of Society for e-Business Studies
• /
• v.24 no.3
• /
• pp.99-110
• /
• 2019

As the 4th industrial revolution progressing, manufacturers are trying to apply intelligent information technologies such as IoT(internet of things) and machine learning. In the semiconductor/LCD/tire manufacturing process, schedule plan that minimizes setup change and due date violation is very important in order to ensure efficient production. Therefore, in this paper, we suggest the deep learning based scheduling generation model minimizes setup change and due date violation in parallel machines. The proposed model learns patterns of minimizing setup change and due date violation depending on considered order using the amount of historical data. Therefore, the experiment results using three dataset depending on levels of the order list, the proposed model outperforms compared to priority rules.

• Journal of the Korea Society for Simulation
• /
• v.18 no.2
• /
• pp.29-38
• /
• 2009

In the computing environment with heterogeneous resources, a job scheduling model is necessary for effective resource utilization and high-speed data processing. And, the job scheduling model has to cope with a dynamic change in the condition of resources. There have been lots of researches on resource estimation methods and heuristic algorithms about how to distribute and allocate jobs to heterogeneous resources. But, existing researches have a weakness for system compatibility and scalability because they do not support the standard language. Also, they are impossible to process jobs effectively and deal with a variety of computing situations in which the condition of resources is dynamically changed in real-time. In order to solve the problems of existing researches, this paper proposes a semantic computing-based dynamic job scheduling model that defines various knowledge-based rules for job scheduling methods adaptable to changes in resource condition and allocate a job to the best suited resource through inference. This paper also constructs a resource ontology to manage information about heterogeneous resources without difficulty as using the OWL, the standard ontology language established by W3C. Experimental results shows that the proposed scheduling model outperforms existing scheduling models, in terms of throughput, job loss, and turn around time.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.9
• /
• pp.405-412
• /
• 2013

Current web has evolved to a mashed-up format according to the change of the implementation and usage patterns. Web services and user experiences have improved, however, security threats are also increased as the web contents that are not yet verified combine together. To mitigate the threats incurred as an adverse effect of the web development, we need to check security on the combined web contents. In this paper, we propose a scheduling method to detect malicious web pages not only inside but also outside through extended links for secure operation of a web site. The scheduling method considers several aspects of each page including connection popularity, suspiciousness, and check elapse time to make a decision on the order for security check on numerous web pages connected with links. We verified the effectiveness of the security check complying with the scheduling method that uses the priority given to each page.

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.447-453
• /
• 2001

In this paper, we consider the scheduling of SE(switching element)-disjoint multicasting in photonic Banyan-type switching networks constructed with directional couplers. This ensures that at most, one connection holds each SE in a given time thus, neither crosstalk nor blocking will arise in the network. Such multicasting usually takes several routing rounds hence, it is desirable to keep the number of rounds(i.e., scheduling length) to a minimum. We first present the necessary and sufficient condition for connections to pass through a common SE(i.e., make crosstalk) in the photonic Banyan-type networks capable of supporting one-to-many connections. With definition of uniquely splitting a multicast connection into distinct subconnections, the crosstalk relationship of a set of connections is represented by a graph model. In order to analyze the worst case crosstalk we characterize the upper bound on the degree of the graph. The successor paper(Part II)[14] is devoted to the scheduling algorithm and the upper bound on the scheduling length. Comparison with related results is made in detail.

• Spatial Information Research
• /
• v.9 no.1
• /
• pp.15-30
• /
• 2001

Solid waste collection service is viewed as one of the most important public services in urban area. The purpose of this study is to apply the GIS based regional partitioning and arc routing methods for solid waste collection districting and vehicle routing-scheduling in order to provide waste collection service more efficiently. In this study, solid waste deposit sites are derived from the centroid of each building and the amount of solid waste is deduced based on the number of households and establishments. The regional partitioning procedure is performed based on waste collection zones which are constructed from waste deposit sites. The result of this study shows that solid waste collection districts which are delineated by regional partitioning method are able to increase efficiencies and cut costs in performing solid waste collection services. Also the output of vehicle-scheduling from the analysis of arc routing may provide more efficiently and quickly manage the scheduling of the residential solid waste collection routes, reducing costs with minimal deadheading costs. Therefore, the application of GIS based on regional partitioning and arc routing methods would be very useful to construct a solid waste management system by supplying the important and flexible informations for solid waste collection districts and vehicle routing-scheduling for waste collection.

• Journal of Korea Multimedia Society
• /
• v.16 no.4
• /
• pp.493-501
• /
• 2013

A key challenge in massively multiplayer on-line game(MMOG) systems is providing real-time response latencies to the large number of concurrent game players. MMOG systems are a kind of soft real-time systems because requests from many players should be responded within specified time constraints. Client events have different timeliness and consistency requirements according to their nature in the game world. These requirements lead to tasks with different priorities on CPU processing. In order to meet their timing constraints, we propose priority scheduling methods that attempt to allocate preferentially more CPU bandwidth to serve an task with the higher priority level in the presence of transient overloading. The proposed scheduling methods are capable of enhancing real-time performance of MMOG system by maximizing the number of tasks with higher priority completed successfully within their deadlines while minimizing total average latency of tasks finished after given deadlines. The performance of these scheduling methods is evaluated through extensive simulation experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4103-4121
• /
• 2018

Quality of Service (QoS) awareness is recognized as a key point for the success of Internet of Things (IOT).Realizing the full potential of the Internet of Things requires, a real-time task scheduling algorithm must be designed to meet the QoS need. In order to schedule tasks with diverse QoS requirements in cloud environment efficiently, we propose a task scheduling strategy based on dynamic priority and load balancing (DPLB) in this paper. The dynamic priority consisted of task value density and the urgency of the task execution, the priority is increased over time to insure that each task can be implemented in time. The scheduling decision variable is composed of time attractiveness considered earliest completion time (ECT) and load brightness considered load status information which by obtain from each virtual machine by topic-based publish/subscribe mechanism. Then sorting tasks by priority and first schedule the task with highest priority to the virtual machine in feasible VMs group which satisfy the QoS requirements of task with maximal. Finally, after this patch tasks are scheduled over, the task migration manager will start work to reduce the load balancing degree.The experimental results show that, compared with the Min-Min, Max-Min, WRR, GAs, and HBB-LB algorithm, the DPLB is more effective, it reduces the Makespan, balances the load of VMs, augments the success completed ratio of tasks before deadline and raises the profit of cloud service per second.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.1
• /
• pp.3-8
• /
• 2016

Wireless networks have evolved to the appearance of heterogeneous wireless networks(HetNet), where various networks provide data services with various data rates and coverage. One of technical issues for HetNet is efficient utilization of radio resources for system performance enhancement. For the next generation wireless networks, energy saving has become one of key performance indices, so energy-efficient resource management schemes for HetNet need to be developed. This paper addresses an energy-efficient scheduling for HetNet in order to improve the energy efficiency while maintaining similar system throughput as existing scheme, for which an energy-efficient scheduling that energy efficiency factor is included. Simulation results show that the proposed scheme achieves the reduction of energy consumption while admitting limited ragne of throughput degradation in comparison with the conventional proportional fair scheduling.

• Journal of Korea Game Society
• /
• v.16 no.4
• /
• pp.57-68
• /
• 2016

As the size of the data used in the game application increase gradually, the physical resources of game server grow. Accordingly, it is necessary to/it is required to introduce I/O virtualization in game server to improve I/O performance of the server. But it is difficult to ensure high responsiveness in game server where I/O delay change from time to time. To maximize the benefit of I/O virtualization, guaranteeing I/O response time is very important and it is necessary to have I/O scheduling techniques to manage the I/O latency in the order of priority of virtual machines. In this paper, we propose an efficient delay-constrained scheduling algorithm in a virtualization environment to ensure maximum I/O latency. In addition, a reduced amount of loss of the packet was found to increase the fairness of scheduling in the experiments with the proposed scheme.