EP1196880A1

EP1196880A1 - Method for consigning ordered commodities

Info

Publication number: EP1196880A1
Application number: EP01951412A
Authority: EP
Inventors: Walter Rosenbaum
Original assignee: Siemens Dematic AG
Current assignee: Siemens AG
Priority date: 2000-06-27
Filing date: 2001-06-25
Publication date: 2002-04-17
Also published as: CA2382827A1; WO2002001429A2; US20020128927A1; AU759383B2; AU7235001A; US7236937B2

Description

description

Procedure for sending ordered articles

The invention relates to a method for sending ordered articles, in which different articles are ordered from a mail order company or online provider, and in which the order data and the customer details, such as name and address, are stored in a database.

If a customer orders different goods from one or more online providers, he currently receives shipments from each manufacturer / supplier, i.e. he has to be present several times to receive the goods and the transport costs are relatively high.

If corresponding goods are ordered from a conventional mail order company, they will be temporarily stored in a large warehouse if they are not sent directly to the customer from the manufacturers. The goods are either temporarily stored in this warehouse in terms of quantities and range of products so that orders can be accessed directly from them, or newly ordered goods are temporarily stored until all items are available. Then a joint dispatch to the customer takes place. The latter intermediate storage requires less storage space, which can vary greatly from day to day, so that reserve capacities have to be made available. In addition, the complete infrastructure must also be available in this case.

The invention specified in claim 1 is therefore based on the object of creating a method for sending ordered, different articles, in which the necessary temporary storage capacities are reduced compared to the prior art in the case of desired collective delivery. The invention is based on the idea of coordinating the delivery times at the manufacturers / suppliers in such a way that the respective transport from the manufacturer / supplier to the shipping service is included as storage so that the shipping service no longer needs a larger intermediate storage to store the ordered items to be delivered to the customer in a single delivery.

This is achieved by reporting the earliest possible delivery times of the manufacturers / suppliers to a common shipping service and storing them there together with the order data and customer details, such as name, address, in a database. Then the latest time of arrival of articles at the dispatch center of the shipping service is determined for this order, which is determined from the associated earliest possible delivery times of the manufacturers / suppliers and the respective added transport times. From this, the earliest possible delivery time for the customer is determined by adding the transport time from the shipping center to the customer at the latest arrival time at the shipping center and adding a processing time to the shipping service.

The delivery service then transmits the delivery date to be realized to each manufacturer / supplier of the order concerned. This results from the latest time of arrival at the dispatch center minus the respective transport time from the manufacturer / supplier to the dispatch center. The last step is to deliver the ordered items to the

Shipping service and joint forwarding from the shipping center to the customer.

Advantageous embodiments of the invention are shown in the subclaims. In order to avoid that the customer is not present when the items are delivered, it is advantageous to coordinate the delivery date with them. For this purpose, the earliest possible delivery time to the customer is determined by adding the transport time between the shipping center and the customer at the latest arrival time and adding a processing time to the shipping service. Then at least one suggestion for the delivery time is sent to the customer. After receipt of the delivery time confirmed by the customer, the delivery times of the manufacturers / suppliers to be realized are postponed on the basis of the earliest possible delivery time for the customer by the time difference between the confirmed and the earliest possible delivery time.

In an advantageous embodiment, the transport times between the manufacturers / suppliers and the shipping center are reported to the shipping service together with the earliest possible delivery times and are stored in the database.

In a further advantageous embodiment for determining the current transport times between manufacturers / suppliers and the dispatch center, these are continuously ascertained, stored and statistically evaluated. '

It is advantageous for the customer if he is led to several sub-online providers only via an online provider who coordinates the shipping at the same time.

In order to avoid excessive delays in delivery, the earliest delivery times of the articles are advantageously compared with one another at the manufacturers / suppliers. If a specified time difference is exceeded, the items are not delivered to the customer together. U> ω t IO μ> H

