The tower of a wind turbine consists of a number $k$ of segments $s_i$ (e.g., 4 or 5), which have to be installed in a certain order $s_1, s_2, ..., s_k$. To build each segment, a specific time $t_i$ (e.g., 3 hours) is required.
What complicates the installation process is a wind speed limit $l_i$ for every segment, which applies after the installation of a specific segment $s_i$ until after the next segment is installed; then, the next segments s_(i+1) wind speed limit l_(i+1) applies. This means that the start of a segment is limited by the wind speeds that occur until the installation of the following segment is completed, whose starting point again depends on the following wind speeds and segments completion time and so on.
To make it easy, we assume that wind speeds are deterministic and known exactly on an hourly basis. If we are interested in a schedule on an hourly basis, what mathematical approaches would you suggest to find the earliest possible starting time for each tower segment $s_i$?
So far I have "solved" this (I think) by using an algorithm, but I think that there should be an easy solution using optimization? I am not looking for solutions, just inspiration of possible methods.
ok, initial pseudocode in PariGP format, not optimized
I find it easier to use numerical time for datetime ops. For that I use the same function as seen in Excel, so that any code for day rollover is unnecessary. 8/22/2022 00:00 = 44797, 01:00 = 44797.0417, etc
And here is the sample output: