Timeline for Matching algorithm in an order batching problem
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 26, 2023 at 13:26 | history | edited | Ying | CC BY-SA 4.0 |
added 360 characters in body
|
| Aug 26, 2023 at 13:10 | answer | added | A.Omidi | timeline score: 1 | |
| Aug 26, 2023 at 12:48 | comment | added | Ying | That is one-to-one relation. Just to explain that an order covers several areas, the objective is to combine the orders with the same areas. @MatheusDiógenesAndrade | |
| Aug 25, 2023 at 18:16 | answer | added | Sutanu Majumdar | timeline score: 1 | |
| Aug 25, 2023 at 13:34 | comment | added | Matheus Diógenes Andrade | Still in this subject, can we say that a single SKU s belongs to multiple areas (one-to-many relation)? Or an SKU belongs exclusively to an unique area (one-to-one)? | |
| Aug 25, 2023 at 3:58 | comment | added | Ying | For example, the set of storage areas is A = {a,b,c,...}. The first order should be picked from areas a and c, the second order should be picked from b and c. If they are grouped into the same batch, then the distinct areas coverd is a, b and c. | |
| Aug 25, 2023 at 3:56 | history | edited | Ying | CC BY-SA 4.0 |
added 49 characters in body
|
| Aug 24, 2023 at 8:37 | comment | added | A.Omidi |
Welcome to OR.SE. Would you please, elaborate more on needs to be picked from multiple storage areas?
|
|
| Aug 23, 2023 at 13:34 | history | edited | EhsanK♦ | CC BY-SA 4.0 |
deleted 5 characters in body
|
| S Aug 23, 2023 at 4:31 | review | First questions | |||
| Aug 23, 2023 at 13:34 | |||||
| S Aug 23, 2023 at 4:31 | history | asked | Ying | CC BY-SA 4.0 |