Lπ o LΠ O LΠ o (Jl ω D i- ¹ rt CQ CQ Di> τj φ ≤ O er o Ω P ⁾ > su P CQ CQ V s; D. ö H

CD H- Φ H- Φ tr Φ Φ Hl μ- Φ P Φ ω Φ PPP 0 Φ P μ- rt 0 = Φ Φ UP ω Φ Ω I- ¹ 0 3 P Φ P μ- μ- • 3 tr CQ CQ li P Di Ω μ- P μ li rt rf P ω U 3 Φ μ- φ rt μ- P ⁾ = SU Ω $ rt tr 3 P Di Φ φ

Φ CQ Φ Q ^ M μ φ P Φ to L) P tr PJ: Φ 0 rf 3 Φ Φ P μ-

H "ΓT Di 3 D-. SU Φ μ. Φ μ- • f> τt ' ^I J Di tr μ- D. rt PP via P

Φ Φ μ- Ω H s; CQ «1 P 10 Di H H H μ- t-> H" Φ μ- Φ rf SU φ

Φ CQ CQ F Φ 0 CQ μ- SU> Φ o Φ QQ Ω Di φ φ tr fi Ω P p μ- P ü li μ- 3 φ rt 3 σ P 3 o μ. Φ t ⁾ P su tr cn U? Rv JO φ K Φ D. 3 SU er o C DO μ> H φ Hi 3 μ- P Φ S

P $ P Mi Φ ρ = φ er μ- O • i PI rf o = 3 μ PP> er φ Q 0 I- ¹ φ er er su Φ φ P φ HN Di P> LQ 0 = rt Di Φ μ- su H- CQ 0 Φ Φ P μ- rt μ- Ω Φ P μ- tQ μ- LQ μ- rt er Di P rt rt 0 "1 μ. CQ μ- Φ μ- P μ- $ P CQ μ-? 3 0 Φ 3 Φ

Φ H- Φ Φ Φ IV P Φ φ tr μ. P φ μ »Ω μ-. rt Ω μ- Φ φ er Q H p Φ 1 H CQ D. Di Hι su φ er φ Φ Φ Φ t H tr Ω tr * ö <Φ

3rd su tr ¹ Φ φ rf SU 1 Cd CQ Φ μ- μ- μ- μ- P D. Φ CQ tr μ. Di Φ Φ P ö P μ- Φ Ω CQ μ- P i P> φ μ- μ- P a PPP CQ rf CQ <i Φ μ- μ- μ.

3 "er 3 ü 0 φ rf P D. P ω er 3 Φ er φ φ P Si rt o H Φ Ω Q <!

H- rt H- *** - ^ 3 H Mi Φ P Φ φ er rt rf ⁾ LQ μ- P ⁾ Hi ü Φ pr P) 0

Φ Φ Φ 3 t ¹ P φ rt CQ ii P μ- φ ir ¹ Cd μ Cd Cd Φ PHV tr φ P fi

3 rf 3 μ- P rt H rf Φ Di μ- rt P Ω P = P su M li ii Di rt

≥! Φ Di φ P Φ SU tS3 Cd CQ rt Φ φ 0 Φ 0 o t tr ii P Φ rt rt Di Φ

SD N H Hl D. l P D. P Φ J Φ P μ Hl Ω P Ω Ω tr μ φ N Di μ. μ- • »μ- μ-

3 P CQ P = φ P rt SU Q μ. μ P φ! ft CD ^' Hl μ Φ φ CQ? r Φ H

Φ CQ er "i 3 Φ Φ CQ Φ rf Φ tQ Cd H i tr ¹ Di D. μ, μ- ^ H rt Φ SP tr

PJ t Φ P ⁾ P rt P CQ μ Φ Ω t φ SU SU μ- SU P ⁾ P Φ> Φ PQ su

3 μ 1-5 CQ - P ^J tr P = CQ er li φ li li Φ Di PPH tr rt Hi

P 3 0 3 rt μ- σi D. SU Φ SU er rt CQ Hi CQ CQ H P P CQ μ CQ μ- SU r

P Φ i μ- Φ Ω S φ φ PP Φ Φ U rt φ rt rt P ⁾ o φ PPU Φ ^

