Loading...
Search for: resource-constraints
0.006 seconds

    A Branch and Cut Algorithm for Resource-Constrained Project Scheduling Problem Subject to Nonrenewable Resources with Pre-Scheduled Procurement

    , Article Arabian Journal for Science and Engineering ; Vol. 39, Issue. 11 , November , 2014 , pp. 8359-8369 ; ISSN: 13198025 Shirzadeh Chaleshtarti, A ; Shadrokh, S ; Sharif University of Technology
    Abstract
    In the project scheduling literature, nonrenewable resources are assumed to be available in full amount at the beginning of the project. However, in practice, it is very common that these resources are procured along the project horizon according to some pre-scheduled plan. In this paper, we study an extended form of the resource-constrained project scheduling problem that is subject to this type of nonrenewable resources in addition to the renewable resources. In order to solve this problem, we propose a branch and cut algorithm. We incorporate with the algorithm some technics and fathoming rules to shorten the solving process. The algorithm is capable of specifying lower bounds for the... 

    The Resource Renting Problem in Resource Constraint Project Scheduling Problem

    , M.Sc. Thesis Sharif University of Technology Asrzad, Amir (Author) ; Sepehri, Mehran (Supervisor) ; Shadrokh, Shahram (Co-Advisor)
    Abstract
    As an extension of known project scheduling problems which consider only time-independent costs, this problem includes both time- independent procurement costs and time-dependent renting costs for the resources. Consequently, in addition to projects where all resources are bought, we can deal with projects where resources are rented.
    A resource Renting problem is a project-scheduling problem in which the availability levels of the rented resources are considered decision variables and the goal is to find a schedule and resource renting such that some objective function optimizes. In this thesis, we consider a resource renting problem in which the goal is to maximize the net present... 

    Project Procurement Scheduling, Considering Warehouse Space Constraint

    , M.Sc. Thesis Sharif University of Technology Ebrahimi, Fakhroddin (Author) ; Shadrokh, Shahram (Supervisor)
    Abstract
    Project scheduling is one of the branches in operations research and management sciences fields. Different goals have been considered in project scheduling, but financial goals are one of the most important criterions in this research area. The project with the conditions considered in this thesis is an NP-Hard problem and solving it in real size problems is only possible with heuristic or meta- heuristic methods. This research deals with the Project Procurement scheduling, considering warehouse space constraint. The purpose of this research is to minimize the total cost of this problem by determining the optimal activity start time and material ordering schedule subject to constraints. We... 

    , M.Sc. Thesis Sharif University of Technology Jahedi Gholenji, Mohammad (Author) ; Shadrokh, Shahram (Supervisor)
    Abstract
    In this thesis a multi-mode resource constrained project scheduling problem with considering project robustness,length of critical path and total quality of project is solved. Also we tried to propose a new mathematical model for this problem and we used both renewable and non-renewable resource constrained.The function is multi-objective so we couldn’t use classic optimization methods to reach globally or locally optimum solutions,then we used a multi-criteria optimization method to solve the problem.with respect to the computational complexity of problem we proposed a multi-objective metaheuristic (DE) algorithm to get to dominated optimal solutions.in our metaheuristic method particular... 

    Solving Preemptive Multimode Resource Constraint Project Scheduling Problem Considering Fast-Tracking Using Genetic Algorithm

    , M.Sc. Thesis Sharif University of Technology Manshadian, Hamed (Author) ; Shadrokh, Shahram (Supervisor)
    Abstract
    In this project, we present a mathematical model for preemptive multi-mode resource-constrained project scheduling problem considering fast tracking (PMRCPSP-FT). The number of activity preemptions could be defined in the model. We used two types of resources in our model: Renewable resources and Non-renewable resources. Each activity can be accomplished in just one mode and each mode represents activity resource requirements, its duration and its maximum number of allowable preemptions. The objective is to minimize the project makespan. Considering the complexity of the problem, the exact solution is not achievable for big or real size problems. We use a genetic algorithm to solve the... 

    Application of Branch-and-bound Method, Scatter Search Algorithm, and Particle Swarm Optimization Method in Solving Some Resource-Constrained Project Scheduling Problems

    , Ph.D. Dissertation Sharif University of Technology Khalilzadeh, Mohammad (Author) ; Kianfar, Fereydoon (Supervisor) ; Rowghangar Ranjbar, Mohammad (Supervisor)
    Abstract
    The main goal of this thesis is to reduce the gap between the theoretical and actual project scheduling problems by introducing three problems and then proposing three different exact and meta-heuristic algorithms to solve them. These problems are as follows: the Resource-Constrained Project Scheduling Problem with Minimization of Total Weighted Resource Tardiness Penalty Costs (RCPSP-TWRTPC), the Resource-Constrained Project Scheduling Problem with Discounted Cash Flows of Weighted Earliness-Tardiness Costs (RCPSP-DCWET), and the Multi-Mode Resource-Constrained Project Scheduling Problem with Minimization of Total Weighted Resource Tardiness Penalty Costs (MRCPSP-TWRTPC). Also, we develop a... 

    A cluster-based and drop-aware extension of RPL to provide reliability in IOT applications

    , Article 15th Annual IEEE International Systems Conference, SysCon 2021, 15 April 2021 through 15 May 2021 ; 2021 ; 9781665444392 (ISBN) Shirbeigi, M ; Safaei, B ; Mohammadsalehi, A ; Monazzah, A. M. H ; Henkel, J ; Ejlali, A ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2021
    Abstract
    The standardized IPv6 Routing Protocol for Low-power and Lossy Networks (RPL) has enabled efficient communications between thousands of smart devices, sensors, and actuators in a bi-directional, and end-to-end manner, allowing the connection of resource constraint devices in multi-hop IoT infrastructures. RPL is designed to cope with the major challenges of Low-power and Lossy Networks (LLNs), specifically their energy-efficiency. However, RPL is facing with severe congestion and load balancing problems, leading to a low Packet Delivery Ratio (PDR) in the network. For the first time since the declaration of RPL, in this paper we explain that ignoring the specifications of the reception and... 

    Resource Allocation in Multi-project Scheduling with Resource Transfer Time and Cost

    , M.Sc. Thesis Sharif University of Technology Panahi, Yousef (Author) ; Shadrokh, Shahram (Supervisor)
    Abstract
    The project scheduling problem is one of the classic problems in project management that includes a range of optimization problems. One of the limitations we face in project scheduling problem is the resource constraint limitation. In many studies in the literature review, problems are based on the false assumption that a resource can be transferred between activities of a project or different projects without spending time and cost. The resource availability method in many fundamental researches in the context of resource constrained project scheduling problem (RCPSP) is considered as resource investment problems (RIP); while in many real world projects resources are rented for projects and... 

    Presentation of a Model and Solving the Problem of Project Portfolio Selection Based on Project Scheduling using Two-Level NSGAII

    , M.Sc. Thesis Sharif University of Technology Jafari, Hossein (Author) ; Shadrokh, Shahram (Supervisor)
    Abstract
    This project aims to study a situation in which several projects must be selected. The decision makers should select a subset of these projects taking into account the limitation of resources and scheduling. Project selection models generally do not consider schedule of project activities as part of selection process. On the other hand, except the cases where only one project is under process in each period, prioritizing the selected projects is not optimal not considering their scheduling. Projects scheduling in project activities level may increase the complexity of decision making for portfolio selection and expand the area of search for selection of projects portfolio. Therefore, all the... 

    Non-delegatable strong designated verifier signature using a trusted third party without pairings

    , Article Conferences in Research and Practice in Information Technology Series ; Volume 138 , 2013 , Pages 13-25 ; 14451336 (ISSN) ; 9781921770234 (ISBN) Asaar, M. R ; Vardasbi, A ; Salmasizadeh, M ; Sharif University of Technology
    Australian Computer Society  2013
    Abstract
    Strong designated verifier signature (SDVS) is characterized by two properties; namely the nontransferability and the privacy of the signer's identity (PSI). Non-transferability prevents anyone else other than the designated verifier to verify the signature, while PSI prevents a third party to distinguish between two different signers. In this paper, we propose a non-delegatable SDVS which uses a trusted third party for the key generation. Our signature scheme does not use bilinear pairings which makes it suitable for the resource constraint applications. Using one-way homomorphic functions, our scheme is presented at an abstract level, the unification of which was noticed by Maurer in the... 

    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) Ranjbar, M ; Khalilzadeh, M ; Kianfar, F ; Etminani, K ; Sharif University of Technology
    Abstract
    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...