• Journal of applied mathematics & informatics
• /
• 제25권1_2호
• /
• pp.305-314
• /
• 2007

This paper considers single machine scheduling problems where the processing time of a job increases as a function of its position in the sequence. In this model, the later a given job is scheduled in the sequence, the longer its processing time. It is shown that the optimal schedule may be very different from that of the classical version of the problem. We introduce polynomial solutions for the makespan minimization problem, the sum of completion times minimization problem and the sum of earliness penalties minimization problem. For two resource constrained problems, based on the analysis of the problems, the optimal resource allocation methods are presented, respectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권12호
• /
• pp.5780-5802
• /
• 2017

Cloud computing system consists of distributed resources in a dynamic and decentralized environment. Therefore, using cloud computing resources efficiently and getting the maximum profits are still challenging problems to the cloud service providers and cloud service users. It is important to provide the efficient scheduling. To schedule cloud resources, numerous heuristic algorithms such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Ant Colony Optimization (ACO), Cuckoo Search (CS) algorithms have been adopted. The paper proposes a Modified Particle Swarm Optimization (MPSO) algorithm to solve the above mentioned issues. We first formulate an optimization problem and propose a Modified PSO optimization technique. The performance of MPSO was evaluated against PSO, and GA. Our experimental results show that the proposed MPSO minimizes the task execution time, and maximizes the resource utilization rate.

• 대한산업공학회지
• /
• 제37권4호
• /
• pp.408-414
• /
• 2011

The objective of this paper is to define local optimization algorithms (LOA) to solve Resource-Constrained Project Scheduling Problem (RCPSP) and analyze the performance of these algorithms. By representing solutions with activity list, three primitive LOAs, i.e. forward and backward improvement-based, exchange-based, and relocation-based LOAs are defined. Also, combined LOAs integrating two primitive LOAs are developed. From the experiments with standard test set J120 generated using ProGen, the FBI-based LOA demonstrates to be an efficient algorithm. Moreover, algorithms combined with FBI-based LOA and other LOA generate good solutions in general. Among the considered algorithms, the combined algorithm of FBI-based and exchangebased shows best performance in terms of solution quality and computation time.

• 한국건축시공학회:학술대회논문집
• /
• 한국건축시공학회 2018년도 춘계 학술논문 발표대회
• /
• pp.41-42
• /
• 2018

Various methods that crash the project completion time have been studied. Line-of-Balance (LOB) is well accepted as a useful method that enables steady resource utilization without frequent hire-and-fire of resources for a project having repetitive units. Existing studies involved in LOB-CPM focuses on thesis such as resource leveling and optimization in construction scheduling community. However, crashing methods are not arrived at a full maturity in LOB scheduling, because no one handles steady resource utilization while keeping activity-relationships. This paper proposes a method that crashes project completion time by hybridizing concurrent engineering and LOB scheduling without using additional resources.

• 산업경영시스템학회지
• /
• 제28권1호
• /
• pp.140-146
• /
• 2005

This study presents the new dispatching rules of job shop scheduling with auxiliary resource constraint to improve the schedule performance measures related to completion time and due dates. The proposed dispatching rules consider the information of total work remaining and machine utilization to decrease mean flowtime and mean tardiness. The results of computer experiments show that those schedule performances are significantly improved by using the new dispatching rules. The results provide guidance for the researchers and practitioners of auxiliary resource constrained job shop scheduling to decrease mean flowtime and mean tardiness.

• Journal of Electrical Engineering and Technology
• /
• 제11권4호
• /
• pp.987-992
• /
• 2016

This study introduces an example environment where wireless devices are mobile, devices use dynamic voltage scaling, devices and tasks are heterogeneous, tasks have deadline, and the computation and communication power is dynamically changed for energy saving. For this type of environment, the efficient system-level energy management and resource management for task completion can be an essential part of the operation and design of such systems. Therefore, the resources are assigned to tasks and the tasks may be scheduled to maximize a goal which is to minimize energy usage while trying to complete as many tasks as possible by their deadlines. This paper also introduces mobility of nodes and variable transmission power for communication which complicates the resource management/task scheduling problem further.

• 국제학술발표논문집
• /
• The 1th International Conference on Construction Engineering and Project Management
• /
• pp.881-885
• /
• 2005

