• Journal of Communications and Networks
• /
• 제17권3호
• /
• pp.247-255
• /
• 2015

In this paper, we propose an adaptive time division multiple access based medium access control (MAC) protocol, called bitmap-assisted shortest job first based MAC (BS-MAC), for hierarchical wireless sensor networks (WSNs). The main contribution of BS-MAC is that: (a) It uses small size time slots. (b) The number of those time slots is more than the number of member nodes. (c) Shortest job first (SJF) algorithm to schedule time slots. (d) Short node address (1 byte) to identify members nodes. First two contributions of BS-MAC handle adaptive traffic loads of all members in an efficient manner. The SJF algorithm reduces node's job completion time and to minimize the average packet delay of nodes. The short node address reduces the control overhead and makes the proposed scheme an energy efficient. The simulation results verify that the proposed BS-MAC transmits more data with less delay and energy consumption compared to the existing MAC protocols.

• 산업경영시스템학회지
• /
• 제13권21호
• /
• pp.91-100
• /
• 1990

This paper is concerned with the development of optimal algorithms for multi-stage flowshop scheduling problems with sequence dependent setup times. In the previous researches the setup time of a job is considered to be able to begin at the earliest opportunity given a particular sequence at the start of operations. In this paper the setup time of a job is considered to be able to begin only at the completion of that job on the previous machine to reflect the effects of the setup time to the performance measure of sequence dependent setup time flowshop scheduling. The results of the study consist of two areas; first, a general integer programming(IP) model is formulated and a nixed integer linear programming(MILP) model is also formulated by introducing a new binary variable. Second a depth-first branch and bound algorithm is developed. To reduce the computational burdens we use the best heuristic schedule developed by Choi(1989) as the first trial. The experiments for developed algorithm are designed for a 4$\times$3$\times$3 factorial design with 360 observations. The experimental factors are PS(ratio of processing time to setup time), M(number of machines), N(number of jobs).

• 산업경영시스템학회지
• /
• 제32권1호
• /
• pp.72-78
• /
• 2009

This paper considers a multiagent scheduling problem under public information where a machine is shared by multiple agents. Each agent has a local objective among the minimization of total completion time and the minimization of maximum. In this problem, it is assumed that scheduling information is public. Therefore an agent can access to complete information of other agents and pursue efficient schedules in a centralized manner. We propose an enumeration scheme to find Pareto optimal schedules and a multiobjective genetic algorithm as a heuristic approach. Experimental results indicate that the proposed genetic algorithm yields close-to Pareto optimal solution under a variety of experimental conditions.

• 한국건설관리학회:학술대회논문집
• /
• 한국건설관리학회 2007년도 정기학술발표대회 논문집
• /
• pp.327-330
• /
• 2007

기존의 시뮬레이션 일정기법은 최종공사기간(Project Completion Times: PCTs)이 정규분포를 따른다는 가정을 전제로 한다. 그러나 본 논문에서는 이 가정이 항상 옳은 것이 아니며, 이것이 잘못된 결과를 초래할 수 있다는 것을 검증한다. 이처럼 의문이 제기되지 않고 받아들여져 온 가정이 시뮬레이션 분석 결과에 어떠한 영향을 줄 수 있는지를 밝혀내는 리키스 정량화기법(risk Quantification method)을 MATLAB 알고리즘으로 구현하였으며, 네트워크의 모델링에서부터 시뮬레이션 출력 값들로 구성된 샘플집단들에 대한 분석에 이르기까지 전 단계를 MATLAB 프로그래밍으로 구현된 알고리즘을 사용하여 제기된 의문에 대한 답을 제시하였다. 특정 네트워크를 구성하는 엑티비티 기간 값들을 정의하는 확률분포함수의 종류를 다양하게 변화시켜 시뮬레이션 결과 값들 - 최종공사기간 값들 - 을 생성하고, 이처럼 생성된 시뮬레이션 출력 값들로 구성된 샘플집단들의 확률 통계적 특성을 분석하였다. 본 연구는 시뮬레이션을 기반으로 하는 일정관리기법의 신뢰성을 향상시키며, 일정관련 리시크 분석의 정확성을 향상시키는데 기여할 것이다.

• 제어로봇시스템학회논문지
• /
• 제12권5호
• /
• pp.489-496
• /
• 2006

The random-based cleaning algorithm is a simple algorithm widely used in commercial vacuum cleaning robots. This algorithm has two limitations, that is, cleaning takes a long time and there is no guarantee that the cleaning will cover the whole cleaning area. This has lead to customer dissatisfaction. Thus, in recent years, many intelligent cleaning algorithms that takes into consideration information gathered from the cleaning area environment have been proposed. The plowing-based algorithm, which is the most efficient algorithm known to date when there are no obstacles in the cleaning area, has a deficiency that when obstacle prevail, its performance is not guaranteed. In this paper, we propose the Group-k algorithm that is efficient for that situation, that is, when obstacle prevail. The goal is not to complete the cleaning as soon as possible, but to clean the majority of the cleaning area as fast as possible. The motivation behind this is that areas close to obstacles are usually difficult for robots to handle, and hence, many require human assistance anyway In our approach, obstacles are grouped by the complexity of the obstacles, which we refer to as 'complex rank', and then decide the cleaning route based on this complex rank. Results from our simulation-based experiments show that although the cleaning completion time takes longer than the plowing-based algorithm, the Group-k algorithm cleans the majority of the cleaning area faster than the plowing algorithm.

