• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.2
• /
• pp.97-104
• /
• 2013

This paper introduces waiting time based periodic packet discard policy for frame based scheduler. This policy can be used with conventional packet discard policy or buffer management schemes, such as drop-tail or random early detection. Proposed discard policy discards packets, which are stayed in the buffer longer than threshold, at every period of scheduling. This decision of discard is based on waiting time of packet. In this paper, mathematical analysis is performed with situation of network congestion. Also, the simulation is performed to evaluate the performance of proposed discard policy. In the result, proposed discard policy can limit queuing delay by threshold. Also, if the packet discard is performed before scheduling and threshold is set with smaller value than frame length, it can limit the throughput of traffic.

• Journal of Navigation and Port Research
• /
• v.29 no.3 s.99
• /
• pp.221-226
• /
• 2005

This paper provides a method to implement IT system for supply chain management problem The fundamental scheduling issues that arise in the pickup delivery system are optimizing the system with the minimum cost, the maximum throughput and the service level. This study is concerned with the development of the customer responsive pickup-delivery system based on e-logistics and demand chain management. Through this study, the pickup-delivery problem of the vehicle using the GIS PDP and GUI- type computer programs are formulated. The computational results show that the proposed method is very effective on a set of test problems.

• Industrial Engineering and Management Systems
• /
• v.7 no.2
• /
• pp.171-181
• /
• 2008

Home care, known also as domiciliary care, is part of the community care service that is a responsibility of the local government authorities in the UK as well as many other countries around the world. The aim is to provide the care and support needed to assist people, particularly older people, people with physical or learning disabilities and people who need assistance due to illness to live as independently as possible in their own homes. It is performed primarily by care workers visiting clients' homes where they provide help with daily activities. This paper is concerned with the dispatching of care workers to clients in an efficient manner. The optimized routine for each care worker determines a schedule to achieve the minimum total cost (in terms of distance traveled) without violating the capacity and time window constraints. A collaborative population-based meta-heuristic called Particle Swarm Optimization (PSO) is applied to solve the problem. A particle is defined as a multi-dimensional point in space which represents the corresponding schedule for care workers and their clients. Each dimension of a particle represents a care activity and the corresponding, allocated care worker. The continuous position value of each dimension determines the care worker to be assigned and also the assignment priority. A heuristic assignment scheme is specially designed to transform the continuous position value to the discrete job schedule. This job schedule represents the potential feasible solution to the problem. The Earliest Start Time Priority with Minimum Distance Assignment (ESTPMDA) technique is developed for generating an initial solution which guides the search direction of the particle. Local improvement procedures (LIP), insertion and swap, are embedded in the PSO algorithm in order to further improve the quality of the solution. The proposed methodology is implemented, tested, and compared with existing solutions for some 'real' problem instances.

• Korean Management Science Review
• /
• v.32 no.4
• /
• pp.109-133
• /
• 2015

This paper considers the allocation and engagement scheduling of air defense missiles by using MIP (mixed integer programming). Specifically, it focuses on developing a realistic MIP model for a real battle situation where multiple enemy missiles are headed toward valuable defended assets and there exist multiple air defense missiles to counteract the threats. In addition to the conventional objective such as the minimization of surviving target value, the maximization of total intercept altitude is introduced as a new objective. The intercept altitude of incoming missiles is important in order to minimize damages from debris of the intercepted missiles and moreover it can be critical if the enemy warhead contains an atomic or chemical bomb. The concept of so called the time window is used to model the engagement situation and a continuous time is assumed for flying times of the both missiles. Lastly, the model is extended to simulate the situation where the guidance radar, which guides a defense missile to its target, has the maximum guidance capacity. The initial mathematical model developed contains several non-linear constraints and a non-linear objective function. Hence, the linearization of those terms is performed before it is solved by a commercially available software. Then to thoroughly examine the MIP model, the model is empirically evaluated with several test problems. Specifically, the models with different objective functions are compared and several battle scenarios are generated to evaluate performance of the models including the extended one. The results indicate that the new model consistently presents better and more realistic results than the compared models.

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

A common control model used to implement computer integrated manufacturing(CIM) is based on the hierarchical decomposition of the shop floor activities, in which supervisory controllers are responsible for all the interactions among subordinates. Although the hierarchical control philosophy provides for easy understanding of complex systems, an emerging manufacturing paradigm, agile manufacturing, requires a new control structure necessary to accommodate the rapid development of a shop floor controller. This is what is called CSCW(computer supported cooperative work)-based control or component-based heterarchical control. As computing resources and communication network on the shop floor become increasingly intelligent and powerful, the new control architecture is about to come true in a modern CIM system. In this paper, CSCW-based control is adopted and investigated, in which a controller for a unit of device performs 3 main functions - planning, scheduling and execution. In this paper, attention is paid to a planning function and all the detailed planning activities for CSCW-based shop floor control are identified. Interactions with other functions are also addressed. Generally speaking, planning determines tasks to be scheduled in the future. In other words, planning analyzes process plans and transforms process plans into detailed plans adequate for shop floor control. Planning is also responsible for updating the process plan and identifying/resolving replanning activities whether they come from scheduling or execution.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.1
• /
• pp.41-41
• /
• 1992

