Search for: precedence-constraints
Resource-constrained project scheduling problem with flexible work profiles: A genetic algorithm approach, Article Scientia Iranica ; Volume 17, Issue 1 E , JANUARY-JUNE , 2010 , Pages 25-35 ; 10263098 (ISSN) ; Kianfar, F ; Sharif University of Technology
This paper deals with the resource-constrained project scheduling problem with flexible work profiles. In this problem, a project contains activities interrelated by finish-start-type precedence constraints with a time lag of zero. In many real-life projects, however, it often occurs that only one renewable bottleneck resource is available and that activities do not have, a fixed prespecified duration and associated resource requirement, but a total work content, which essentially indicates how much work has to be performed on them. Based on this work content, all feasible work profiles have to be specified for the activities, each characterized by a, fixed duration and a resource...
Article European Journal of Operational Research ; Volume 193, Issue 1 , 2009 , Pages 35-48 ; 03772217 (ISSN) ; De Reyck, B ; Kianfar, F ; Sharif University of Technology
We develop a heuristic procedure for solving the discrete time/resource trade-off problem in the field of project scheduling. In this problem, a project contains activities interrelated by finish-start-type precedence constraints with a time lag of zero, which require one or more constrained renewable resources. Each activity has a specified work content and can be performed in different modes, i.e. with different durations and resource requirements, as long as the required work content is met. The objective is to schedule each activity in one of its modes in order to minimize the project makespan. We use a scatter search algorithm to tackle this problem, using path relinking methodology as...
Energy-aware scheduling algorithm for precedence-constrained parallel tasks of network-intensive applications in a distributed homogeneous environment, Article Proceedings of the 3rd International Conference on Computer and Knowledge Engineering, ICCKE 2013 ; 2013 , Pages 368-375 ; 9781479920921 (ISBN) ; Rajabi, A ; Goudarzi, M ; Sharif University of Technology
A wide range of scheduling algorithms used in the data centers have traditionally concentrated on enhancement of performance metrics. Recently, with the rapid growth of data centers in terms of both size and number, the power consumption has become a major challenge for both industry and society. At the software level, energy-aware task scheduling is an effective technique for power reduction in the data centers. However, most of the currently proposed energy-aware scheduling approaches are only paying attention to computation cost. In the other words, they ignore the energy consumed by the network equipment, namely communication cost. In this paper, the problem of scheduling...
An optimal procedure for minimizing total weighted resource tardiness penalty costs in the resource-constrained project scheduling problem, Article Computers and Industrial Engineering ; Volume 62, Issue 1 , 2012 , Pages 264-270 ; 03608352 (ISSN) ; Khalilzadeh, M ; Kianfar, F ; Etminani, K ; Sharif University of Technology
We present an optimal solution procedure for minimizing total weighted resource tardiness penalty costs in the resource-constrained project scheduling problem. In this problem, we assume the constrained renewable resources are limited to very expensive equipments and machines that are used in other projects and are not available in all periods of time of a project. In other words, for each resource, there is a dictated ready date as well as a due date such that no resource can be available before its ready date but the resources are permitted to be used after their due dates by paying penalty cost depending on the resource type. We also assume that only one unit of each resource type is...