Truncated branch-and-bound,schedule-construction,and schedule-improvement procedures for resource-constrained project scheduling期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

Truncated branch-and-bound,schedule-construction,and schedule-improvement procedures for resource-constrained project scheduling

Authors:	Birger Franck Klaus Neumann Christoph Schwindt

Affiliation:	(1) Institut für Wirtschaftstheorie und Operations Research, University of Karlsruhe, 76128 Karlsruhe, Germany (e-mail: {franck,neumann,schwindt}@wior.uni-karlsruhe.de) , DE

Abstract:	We present heuristic procedures for approximately solving large project scheduling problems with general temporal and resource constraints. In particular, we propose several truncated branch-and-bound techniques, priority-rule methods, and schedule-improvement procedures of types tabu search and genetic algorithm. A detailed experimental performance analysis compares the different heuristics devised and shows that large problem instances with up to 1000 activities and several resources can efficiently be solved with sufficient accuracy. Received: July 26, 2000 / Accepted: May 15, 2001

Keywords:	: Resource-constrained project scheduling – Truncated branch-and-bound – Priority-rule methods – Tabu search – Genetic algorithms
本文献已被 SpringerLink 等数据库收录！