Scheduling activities in project network with feeding precedence relations: an earliest start forward recursion algorithm

Lucio Bianco (), Massimiliano Caramia (), Stefano Giordani () and Alessio Salvatore ()
Additional contact information
Lucio Bianco: University of Rome “Tor Vergata”
Massimiliano Caramia: University of Rome “Tor Vergata”
Stefano Giordani: University of Rome “Tor Vergata”
Alessio Salvatore: CNR

Annals of Operations Research, 2024, vol. 338, issue 1, No 8, 193-224

Abstract: Abstract In some production processes, the effort associated with a certain activity for its execution can vary over time. In this case, the amount of work per time unit devoted to each activity, so as its duration, is not univocally determined. This kind of problem can be represented by an activity project network with the so-called feeding precedence relations, and activity variable execution intensity. In this paper, we propose a forward recursion algorithm able to find the earliest start and finish times of each activity, in $$O(m \log n)$$ O ( m log n ) time, with n and m being the number of activities and the number of precedence relations, respectively. In particular, this requires the calculation of the (optimal) execution intensity profile, for each activity, that warrants the earliest start schedule and the minimum completion time of the project.

Keywords: Feeding precedence relations; Minimum makespan; Earliest start schedule; Forward recursion (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-023-05521-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:annopr:v:338:y:2024:i:1:d:10.1007_s10479-023-05521-0

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-023-05521-0

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().