Larry M Newbanks

US Patent:

20060069598, Mar 30, 2006

Filed:

Sep 30, 2004

Appl. No.:

10/955266

Inventors:

Michael Schweitzer - Leimen, DE
Edward Huber - Morton IL, US
Marlon McDonald - Tremont IL, US
Michael Monson - Morton IL, US
Larry Newbanks - Peoria IL, US
Gregory McCoy - Brimfield IL, US
Guenther Baermann - Pulheim, DE
Eric Eich - Huerth, DE
Hans Schmitz - Euskirchen, DE
Brian Taylor - Leamington Spa, GB
Michael Czach - Canton MI, US
Ryan Matthews - Livonia MI, US

International Classification:

G06F 17/60

US Classification:

705008000

Abstract:

Systems and methods are disclosed for distributing stock in a distribution network. The distribution network may include a source location and a plurality of target locations. In the disclosed systems and methods, the stock requirements of the target locations may be categorized into a plurality of requirement types, wherein each requirement type reflects a category of stock requirements for one of the target locations. In addition, the plurality of requirement types may be prioritized by order of importance and/or the plurality of target locations may be prioritized for each requirement type based on at least one sequence rule. Based on the prioritized requirement types and/or prioritized sequence of the target locations, the stock may be distributed to the plurality of target locations.

US Patent:

20060074728, Apr 6, 2006

Filed:

Sep 28, 2004

Appl. No.:

10/952668

Inventors:

Michael Schweitzer - Leimen, DE
Edward Huber - Morton IL, US
Marlon McDonald - Tremont IL, US
Michael Monson - Morton IL, US
Larry Newbanks - Peoria IL, US
Guenther Baermann - Pulheim, DE
Michael Czach - Canton MI, US
Eric Eich - Huerth, DE
Hans Schmitz - Euskirchen, DE
Brian Taylor - Leamington Spa, GB
Mark Fishwick - Brighton MI, US
Ryan Matthews - Livonia MI, US

International Classification:

G05B 19/418

US Classification:

705008000

Abstract:

A method and apparatus to efficiently round requested quantities to efficient transportation quantities in the supply chain. Target locations are organized in a sequence. A tolerance interval around the requested quantity is calculated for each target location. The requested value is then rounded to an efficient transportation quantity for each target location in its sequential order.