• Management Science and Financial Engineering
• /
• 제5권1호
• /
• pp.1-25
• /
• 1999

There is a worldwide trend to automate the handling operations in port container terminals in an effort to improve productivity and reduce labor cost. This study iscusses how to apply an AGV(automated guided vehicle) system to the handling of containers in the yard of a port container ter-minal. The main issue of this paper is how to assign tasks of container delivery to AGVs during ship operations in an automated port container terminal. A dual-cycle operation is assumed in which the loading and the discharging operation can be performed alternately. Mixed integer linear program-ming formulations are suggested for the dispatching problem. The completion time of all the dis-charging and loading operations by a quayside crane is minimized, and the minimization of the total travel time of AGVs is also considered as a secondary objective. A heuristic method using useful properties of the dispatching problem is suggested to reduce the computational time. The perfor-mance of the heuristic algorithm is evaluated in light of solution quality and computation time.

• Management Science and Financial Engineering
• /
• 제20권2호
• /
• pp.33-37
• /
• 2014

A flow shop scheduling problem involves scheduling jobs on multiple machines in series in order to optimize a given criterion. The flow time of a job is the amount of time the job spent before its completion and the stretch of the job is the ratio of its flow time to its processing time. In this paper, a hybrid genetic algorithm (HGA) approach is proposed for minimizing the total stretch in flow shop scheduling. HGA adopts the idea of seed selection and development in order to reduce the chance of premature convergence that may cause the loss of search power. The performance of HGA is compared with that of genetic algorithms (GAs).

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
• /
• pp.506-516
• /
• 2005

This paper deals with an investment scheduling problem of maximizing net present value of dividend with reinvestment allowed, where each investment has certain capital requirement and generates deterministic profit. Such deterministic profit is calculated at completion of each investment and then allocated into two parts, including dividend and reinvestment, at each predetermined reinvestment time point. The objective is to make optimal scheduling of investments over a fixed planning horizon which maximizes total sum of the net present values of dividends subject to investment precedence relations and capital limit but with reinvestment allowed. In the analysis, the scheduling problem is transformed to a kind of parallel machine scheduling problem and formulated as an integer programming which is proven to be NP-complete. Thereupon, a depth-first branch-and-bound algorithm is derived. To test the effectiveness and efficiency of the derived algorithm, computational experiments are performed with some numerical instances. The experimental results show that the algorithm solves the problem relatively faster than the commercial software package (CPLEX 8.1), and optimally solves the instances with up to 30 investments within a reasonable time limit.

• 자동차안전학회지
• /
• 제16권2호
• /
• pp.20-26
• /
• 2024

The delivery using drones has been attracting attention because it can innovatively reduce the delivery time from the time of order to completion of delivery compared to the current delivery system, and there have been pilot projects conducted for safe drone delivery. However, the current drone delivery system has the disadvantage of limiting the operational efficiency offered by fully autonomous delivery drones in that drones mainly deliver goods to pre-set landing sites or delivery bases, and the final delivery is still made by humans. In this paper, to overcome these limitations, we propose obstacle detection and landing site selection algorithm based on a vision sensor that enables safe drone landing at the delivery location of the product orderer, and experimentally prove the possibility of station-to-door delivery. The proposed algorithm forms a 3D map of point cloud based on simultaneous localization and mapping (SLAM) technology and presents a grid segmentation technique, allowing drones to stably find a landing site even in places without prior information. We aims to verify the performance of the proposed algorithm through streaming data received from the drone.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권4호
• /
• pp.1501-1518
• /
• 2016

This paper presents an effective management of VM (Virtual Machine) for heterogeneous cloud using Common Deployment Model (CDM) brokering mechanism. The effective utilization of VM is achieved by means of task scheduling with VM placement technique. The placements of VM for the physical machine are analyzed with respect to execution time of the task. The idle time of the VMis utilized productively in order to improve the performance. The VMs are also scheduled to maintain the state of the current VM after the task completion. CDM based algorithm maintains two directories namely Active Directory (AD) and Passive Directory (PD). These directories maintain VM with proper configuration mapping of the physical machines to perform two operations namely VM migration and VM roll back. VM migration operation is performed from AD to PD whereas VM roll back operation is performed from PD to AD. The main objectives of the proposed algorithm is to manage the VM's idle time effectively and to maximize the utilization of resources at the data center. The VM placement and VM scheduling algorithms are analyzed in various dimensions of the cloud and the results are compared with iCanCloud model.