[1]/[5] Find a warehouse that can fulfil the complete order

mospy26 commented 4 years ago

[x] In case one store cannot fulfill the complete order, then bookstore application should find optimal number of warehouses to fulfill the complete order. (Algorithm) An individual order can either be dispatched from a single warehouse (if the complete order is available a single warehouse), or from the least number of warehouses if the complete order is not available in one warehouse. @SuKaiwen
[x] Currently, The model application only very partially includes Warehouses. You will have to address this shortcoming by making Warehouses first-class entities in the system.
[x] Each warehouse will have its own stock level records, and not all warehouses will hold stocks for all books.
[x] The stock levels in the chosen warehouse should also be updated accordingly once an order is processed successfully and completely (stock checked, bank transfer OK, delivery pickup arranged).
[x] DeliveryCo should handle the process of picking multiple items from different warehouses, and you do not need to support split orders or inter-warehouse transfers in the BookStore application. (Needs to log what book corresponds to what address in Delivery terminal) @blam135
[x] You will have to add functionality that allows the order processing code to find out which Warehouse(s) can fulfill the order (has all the requested books in stock). (If this is done, the task above can also be fulfilled) @blam135

Note: For these purposes, all warehouses that can fulfill the order are equally good – that is, we don’t have to find the ‘best’ warehouse for an order.

mospy26 commented 4 years ago

f1d0b024aae4e178034bc9c03e660b9b6a6504c4

mospy26 commented 4 years ago

Warehouse and stock correctly modelled - 12d118cc99dff8d4d775211495ba2d4a303d6361

Things needed to be fixed:

Warehouse optimality algorithm

blam135 commented 4 years ago

@mospy26 plz check the logic see if it's all good or if I missed anything

652f80fec707d1aa9d6da60cb5ded4c031938940

SuKaiwen commented 4 years ago

IDEA: 1) Sort the warehouses by total stock. 2) For each warehouse (most stock -> least), check if it can satisfy the order. 3) Get the first warehouse that satisfies the order. 4) If you cant satisfy the whole order, loop again until satisfied (use a boolean to check if order is impossible to be satisfied).

mospy26 commented 4 years ago

Algorithm still remaining to be done

SuKaiwen commented 4 years ago

Warehouse stuff finished but uses GREEDY SOLUTION (not optimal)...

mospy26 / complete-bookstore

[1]/[5] Find a warehouse that can fulfil the complete order #1