Multi-Projects Scheduling with Resource Constraints and Priority Rules and Fuzzy Activities
سال
: 2012
چکیده: In order to perform a project, all project managers are facing with high quality standards and benefiting from shortest period of time, possible resources and continuous fights. There are a lot of social and economic factors for a project manager to have an optimized benefit from limited accessible resources either from man power point of view or reserve of materials. Various tools and several techniques are introduced within recent decades for scheduling of projects, but most of them are involved with scheduling of single projects and least for multi-projects. We can model different Courses of Action (COAs) evaluated during the operational military planning as many different activity networks. The corresponding project scheduling model is sufficiently general to be able to represent the most part of military missions. Recently, a project scheduling mathematical model has
been proposed where each activity called an action in the military context has different execution modes depending on the resource combination selected. This paper is a combination of Simulated Annealing Algorithm and the best Priority rules for solving the problem of scheduling in multi projects with limited resources that has been tested with numerical examples. The numerical tests make it clear that proposed method is better than multi-applicable rules of scheduling.
been proposed where each activity called an action in the military context has different execution modes depending on the resource combination selected. This paper is a combination of Simulated Annealing Algorithm and the best Priority rules for solving the problem of scheduling in multi projects with limited resources that has been tested with numerical examples. The numerical tests make it clear that proposed method is better than multi-applicable rules of scheduling.
کلیدواژه(گان): RCMPSP,scheduling,simulated annealing algorithm,priority rules
کالکشن
:
-
آمار بازدید
Multi-Projects Scheduling with Resource Constraints and Priority Rules and Fuzzy Activities
Show full item record
contributor author | منصور قلعه نوی | en |
contributor author | Mansour Ghalehnovi | fa |
date accessioned | 2020-06-06T13:08:14Z | |
date available | 2020-06-06T13:08:14Z | |
date issued | 2012 | |
identifier uri | https://libsearch.um.ac.ir:443/fum/handle/fum/3343002 | |
description abstract | In order to perform a project, all project managers are facing with high quality standards and benefiting from shortest period of time, possible resources and continuous fights. There are a lot of social and economic factors for a project manager to have an optimized benefit from limited accessible resources either from man power point of view or reserve of materials. Various tools and several techniques are introduced within recent decades for scheduling of projects, but most of them are involved with scheduling of single projects and least for multi-projects. We can model different Courses of Action (COAs) evaluated during the operational military planning as many different activity networks. The corresponding project scheduling model is sufficiently general to be able to represent the most part of military missions. Recently, a project scheduling mathematical model has been proposed where each activity called an action in the military context has different execution modes depending on the resource combination selected. This paper is a combination of Simulated Annealing Algorithm and the best Priority rules for solving the problem of scheduling in multi projects with limited resources that has been tested with numerical examples. The numerical tests make it clear that proposed method is better than multi-applicable rules of scheduling. | en |
language | English | |
title | Multi-Projects Scheduling with Resource Constraints and Priority Rules and Fuzzy Activities | en |
type | Journal Paper | |
contenttype | External Fulltext | |
subject keywords | RCMPSP | en |
subject keywords | scheduling | en |
subject keywords | simulated annealing algorithm | en |
subject keywords | priority rules | en |
journal title | Texas Journal of Science | fa |
pages | 543-553 | |
journal volume | 23 | |
journal issue | 3 | |
identifier link | https://profdoc.um.ac.ir/paper-abstract-1028092.html | |
identifier articleid | 1028092 |