A branch-and-cut algorithm for scheduling of projects with variable-intensity activities

Research output: Contribution to journalArticle

67 Citations (Scopus)

Abstract

In this paper we study a resource constrained project scheduling problem in which the resource usage of each activity may vary over time proportionally to its varying intensity. We formalize the problem by means of a mixed integer-linear program, prove that feasible solution existence is NP-complete in the strong sense and propose a branch-and-cut algorithm for finding optimal solutions. To this end, we provide a complete description of the polytope of feasible intensity assignments to two variable-intensity activities connected by a precedence constraint along with a fast separation algorithm. A computational evaluation confirms the effectiveness of our method on various benchmark instances.

Original languageEnglish
Pages (from-to)515-539
Number of pages25
JournalMathematical Programming, Series B
Volume103
Issue number3
DOIs
Publication statusPublished - Jul 2005

Fingerprint

Branch-and-cut
Scheduling
Solution Existence
Resource-constrained Project Scheduling
Precedence Constraints
Integer Program
Polytope
Linear Program
Scheduling Problem
Assignment
NP-complete problem
Optimal Solution
Vary
Benchmark
Resources
Evaluation

Keywords

  • Branch-and-cut
  • Network flows, Polyhedral combinatorics
  • Project scheduling

ASJC Scopus subject areas

  • Applied Mathematics
  • Mathematics(all)
  • Safety, Risk, Reliability and Quality
  • Management Science and Operations Research
  • Software
  • Computer Graphics and Computer-Aided Design
  • Computer Science(all)

Cite this

A branch-and-cut algorithm for scheduling of projects with variable-intensity activities. / Kis, T.

In: Mathematical Programming, Series B, Vol. 103, No. 3, 07.2005, p. 515-539.

Research output: Contribution to journalArticle

@article{ab105dd5fcaf4fe4a662247e305cb24e,
title = "A branch-and-cut algorithm for scheduling of projects with variable-intensity activities",
abstract = "In this paper we study a resource constrained project scheduling problem in which the resource usage of each activity may vary over time proportionally to its varying intensity. We formalize the problem by means of a mixed integer-linear program, prove that feasible solution existence is NP-complete in the strong sense and propose a branch-and-cut algorithm for finding optimal solutions. To this end, we provide a complete description of the polytope of feasible intensity assignments to two variable-intensity activities connected by a precedence constraint along with a fast separation algorithm. A computational evaluation confirms the effectiveness of our method on various benchmark instances.",
keywords = "Branch-and-cut, Network flows, Polyhedral combinatorics, Project scheduling",
author = "T. Kis",
year = "2005",
month = "7",
doi = "10.1007/s10107-004-0551-6",
language = "English",
volume = "103",
pages = "515--539",
journal = "Mathematical Programming",
issn = "0025-5610",
publisher = "Springer-Verlag GmbH and Co. KG",
number = "3",

}

TY - JOUR

T1 - A branch-and-cut algorithm for scheduling of projects with variable-intensity activities

AU - Kis, T.

PY - 2005/7

Y1 - 2005/7

N2 - In this paper we study a resource constrained project scheduling problem in which the resource usage of each activity may vary over time proportionally to its varying intensity. We formalize the problem by means of a mixed integer-linear program, prove that feasible solution existence is NP-complete in the strong sense and propose a branch-and-cut algorithm for finding optimal solutions. To this end, we provide a complete description of the polytope of feasible intensity assignments to two variable-intensity activities connected by a precedence constraint along with a fast separation algorithm. A computational evaluation confirms the effectiveness of our method on various benchmark instances.

AB - In this paper we study a resource constrained project scheduling problem in which the resource usage of each activity may vary over time proportionally to its varying intensity. We formalize the problem by means of a mixed integer-linear program, prove that feasible solution existence is NP-complete in the strong sense and propose a branch-and-cut algorithm for finding optimal solutions. To this end, we provide a complete description of the polytope of feasible intensity assignments to two variable-intensity activities connected by a precedence constraint along with a fast separation algorithm. A computational evaluation confirms the effectiveness of our method on various benchmark instances.

KW - Branch-and-cut

KW - Network flows, Polyhedral combinatorics

KW - Project scheduling

UR - http://www.scopus.com/inward/record.url?scp=21644447132&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=21644447132&partnerID=8YFLogxK

U2 - 10.1007/s10107-004-0551-6

DO - 10.1007/s10107-004-0551-6

M3 - Article

AN - SCOPUS:21644447132

VL - 103

SP - 515

EP - 539

JO - Mathematical Programming

JF - Mathematical Programming

SN - 0025-5610

IS - 3

ER -