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) 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.

Bianco, L., Caramia, M., Giordani, S., Salvatore, A. (2023). Scheduling activities in project network with feeding precedence relations: an earliest start forward recursion algorithm. ANNALS OF OPERATIONS RESEARCH [10.1007/s10479-023-05521-0].

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

Bianco, L;Caramia, M
;
Giordani, S;
2023-07-22

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) 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.
22-lug-2023
Online ahead of print
Rilevanza internazionale
Articolo
Esperti anonimi
Settore MAT/09
English
Feeding precedence relations
Minimum makespan
Earliest start schedule
Forward recursion
https://doi.org/10.1007/s10479-023-05521-0
Bianco, L., Caramia, M., Giordani, S., Salvatore, A. (2023). Scheduling activities in project network with feeding precedence relations: an earliest start forward recursion algorithm. ANNALS OF OPERATIONS RESEARCH [10.1007/s10479-023-05521-0].
Bianco, L; Caramia, M; Giordani, S; Salvatore, A
Articolo su rivista
File in questo prodotto:
File Dimensione Formato  
BiancoEtAl(2023).pdf

accesso aperto

Descrizione: articolo
Tipologia: Versione Editoriale (PDF)
Licenza: Creative commons
Dimensione 1.02 MB
Formato Adobe PDF
1.02 MB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2108/337884
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 1
social impact