In the real world situations that some jobs need be processed only on certain limited machines frequently occur due to the capacity restrictions of machines such as tools fixtures or material handling equipment. In this paper we consider n-job non-preemptive and m parallel machines scheduling problem having two machines group. The objective function is to minimize the sum of earliness and tardiness with different release times and due dates. The problem is formulated as a mixed integer programming problem. The problem is proved to be Np-complete. Thus a heuristic is developed to solve this problem. To illustrate its suitability and efficiency a proposed heuristic is compared with a genetic algorithm and tabu search for a large number of randomly generated test problems in ship engine assembly shop. Through the experimental results it is showed that the proposed algorithm yields good solutions efficiently.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.484-503
• /
• 2016

Mobile cloud computing has recently become a new paradigm for the utilization of a variety of shared mobile resources via wireless network environments. However, due to the inherent characteristics of mobile devices, a limited battery life, and a network access requirement, it is necessary for mobile servers to provide a dynamic approach for managing mobile resources efficiently in mobile cloud computing environments. Since on-demand job requests occur frequently and the number of mobile devices is drastically increased in mobile cloud computing environments, a different mobile resource management method is required to maximize the computational power. In this paper, we therefore propose a cooperative, mobile resource sharing method that considers both the inherent properties and the number of mobile devices in mobile cloud environments. The proposed method is composed of four main components: mobile resource monitor, job handler, resource handler, and results consolidator. In contrast with conventional mobile cloud computing, each mobile device under the proposed method can be either a service consumer or a service provider in the cloud. Even though each device is resource-poor when a job is processed independently, the computational power is dramatically increased under the proposed method, as the devices cooperate simultaneously for a job. Therefore, the mobile computing power throughput is dynamically increased, while the computation time for a given job is reduced. We conduct case-based experiments to validate the proposed method, whereby the feasibility of the method for the purpose of cooperative computation is shown.

• Korean Journal of Construction Engineering and Management
• /
• v.10 no.2
• /
• pp.26-33
• /
• 2009

The required level of detail in scheduling depends on the stages in the construction life-cycle. The objective of this study is to provide a Standardized Schedule Model (SSM) with an aim to facilitate the estimating of construction duration in the planning stage. The SSM modularizes work items; establishes relations between preceding and succeeding activities; and calculates approximate construction duration. The estimated duration of the SSM was compared with the detailed duration from the commercial scheduling tool using actual work activities. The difference showed to be ranged between -3.1% and +15%, which demonstrates that the SSM can be feasibly applied to the approximate estimation of construction duration.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.1 s.33
• /
• pp.113-124
• /
• 2005

The work of investigation in the laboratory medicine includes various kinds of investigations and microbes and it is too complicated to draw needed results in time. So, we aim to improve work performance of the laboratory medicine. For this study, we implemented the scheduling system in microbe investigation using agent environment and the workflow management system to manage the schedule of investigation, and the query system to check the schedule. And preliminary report and final report of microbe investigation can be announced automatically using agent. The scheduling system implemented could identify the lack or waste of resources and thus enable efficient management and distribution of resources. The query system could check the schedule and retrieve the Processing status in short time, enabled the automated report, and reduced possible interrupts and the delay of work that can be occurred in confirming process. It also enables users to access from local and remote sites. Also, this system can reduce the conflicts among People that may occur in unexpected situations because it enables doctors to confirm those situations such as the malfunction of instrument and the lack of agar or reagent, and the efficiency of work process can be expected.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.1
• /
• pp.78-85
• /
• 2008

Most researches for power management have focused on increasing the utilization of system performance by scaling operating frequency or operating voltage. If operating frequency is changed frequently, it reduces the real system performance. To reduce power consumption, alternative approaches use the limited number of operating frequencies or set the smoothing frequencies during execution to increase the system performance, but they are not suitable for real time applications. To reduce power consumption and increase system performance for real time applications, this paper proposes a new power-aware schedule method by allocating operating frequencies and by setting smoothing frequencies. The algorithm predicts so that frequencies with continuous interval are mapped into discrete operating frequencies. The frequency smoothing reduces overheads of systems caused by changing operating frequencies frequently as well as power consumption caused by the frequency mismatch at a wide frequency interval. The simulation results show that the proposed algorithm reduces the power consumption up to 40% at maximum and 15% on average compared to the CC RT-DVS.