RCPS with Variable Intensity Activities and Feeding Precedence Constraints

Tamás Kis ()
Additional contact information
Tamás Kis: Hungarian Academy of Sciences

Chapter Chapter 5 in Perspectives in Modern Project Scheduling, 2006, pp 105-129 from Springer

Abstract: 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: variable intensity activities; branch-and-cut (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations: View citations in EconPapers (3)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-0-387-33768-5_5

Ordering information: This item can be ordered from
http://www.springer.com/9780387337685

DOI: 10.1007/978-0-387-33768-5_5

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().