• Journal of Multimedia Information System
• /
• v.3 no.4
• /
• pp.149-154
• /
• 2016

Wireless mesh networks (WMNs) are used for metropolitan area network that requires high network throughput for handling many users. TDMA-based access is a common solution for this problem and several scheduling methods have been proposed. However, existing heuristic methods have room for improvement at network throughput although they are low complexity. In this paper, we propose a novel divided scheduling method based on structural characteristics in order to improve network throughput in WMNs. It separately schedules neighbor links of gateways and that of the other links by different scheduling algorithms. Simulation-based evaluations show that our proposal improves up to 14% of network throughput compared with conventional scheduling algorithm script.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.25 no.4
• /
• pp.8-15
• /
• 2002

This paper proposes a case study to treat planning and scheduling in factory of supply chain. In fact, the planning and the scheduling of a factory are not easily solved because of constraints of facility resources, material requirements, allowed planning times, and so on. However many packages are developed by vendors in Advanced Planning and Scheduling(APS) aspects to solve these problems. Therefore, in this paper, we analyze problems of an electronic company and apply the tool, Factory Planner(FP), to solve problems. The FP, which was developed by if technologies, is very popular planning and scheduling tool in the world. Also, the tool is successfully applied to many fields.

• Journal of Korean Society for Quality Management
• /
• v.23 no.3
• /
• pp.156-166
• /
• 1995

Job shop scheduling problem is a complex system and an NP-hard problem. Thus it is natural to look for heuristic method. We consider the multi-part production scheduling problem for quality level in a job shop scheduling under the existence of alternative routings. The problem is more complex if the processing time is imprecision. It requires suitable method to deal with imprecision. Fuzzy set theory can be useful in modeling and solving scheduling problems with uncertain processing times. Li-Lee fuzzy number comparison method will be used to compare processing times that evaluated under fuzziness. This study presents heuristic method for quality level in bottleneck-based job shop scheduling under fuzzy environment. On the basis of the proposed method, an example is presented.

• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.6
• /
• pp.811-821
• /
• 1998

A new scheduling algorithm for large scale semiconductor processes is addressed. The difficulties of scheduling for semiconductor fabrication processes are mainly due from repeating production of wafers that experience reentrant flows. Sequence branch algorithm (SBA) is proposed for large real scheduling problems when all processing times are deterministic. The SBA is based on the reachability graph of Petri net of which the several defects such as memory consumption and system deadlock are complemented. Though the SBA shows the solution deviating a little from the optimal solution of mixed integer programming, it is adjustable for large size scheduling problems. Especially, it shows a potential that is capable of handling commercial size problems that are intractable with mathematical programming.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.3
• /
• pp.318-327
• /
• 2008

This paper considers a single-machine scheduling problem with availability constraints. In many realistic situations, machines may not be always available due to various reasons such as maintenance, breakdown and repair. However, most literature on scheduling assume that the machines are available at all times. This paper deals with a single-machine scheduling problem with periodic maintenance. If the maintenance decision is made jointly with the job scheduling, the system will be more effective. The objective is to minimize the total completion time of jobs. This problem is proved to be NP-hard in the strong sense. The proposed breaking heuristic(BH) algorithm rule is established by some theorems and conditions. Our computational results show that the BH algorithm is much more efficient than existing heuristic.

• Journal of Computing Science and Engineering
• /
• v.7 no.1
• /
• pp.44-52
• /
• 2013

This paper addresses the problem of resource scheduling in a grid computing environment. One of the main goals of grid computing is to share system resources among geographically dispersed users, and schedule resource requests in an efficient manner. Grid computing resources are distributed, heterogeneous, dynamic, and autonomous, which makes resource scheduling a complex problem. This paper proposes a new approach to resource scheduling in grid computing environments, the hierarchical stochastic Petri net (HSPN). The HSPN optimizes grid resource sharing, by categorizing resource requests in three layers, where each layer has special functions for receiving subtasks from, and delivering data to, the layer above or below. We compare the HSPN performance with the Min-min and Max-min resource scheduling algorithms. Our results show that the HSPN performs better than Max-min, but slightly underperforms Min-min.

• Journal of Computing Science and Engineering
• /
• v.7 no.1
• /
• pp.30-43
• /
• 2013

Multicore and multiprocessor systems with dynamic voltage scaling architectures are being used as one of the solutions to satisfy the growing needs of high performance applications with low power constraints. An important aspect that has propelled this solution is effective task/application scheduling and mapping algorithms for multiprocessor systems. This work proposes an energy aware, offline, probability-based unified scheduling and mapping algorithm for multiprocessor systems, to minimize the number of processors used, maximize the utilization of the processors, and optimize the energy consumption of the multiprocessor system. The proposed algorithm is implemented, simulated and evaluated with synthetic task graphs, and compared with classical scheduling algorithms for the number of processors required, utilization of processors, and energy consumed by the processors for execution of the application task graphs.

• The KIPS Transactions:PartA
• /
• v.13A no.5 s.102
• /
• pp.381-386
• /
• 2006

In this paper, we designed and implemented a web-based grid scheduling platform(WGridSP), which can model a system and simulate scheduling scheme in grid computing. WGridSP used GridSim, a grid scheduling toolkit in java-environment, as a tool for simulation and is able to Perform resource modeling, task modeling, algorithm compiling, simulation, and Performance evaluation rapidly in web environment. WGridSP can be applied as a foundation for grid research and can be used to analyze the efficiency of scheduling algorithm.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.1
• /
• pp.33-40
• /
• 2008

This paper presents a new scheduling scheme in wireless distributed network. To overcome the limited information about unfamiliar mobile nodes and to reduce the required system performance, we propose a scheduling algorithm of job allocation based on the trust model. The suggested scheduler evaluate an unfamiliar mobile node's trust and make reference to the trust value of neighboring scheduler. This scheduling algorithm can avoid malicious or selfish mobile nodes by assigning low trust values. We also present a trust evaluation metric and show the efficiency of suggested scheduling algorithm by performance evaluation.

• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.7
• /
• pp.574-581
• /
• 2001

In this paper we design and evaluate the longitudinal nonlinear N(aub)z-CSAS(Command and Stability Augmentation System) flight control law in \"DMI(Dynamic Model Inversion)-method\" and classical \"Gain Scheduling-method\", respectively, to meet the handling quality requirements associated with push-over pull-up maneuver. It is told that the flight control law designed in \"DM-method\" is adequate to the full flight regime without gain scheduling and is efficient to produce the time response shape desired to the handling quality requirements. On the contrary, the flight control law designed in \"Gain Scheduling-method\" is easy to be implemented in flight control computer and insensitive to variation of the actuator model characteristics.n of the actuator model characteristics.