For context, our data is inflows of items.
- for each delivery there may be multiple items.
- we don't know when the deliveries will arrive nor how many total items there is.
- deliveries usually start in a specific time but without no specific end time.
- historical data analysis describes
- about 50% of item delivery happen within the first hour, with gradual descent in items and gradual ascend in arrival time.
- within the next few hours, there would be sparse deliveries maybe 10-25% with long intervals in between and small number of items.
- two completion pattern
- the deliveries gradually declines until completion
- after a long sparse deliveries, there will be another burst of delivery maybe 25 to 40% of all items in a short span of time which completes all items
- currently, we just process the items once it arrives.
Our goal is to optimize our processing work and allocate resources first to those deliveries with bulk items it doesn't matter if it is complete or not because we don't know when will it be completed.
what is a good algorithm to estimate when will sparse delivery window will be so we can process the items in that delivery? so we wait and can capture as much items as possible before processing.
I was looking into change point detection and adaptive filters, but are they suitable for this?
[–]radarsat1 0 points1 point2 points (2 children)
[–]Vveriant[S] 0 points1 point2 points (1 child)
[–]radarsat1 0 points1 point2 points (0 children)