[Koha-bugs] [Bug 35826] Optimize building of holds queue based on transport cost matrix

[bugzilla-daemon at bugs.koha-community.org]

https://bugs.koha-community.org/bugzilla3/show_bug.cgi?id=35826

--- Comment #2 from Kyle M Hall <kyle at bywatersolutions.com> ---
(In reply to Andreas Jonsson from comment #1)
> Created RFC:
> https://wiki.koha-community.org/wiki/
> Optimize_holds_queue_building_using_the_Hungarian_Algorithm

This all looks really great but I'm worried about:

Items that cannot be assigned to fill any current hold and holds that cannot be
filled by any available item should have been sorted out before applying the
algorithm, so there must be at least one item that can be assigned to one hold,
and it would be unsatisfying if the algorithm failed to produce any allowed
item assignment at all.

I think the implication here is we must find the holdabilty of each item for
each hold before we assign items to holds. I think that makes our current
greedy algorithm at worst compares the first hold to all items, the second hold
to all items less one, the third hold to all items less two and so forth. I
tried to write the big O for these and mangled them so bad I thought it best to
leave them out :)

If I am correct about this, I think we need to retain the option to use the
greedy algorithm. Did I miss something?

-- 
You are receiving this mail because:
You are watching all bug changes.