D. 3 Φ rf P • μ- D. μ. rt μ, Di Hl μ. P Φ μ Φ Φ PJ: LQ Di μ- P li D P P

H, n- Ω φ μ- Φ Φ • Hl rt P Φ φ CQ μ- Φ Ω

3 φ σi 0 Φ Cd P μ ¹ Q Φ μ- 'Φ rt μ- li Hl * Ö CQ P ¹ μ- Di tr> i H- Di 3 D. φ K ü Ω HPHPP Φ P Φ o rt μ- P φ P ii rt Φ PPS! CQ φ μ- - P 3 PPH Cd μ ü Φ φ μ> Ω CQ

Φ Q φ SU H. SU rt ö P li Φ P μ ¹ CQ μ- CQ IQ rt Φ Φ P rt Φ Hi 3 Φ μ. LQ

CQ Di μ- $, P Ω ü Φ P CD Q CQ tr P. μ- CQ P ^ Q φ μ, 0 = Φ

CQ Φ SD tr φ I tr φ μ IQ rr φ Φ P = "Q D. i P rt LQ φ fi d LΛ) CQ φ PPP μ- Φ P Ω Φ Φ _^ er Φ Φ Φ α φ Φ CQ LQ <! SU PJ explained

CQ D. φ P 'Cd φ Q er li Q su 3 N Φ 0 P V Φ P S

Cd CQ S "Q Φ μ- 0 μ, PJ = Φ öd l Φ er Φ μ. T Φ μ-

H- Φ φ P £ Φ ü i tr Φ CQ P = H μ- H Cd Φ φ μ- N rt φ rt P rt

P CQ s; μ- rt Di φ μ r Ω Di P 3 H Φ μ- P ii rt P Φ P Cd PP rf tr Φ Cd Φ P rt ^ « _^ Φ tr SU Hi 3 CQ CQ • ö 3 μ- <! φ i P

Φ Φ tr μ- ü rt φ μ SU t ¹ φ CQ 0 Cd μ- rf 1SI Hi Di P Hi Φ Di LQ

H- φ φ • N P P CQ μ- - μ φ rt Φ φ P = Φ P Cd tr P = μ> SU t

P rf P Φ Ω Φ Di φ P H 3 CQ rt μ- tr P IV Φ P) μ CQ H μ- -S

Φ Φ <ü μ-? tr CQ μ- Hl PPP PJ rt LQ H r CQ Hi Ω Hi LQ Φ ii UP φ Hl PJ Ω P ⁾ rt φ φ LQ P rf rt Φ P <! Φ P <Φ r rt Φ tr Φ ü rr ii P tr P μ. H α Φ μ- I - ¹ P 0 PP Φ Φ μ- μ- P = P i α Φ CQ P = P> P μ- μ- su I- ¹ μ O μ- ¹ tQ H LQ μ. SU P Ω er CQ φ

SU P Φ J tr Ω PH Ω HP φ 3 PP φ LQ CQ CQ PH ¹ i φ Φ Ω P ii D. ⁾ v rr ü 0 φ tr P φ ⁴ rt rt μ- P φ CQ er J CQ φ μ- P rt μ, tr

Φ P CQ Di Q IQ μ- t Φ μ- φ r Q rf Hi Φ P Φ P N li Φ TS SU μ-

3 3 SU N rt Φ φ P rr I- ¹ ^ P Φ μ- CQ LQ μ- D. P CQ er S μ. Hi P er D. 3 Φ n P rt φ r? SU P Φ CQ D. ≤ φ Φ Φ P = rt "D. P 3 3 Di er Φ LΠ 1 3 CQ <! CQ» μ- PJ: 1 μ. Hl φ Di

3 i 1 rt 0 = μ- μ- Φ P D. o CQ Φ μ- φ tr tr Di rt P Φ r Φ IQ rt φ μ- μ- Φ α Φ μ φ P 1 μ- Φ HPP ⁾ 1 1 1 P µ CQ CQ 1 CQ PP

*> is 1

