检索结果-内蒙古大学图书馆

2010 IEEE World Congress on Computational Intelligence

作者： Anagnostopoulos, Konstantinos P. Koulinas, Georgios K. Democritus Univ Thrace Dept Prod & Management Engn GR-67100 Xanthi Greece

ISBN: (纸本)9781424481262

The resource constrained project scheduling problem is one of the most important issues that project managers have to deal with during the project implementation, as constrained resource availabilities very often lead to delays in project completion and budget overruns. For solving this NP-hard optimization problem, we propose a genetic based hyperheuristic, i.e. an algorithm controlling a set of low-level heuristics which work in the solution domain. Chromosomes impose the sequence that the algorithm applies the low level heuristics. Implemented within a commercial project management software system, the hyperheuristic operates on the priority values that the software uses for scheduling activities. We perform a series of computational experiments with random generated projects. The results show that the algorithm is very promising for finding good solutions in reasonable time.

关键词： NP-hard optimization problem chromosome sequence computational complexity genetic algorithms genetic hyperheuristic algorithm project management resource allocation resource constrained project scheduling problem scheduling

来源：评论

学校读者我要写书评

暂无评论

IP-based energetic reasoning for the resource constrained project scheduling problem

引用

Electronic Notes in Discrete Mathematics 2010年第C期36卷 359-366页

作者： Kooli, Anis Haouari, Mohamed Hidri, Lotfi Néron, Emmanuel Combinatorial Optimization Research Group - ROI La Marsa Tunisia Departement of Industrial Engineering Ozyegin University 34662 Istanbul Turkey Combinatorial Optimization Research Group - ROI La Marsa Tunisia Laboratoire d'Informatique - LI Université François Rabelais Tours France

In this paper, we consider the resource constrained project scheduling problem (RCPSP). New feasibility tests for the energetic reasoning are introduced based on new integer programming (IP) formulations. Experimental... 详细信息

关键词： Energetic Reasoning Lower Bound resource constrained project scheduling problem

来源：评论

学校读者我要写书评

暂无评论

A Particle Swarm Optimization Algorithm with Crossover for resource constrained project scheduling problem

A Particle Swarm Optimization Algorithm with Crossover for R...

引用

IITA International Conference on Services Science, Management and Engineering

作者： Li, Ming Zhang, Yuanbiao Jiang, Weigang Xie, Jianwen Zhuhai Coll Jinan Univ Zhuhai Peoples R China

ISBN: (纸本)9780769537290

resource and project optimization scheduling has become the key of the success of researching project in the enterprises. In order to solve the mass resource constrained project scheduling problem, in this paper, an improved particle swarm algorithm (PSO) called particle swarm algorithm with crossover (CPSO) was presented. This improved algorithm is based on PSO and genetic algorithm (GA). Through comparing with SPSO and GA on RCPSP, it is indicated that CPSO not only avoids premature convergence to a high degree, but also keeps a faster convergence rate than SPSO and GA.

关键词： resource constrained project scheduling problem particle swarm algorithm with crossover genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

A New resource constrained project scheduling problem

A New Resource Constrained Project Scheduling Problem

引用

Asia-Pacific Conference on Information Processing (APCIP 2009)

作者： Liu, Xiaoxiang Jiang, Weigang Xie, Jianwen Jia, Yitian Jinan Univ Zhuhai Coll Dept Comp Sci Zhuhai Peoples R China Jinan Univ Dept Accounting Zhuhai Peoples R China

ISBN: (纸本)9780769536996

The optimal scheduling of resource and program has became the key to the success of enterprise development projects. The conventional resource constrained project scheduling problem seeks a solution which satisfies the time and resource constraints on purpose of a minimal construction period. With the development of the society, the realistic problems trend to be more and more complicated, and the RCPSP model is thereupon complex. This paper proposes a new project scheduling model with success rate and it is suitable for large-scale project scheduling problems, then, an improved particle swarm optimization called CPSO based on PSO and GA is used to solve the problems. The application of solving examples with CPSO demonstrates that this algorithm is effective.

关键词： resource constrained project scheduling problem particle swarm algorithm with crossover genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

A New resource constrained project scheduling problem

A New Resource Constrained Project Scheduling Problem

引用

2009 Asia-Pacific Conference on Information Processing

作者： Xiaoxiang Liu,Weigang Jiang,Jianwen Xie Department of Computer Science of Zhuhai College Jinan University Zhuhai,China Yitian Jia Department of Accounting of Zhuhai College Jinan University Zhuhai,China

The optimal scheduling of resource and program has became the key to the success of enterprise development *** conventional resource constrained project scheduling problem seeks a solution which satisfies the time and resource constraints on purpose of a minimal construction *** the development of the society,the realistic problems trend to be more and more complicated,and the RCPSP model is thereupon *** paper proposes a new project scheduling model with success rate and it is suitable for large-scale project scheduling problems,then,an improved particle swarm optimization called CPSO based on PSO and GA is used to solve the *** application of solving examples with CPSO demonstrates that this algorithm is effective.

关键词： resource constrained project scheduling problem particle swarm algorithm with crossover genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Computing redundant resources for the resource constrained project scheduling problem

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2007年第3期176卷 1452-1463页

作者： Carlier, Jacques Neron, Emmanuel Univ Technol Compiegne CNRS UMR 6599 Ctr Rech Royallieu F-60205 Compiegne France Univ Tours Ecole Polytech Lab Informat Dept Informat F-37200 Tours France

