Lower Bounds and Exact Solution Approaches

Lucio Bianco () and Massimiliano Caramia ()
Additional contact information
Lucio Bianco: University of Rome “Tor Vergata”
Massimiliano Caramia: University of Rome “Tor Vergata”

Chapter Chapter 5 in Handbook on Project Management and Scheduling Vol.1, 2015, pp 77-111 from Springer

Abstract: Abstract Generalized precedence relations are temporal constraints in which the starting/finishing times of a pair of activities have to be separated by at least or at most an amount of time denoted as time lag (minimum time lag and maximum time lag, respectively). This chapter is devoted to project scheduling with generalized precedence relations with and without resource constraints. Attention is focused on lower bounds and exact algorithms. In presenting existing results on these topics, we concentrate on recent results obtained by ourselves. The mathematical models and the algorithms presented here are supported by extensive computational results.

Keywords: Generalized precedence relations; Makespan minimization; Project scheduling; Resource constraints (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

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:ihichp:978-3-319-05443-8_5

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

DOI: 10.1007/978-3-319-05443-8_5

Access Statistics for this chapter

More chapters in International Handbooks on Information Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().