Scheduling repetitive projects under limitations on the amounts of available resources (labor and equipment) has been an active subject because of its practical relevance. Traditionally, the limitation is specified as a deterministic (fixed) number, such as 1000 labor-hours. The limitation, however, is often exposed to uncertainty and variability, especially when the project is lengthy. This paper presents a stochastic optimization model to treat the situations where the limitations of resources are expressed as probability functions in lieu of deterministic numbers. The proposed model transfers each deterministic resource constraint into a corresponding stochastic one and then solves the problem by the use of a chance-constrained programming technique. The solution is validated by comparison with simulation results to show that it can satisfy the resource constraints with a probability beyond the desired confidence level.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권2호
• /
• pp.650-669
• /
• 2017

Coordinated multiple points transmission and reception (CoMP) technology is used to mitigate the inter-cell interference, and increase cell average user normalized throughput and cell edge user normalized throughput. There are two kinds of radio resource schedule strategies in LTE-A/5G CoMP system, and they are called centralized scheduling strategy and distributed scheduling strategy. The regional centralized scheduling cannot solve interference of inter-region, and the distributed scheduling leads to worse efficiency in the utilize of resources. In this paper, a novel distributed scheduling scheme named 9-Cell alternate authorization (9-CAA) is proposed. In our scheme, time-domain resources are divided orthogonally by coloring theory for inter-region cooperation in 9-Cell scenario [6]. Then, we provide a formula based on 0-1 integer programming to get chromatic number in 9-CAA. Moreover, a feasible optimal chromatic number search algorithm named CNS-9CAA is proposed. In addition, this scheme is expanded to 3-Cell scenario, and name it 3-Cell alternate authorization (3-CAA). At last, simulation results indicate that 9/3-CAA scheme exceed All CU CoMP, 9/3C CU CoMP and DLC resource scheduling scheme in cell average user normalized throughput. Especially, compared with the non-CoMP scheme as a benchmark, the 9-CAA and 3-CAA have improved the edge user normalized throughput by 17.2% and 13.0% respectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권7호
• /
• pp.2815-2839
• /
• 2020

In a cloud computing paradigm, allocation of various virtualized ICT resources is a complex problem due to the presence of heterogeneous application (MapReduce, content delivery and networks web applications) workloads having contentious allocation requirements in terms of ICT resource capacities (resource utilization, execution time, response time, etc.). This task of resource allocation becomes more challenging due to finite available resources and increasing consumer demands. Therefore, many unique models and techniques have been proposed to allocate resources efficiently. However, there is no published research available in this domain that clearly address this research problem and provides research taxonomy for classification of resource allocation techniques including strategic, target resources, optimization, scheduling and power. Hence, the main aim of this paper is to identify open challenges faced by the cloud service provider related to allocation of resource such as servers, storage and networks in cloud computing. More than 70 articles, between year 2007 and 2020, related to resource allocation in cloud computing have been shortlisted through a structured mechanism and are reviewed under clearly defined objectives. Lastly, the evolution of research in resource allocation techniques has also been discussed along with salient future directions in this area.

• 컴퓨터교육학회논문지
• /
• 제11권5호
• /
• pp.67-76
• /
• 2008

그리드 컴퓨팅은 지리적으로 분산되어 있는 기관들의 자원을 공유하여 협동 작업을 가능하게 하는 대규모 가상 컴퓨팅 환경이다. 최근 들어, 무선 통신망과 모바일 기기의 발달은 모바일 기기를 자원으로 이용 가능하도록 하고 있다. 하지만, 그리드 컴퓨팅에서 모바일 기기를 자원으로 이용하고자 하는 시도는 모바일 기기의 제약사항인, 낮은 프로세서 성능, 작은 메모리 용량, 한정된 배터리 용량, 낮은 통신 대역폭 등으로 어려움이 많다. 이에 본 논문에서는 모바일 그리드 환경에서 발생하는 제약사항의 극복을 위하여 프록시 기반 모바일 그리드 시스템을 제안하였다. 제안한 프록시 기반 모바일 그리드 시스템은 모바일 라우터를 사용하여 모바일 그리드 컴퓨팅 환경에서 모바일 기기가 자원 이용자 역할 뿐만 아니라 자원 제공자 역할도 수행할 수 있도록 하여, 기존 유선 그리드와의 협업 작업이 가능하도록 하였다. 또한, 본 논문에서 제안한 시스템에서 모바일 장치의 상태변화에 대처할 수 있는 적응적 작업 스케줄링 기법을 제안한다. 그리고 제안한 작업 스케줄링 기법의 타당성을 검증하기 위해 SimGrid 시뮬레이션 도구를 사용하여 다른 작업 스케줄링 기법과 비교 분석하였다.