Several efficient lower bounds and time-bound adjustment methods for the resource constrained project scheduling problem (RCPSP) have recently been proposed. Some of them are based on redundant resources. In this paper we define redundant functions which are very useful for computing redundant resources. We also describe an algorithm for computing all maximal redundant functions. Once all these redundant functions have been determined, we have to identify those that are useful for bounding. Surprisingly, their number is reasonable even for large resource capacities, so a representative subset of them can be tabulated to be used efficiently. Computational results on classical RCPSP instances confirm their usefulness. (c) 2005 Elsevier B.V. All rights reserved.

关键词： resource constrained project scheduling problem lower bounds redundant functions

来源：评论

学校读者我要写书评

暂无评论

A Critical Chain project scheduling problem with Multi-mode

A Critical Chain Project Scheduling Problem with Multi-mode

引用

14th International Manufacturing Conference in China

作者： Peng, W. L. Jiao, Q. J. Shenyang Ligong Univ Sch Econ & Management Shenyang Peoples R China

ISBN: (纸本)9783037852378

Critical chain method (CCM) is a new project method which combines project network technologies and management arts. Although there are lots of researches on it, the existing critical chain method has some drawbacks limiting its decision level in practical application. To improve the decision level and application range of critical chain method, the critical chain method with multi-mode is studied. The project network technology is the foundation of project scheduling problem. All the existing project management tools can only support single mode project network, that is, all the project activities have only one executive mode. We study the multi-mode project network as the foundation of multi-mode CC. Furthermore, by relating multi-mode project network to critical chain method, the critical chain method with multi-mode is presented, and the implementation procedure is proposed. In the implementation of multi-mode CCM, the activity priority rules and mode priority rules are investigated.

关键词： project management Critical chain resource constrained project scheduling problem

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of Metaheuristics Search Techniques in resource Allocation problems

Performance Evaluation of Metaheuristics Search Techniques i...

引用

作者： Amit Shah Auckland University of Technology

学位级别：硕士

Existing research has focused on solving problems in the area of project management using variety of approaches including search based software engineering approach. The main aim of this research is to evaluate the performance of metaheuristics search techniques such as genetic algorithm, simulated annealing and tabu search in resource allocation problem with project management discipline. This will enable the paper to introduce an alternative approach to solve this resource constrained project scheduling problem (RCPSP). The nature of this research is both constructive and experimental therefore software development research methodology will be utilised as a guideline. This study reports a comprehensive set of experiments which evaluate the performance of metaheuristics search techniques. Initial set of experiments were performed over various numerical test function to verify the implementation of search techniques. The next stage of experiments had focused on the scalability of these search techniques. Based on the first two experiments, search techniques were evaluated against a discrete problem to further explore the scalability. Finally, a multi objective test case problem was evaluated which focused around RCPSP. For each of these experiments the parameters were fine-tuned during the design phase of the experiments. Based on the experiments, it was apparent that the metaheuristics search techniques can be used to solve problems in resource allocation within project management discipline. Finally, a comparison analysis strongly suggests that overall simulated annealing had performed better than genetic algorithm and tabu search.

关键词： Software engineering search based software engineering metaheuristics search techniques resource constrained project scheduling problem cost allocation project management

来源：评论

学校读者我要写书评

暂无评论

Polyhedral reformulation of a scheduling problem and related theoretical results

引用

RAIRO-OPERATIONS RESEARCH 2008年第3期42卷 325-359页

作者： Damay, Jean Quilliot, Alain Sanlaville, Eric Univ Blaise Pascal CNRS UMR 6158 LIMOS F-63173 Aubiere France

We deal here with a scheduling problem GPPCSP (Generalized Parallelism and Preemption constrained scheduling problem) which is an extension of both the well-known resource constrained scheduling problem and the scheduling problem with Disjunctive Constraints. We first propose a reformulation of GPPCSP: according to it, solving GPPCSP means finding a vertex of the Feasible Vertex Subset of an Antichain Polyhedron. Next, we state several theoretical results related to this reformulation process and to structural properties of this specific Feasible Vertex Subset (connectivity,...). We end by focusing on the preemptive case of GPPCSP and by identifying specific instances of GPPCSP which are such that any vertex of the related Antichain Polyhedron may be projected on its related Feasible Vertex Subset without any deterioration of the makespan. For such an instance, the GPPCSP problem may be solved in a simple way through linear programming.

关键词： partially ordered sets hypergraphs linear programming polyhedra multiprocessor scheduling resource constrained project scheduling problem

来源：评论

学校读者我要写书评

暂无评论

A Genetic Algorithm for Solving RCPSP

A Genetic Algorithm for Solving RCPSP

引用

International Symposium on Computer Science and Computational Technology

作者： Zhang, Hua Xu, Hao Peng, Wuliang Shenyang Ligong Univ Sch Mech Engn Shenyang Peoples R China Shenyang Ligong Univ Sch Econ & Management Shenyang Peoples R China

ISBN: (纸本)9780769534985

A genetic algorithm (GA) was proposed to solve the resource constrained project scheduling problem(RCPSP), in which resources are renewable and there is a single mode to perform each activity. This work employed genetic algorithms to schedule project activities to minimize make-span subject to precedence constraints and resources availability. In the genetic algorithm, a new permutation of priority-based encoding scheme was designed in the algorithm, and it inherits all the merits of both the permutation-based encoding scheme and the priority-based encoding scheme. The serial generation scheme was used in decoding scheme to generate project plan. A full factorial computational experiment was set up using the well-known standard instances in PSPLIB, and the algorithm given in this paper was compared with the existing intelligent optimization algorithms, the results reveal that the algorithm is effective for the RCPSP.

关键词： genetic algorithm project scheduling resource constrained project scheduling problem

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：