RCPS with variable intensity activities and feeding precedence constraints

Research output: Chapter in Book/Report/Conference proceedingChapter

15 Citations (Scopus)

Abstract

This paper presents a branch-and-cut based exact solution algorithm for scheduling of projects with variable intensity activities connected by feeding precedence constraints the objective being to minimize the violation of resource constraints. Feeding precedence constraints allow some overlap in the execution of the connected activities and capture the flow of material or information between them. New polyhedral results are obtained and computational results are summarized.

Original languageEnglish
Title of host publicationInternational Series in Operations Research and Management Science
PublisherSpringer New York LLC
Pages105-129
Number of pages25
Volume92
Publication statusPublished - 2006

Publication series

NameInternational Series in Operations Research and Management Science
Volume92
ISSN (Print)08848289

Fingerprint

Precedence Constraints
Branch-and-cut
Resource Constraints
Computational Results
Overlap
Exact Solution
Scheduling
Minimise
Exact solution
Violations
Resource constraints

Keywords

  • Branch-and-cut
  • Variable intensity activities

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Strategy and Management
  • Applied Mathematics
  • Computer Science Applications
  • Software

Cite this

Kis, T. (2006). RCPS with variable intensity activities and feeding precedence constraints. In International Series in Operations Research and Management Science (Vol. 92, pp. 105-129). (International Series in Operations Research and Management Science; Vol. 92). Springer New York LLC.

RCPS with variable intensity activities and feeding precedence constraints. / Kis, T.

International Series in Operations Research and Management Science. Vol. 92 Springer New York LLC, 2006. p. 105-129 (International Series in Operations Research and Management Science; Vol. 92).

Research output: Chapter in Book/Report/Conference proceedingChapter

Kis, T 2006, RCPS with variable intensity activities and feeding precedence constraints. in International Series in Operations Research and Management Science. vol. 92, International Series in Operations Research and Management Science, vol. 92, Springer New York LLC, pp. 105-129.
Kis T. RCPS with variable intensity activities and feeding precedence constraints. In International Series in Operations Research and Management Science. Vol. 92. Springer New York LLC. 2006. p. 105-129. (International Series in Operations Research and Management Science).
Kis, T. / RCPS with variable intensity activities and feeding precedence constraints. International Series in Operations Research and Management Science. Vol. 92 Springer New York LLC, 2006. pp. 105-129 (International Series in Operations Research and Management Science).
@inbook{de3e113cdfca4bdfb72c6f9c162136c8,
title = "RCPS with variable intensity activities and feeding precedence constraints",
abstract = "This paper presents a branch-and-cut based exact solution algorithm for scheduling of projects with variable intensity activities connected by feeding precedence constraints the objective being to minimize the violation of resource constraints. Feeding precedence constraints allow some overlap in the execution of the connected activities and capture the flow of material or information between them. New polyhedral results are obtained and computational results are summarized.",
keywords = "Branch-and-cut, Variable intensity activities",
author = "T. Kis",
year = "2006",
language = "English",
volume = "92",
series = "International Series in Operations Research and Management Science",
publisher = "Springer New York LLC",
pages = "105--129",
booktitle = "International Series in Operations Research and Management Science",

}

TY - CHAP

T1 - RCPS with variable intensity activities and feeding precedence constraints

AU - Kis, T.

PY - 2006

Y1 - 2006

N2 - This paper presents a branch-and-cut based exact solution algorithm for scheduling of projects with variable intensity activities connected by feeding precedence constraints the objective being to minimize the violation of resource constraints. Feeding precedence constraints allow some overlap in the execution of the connected activities and capture the flow of material or information between them. New polyhedral results are obtained and computational results are summarized.

AB - This paper presents a branch-and-cut based exact solution algorithm for scheduling of projects with variable intensity activities connected by feeding precedence constraints the objective being to minimize the violation of resource constraints. Feeding precedence constraints allow some overlap in the execution of the connected activities and capture the flow of material or information between them. New polyhedral results are obtained and computational results are summarized.

KW - Branch-and-cut

KW - Variable intensity activities

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

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

M3 - Chapter

VL - 92

T3 - International Series in Operations Research and Management Science

SP - 105

EP - 129

BT - International Series in Operations Research and Management Science

PB - Springer New York LLC

ER -