			Home About us Contact

Project Scheduling Problem (project + scheduling_problem)

Distribution by Scientific Domains

Business, Economics, Finance and Accounting	50%

Selected Abstracts

Robust Resource Allocation Decisions in Resource-Constrained Projects,

DECISION SCIENCES, Issue 1 2007
Filip Deblaere
ABSTRACT The well-known deterministic resource-constrained project scheduling problem involves the determination of a predictive schedule (baseline schedule or pre-schedule) of the project activities that satisfies the finish,start precedence relations and the renewable resource constraints under the objective of minimizing the project duration. This baseline schedule serves as a baseline for the execution of the project. During execution, however, the project can be subject to several types of disruptions that may disturb the baseline schedule. Management must then rely on a reactive scheduling procedure for revising or reoptimizing the baseline schedule. The objective of our research is to develop procedures for allocating resources to the activities of a given baseline schedule in order to maximize its stability in the presence of activity duration variability. We propose three integer programming,based heuristics and one constructive procedure for resource allocation. We derive lower bounds for schedule stability and report on computational results obtained on a set of benchmark problems. [source]

Solving resource constrained multiple project scheduling problems by random key-based genetic algorithm

ELECTRONICS & COMMUNICATIONS IN JAPAN, Issue 8 2009
Ikutaro Okada
Abstract In this paper, we propose a hybrid genetic algorithm with fuzzy logic controller (flc-rkGA) to solve the resource-constrained multiple project scheduling problem (rc-mPSP) which is well known as an NP-hard problem and the objective in this paper is to minimize total complete time in the project. It is difficult to treat the rc-mPSP problems with traditional optimization techniques. The new approach proposed is based on the hybrid genetic algorithm (flc-rkGA) with fuzzy logic controller (FLC) and random-key encoding. For these rc-mPSP problems, we demonstrate that the proposed flc-rkGA to solve the rc-mPSP problem yields better results than several heuristic genetic algorithms presented in the computation result. © 2009 Wiley Periodicals, Inc. Electron Comm Jpn, 92(8): 25,35, 2009; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecj.10101 [source]

A personal perspective on problem solving by general purpose solvers

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, Issue 3 2010
Toshihide Ibaraki
Abstract To solve the problems that abound in real-world applications, we are proposing an approach of using general-purpose solvers, as we cannot afford to develop special-purpose algorithms for all individual problems. The existing general-purpose solvers such as linear programming and integer programming are very useful but not sufficient. To improve the situation, we have developed solvers for other standard problems such as the constraint satisfaction problem and the resource-constrained project scheduling problem among others. In this article, we describe why general-purpose solvers are needed, what kinds of solvers we considered, how they were developed and where they have been applied. [source]