get saved. The transport times from the manufacturers / suppliers 5 to the dispatch center 3 are also stored with these data. The transport times can be reported by the manufacturers / suppliers 5, as shown, or this information is already stored in the database 4. The solid arrow indicates that the shipping service or shipping center 3 belongs to the mail order company / online provider 2 and receives the information about it, the dashed arrow indicates that the shipping service is independent and the information is provided directly by the manufacturers / suppliers 5 receives. Based on the earliest possible delivery dates and the respective additional transport times to shipping center 3 (shoes.com: 04.12.00 plus 1 day; books.com: 05.12.00 plus 1 day; music.com: 04.12.00 plus 3 days) latest of the earliest possible times of arrival at dispatch center 3 of the dispatch service determined (07.12.00). If you add the transport time to customer 1 (1 day) and a processing time (in this case 0 days) at the shipping service, you get the earliest delivery time from customer 1 (12/8/00). It is advantageous to coordinate this date with the customer 1 so that the consignment can also be received by him. If this has been done, the agreed arrival time of the ordered items at the dispatch center 3 (07.12.00) is deducted from the agreed date (the suggested date 08.12.00 has been confirmed) by subtracting the processing time and the transport time between customer 1 and dispatch center 3 set. As shown in FIG. 3, the respective transport times to the manufacturers / suppliers 5 are then subtracted at the adjusted delivery times

(Shoes.com: 06.12.00; books.com: 06.12.00; music.com: 04.12.00) to ensure the common arrival date in dispatch center 3. These delivery times are then communicated to the manufacturers / suppliers 5, so that intermediate storage, in order to complete the shipment for the purchaser, is no longer necessary when these delivery times are realized. The dashed Arrow indicates that the data can also be transmitted separately to independent manufacturers / suppliers. It is favorable if a single online provider 2, which leads to further online providers / manufacturers 5, coordinates the shipping. In order to avoid late delivery times to the customer, the earliest possible delivery times are compared with the manufacturers / suppliers 5. If a specified time difference is exceeded, the articles will not be sent to the customer together. If properties and dimensions of the articles are also included in the database 4, it can be determined if required whether the ordered articles can be sent in a package. If there are several manufacturers / suppliers 5 to choose from, they are selected according to the shortest possible transport routes.

Claims

Determining the earliest possible delivery time t _at i _B by the purchaser (1) by adding the transport time between delivery center (3) and the purchaser (1) t _TransVß to spätesten arrival time t _Arr and adding a loading processing time when sending service,

- Transmission of at least one proposal Vt ^ i _E ≥ t ^ i _E for the delivery time from the shipping service to the customer (1) for confirmation,

- Transmission of the confirmed delivery time B _tAn ι _B from the customer (1) to the shipping service,

Postponing the delivery times of the manufacturers / suppliers (5) based on the earliest possible delivery date to the customer (1) by the time difference between the confirmed and the earliest possible delivery date.

3. The method according to claim 1, characterized in that the transport times t _Trans v between the manufacturers / suppliers (5) and the shipping center (3) together with the earliest possible delivery _times t _{AusH reported} ^to the shipping service and stored in the database (4).

4. The method according to claim 1, characterized in that to determine the current transport _times t _TransH v between the manufacturer / supplier (5) and the shipping center (3), these are continuously determined, stored and statistically evaluated.

5. The method of claim 1, so that a single online provider (2) who coordinates the shipping leads to several sub-online providers (5).

6. The method according to claim 1, characterized in that the earliest delivery times of the articles at the manufacturer / supplier (5) with each other are compared and if a specified time difference is exceeded, the articles are not sent together to the customer (1).

7. The method according to claim 1, characterized in that the size of the articles and their properties are also stored in the database (4), if necessary it is checked whether they can be sent in a package and, if the result of the check is positive, they are sent in a package ,

8. The method according to claim 1, which also means that several possible manufacturers / suppliers (5) make a selection for a specific article with regard to the shortest possible transport routes to the customer and / or the earliest possible delivery times.

9. The method according to claim 1, so that the customer (1) selects the shipping service.