Applied Mathematics and Computation, ( ISI ), Volume (201), Year (2008-7) , Pages (313-318)

Title : ( Solving the resource-constrained project scheduling problem using filter-and-fan approach )

Authors: Mohammad Ranjbar ,

Access to full-text not allowed by authors

Citation: BibTeX | EndNote

Abstract

The resource-constrained project scheduling problem is a notoriously difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms to find optimal or near-optimal solutions. This paper proposes a new heuristic algorithm for this problem based on filter-and-fan method incorporated with a local search, exploring in the defined neighborhood space. In the algorithm, the local search is used to generate a starting solution as well as to re-optimize the best schedules produced by the filter-and-fan method. The filter-and-fan is itself a local search procedure that generates compound moves in a tree search fashion. Computational results applied on a standard set of 2040 benchmark problems from the literature demonstrate the effectiveness of the approach.

Keywords

, Project scheduling; Neighborhood search; Heuristic; Filter, and, fan
برای دانلود از شناسه و رمز عبور پرتال پویا استفاده کنید.

@article{paperid:1006557,
author = {Ranjbar, Mohammad},
title = {Solving the resource-constrained project scheduling problem using filter-and-fan approach},
journal = {Applied Mathematics and Computation},
year = {2008},
volume = {201},
month = {July},
issn = {0096-3003},
pages = {313--318},
numpages = {5},
keywords = {Project scheduling; Neighborhood search; Heuristic; Filter-and-fan},
}

[Download]

%0 Journal Article
%T Solving the resource-constrained project scheduling problem using filter-and-fan approach
%A Ranjbar, Mohammad
%J Applied Mathematics and Computation
%@ 0096-3003
%D 2008

[Download]