Inventory system

• US 7,546,255 B2
• Filed: 09/17/2003
• Issued: 06/09/2009
• Est. Priority Date: 03/31/2000
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Solia, Luiz Gustavo, de Souza, Pedro Sergio, Cruz, Carlos Fernando Bella, de Silva, Carlos Benjamin
• Primary Examiner(s): Gart; Matthew S.
• Assistant Examiner(s): ADE, OGER GARCIA
• Application Number:
  US10/665,232
• Publication Number:
  US 20040059650A1
• Time in Patent Office: 2,092 Days
• Field of Search: 705/30, 705/26, 705/28
• US Class Current: 705/28
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
• CPC Class Codes: G06Q 10/087 Inventory or stock management, e.g. order filling, procurement or balancing against orders
• CPC Class Codes: G06Q 30/0601 Electronic shopping [e-shopping]
• CPC Class Codes: G06Q 40/12 Accounting

Abstract

A method and system that provides the functions to search for material that would fit an order or search for order that a piece of material would fit. For that, the system considers the technical specification defined in the processing route assigned to the orders, domain-expert knowledge for check for feasible matches, and a flexible plant model to specify valid feasible stock areas for searching. This system allows complete visibility of all material in a plant and its suitability to be applied to the customer orders. A second aspect of this invention is a material re-allocation method and system. In accordance with this system, each coil to be processed by the finishing area receives a surface defect map. This map indicates the location of the defects and their characteristics.

Claims

1. A computer implemented method for allocating finished units in a production facility to orders received from customers for those units, the computer implemented method comprising the steps:

identifying, via one or more computers, orders from customers for finished units;

identifying, via said one or more computers, finished units in production at a defined time and available to fill said orders;

identifying, via said one or more computers, defects in the finished units and defects that the customers are willing to accept;

of said identified finished units, identifying, via said one or more computers, valid units that are available to be assigned to said orders;

for each of the finished units, creating, via said one or more computers, an associated surface defect map indicating the locations of defects in said each finished unit and characteristics of said defects;

using, via said one or more computers, said defect maps to search for the largest area in each of the finished units that can be assigned to each order;

iteratively assigning and unassigning, via said one or more computers, valid units to said orders, in a defined sequence of said orders, until either (i) all the orders are fulfilled, or (ii) there are no more assignment options to be tested, including;

identifying, via said one or more computers, any incomplete orders, and for each identified incomplete order, searching among valid units previously assigned to other orders for a unit that fulfills said identified incomplete order, and

if a unit, previously assigned to some other order, is found that fulfills said identified incomplete order, then, via said one or more computers,

(i) unassigning said found unit from said other order, and (2) re-assigning said found unit to said identified incomplete order.

2. A computer implemented method according to claim 1, wherein:

the step of identifying finished units and orders includes the step of identifying incomplete orders and a due date for each of the incomplete orders;

the step of iteratively assigning and unassigning valid units includes the step of, starting with the incomplete order having the earliest due date, searching among the available valid units for a unit that fulfills said incomplete order.

7. A computer implemented method according to claim 1, wherein:

the finished units are metallic units; and

further comprising the step of identifying, for each of a group of the orders, the largest area of each of a set of the identified metallic units that can be assigned to the order.

10. A computer implemented method according to claim 1, wherein:

the orders have delivery dates; and

the step of iteratively assigning and unassigning valid units includes the step of taking the delivery dates into consideration when iteratively assigning and unassigning valid dates.

11. A computer implemented method according to claim 1, wherein:

the finished units are metallic coils; and

the step of iteratively assigning and unassigning valid units includes the step of allocating each of the orders to precise regions of the coils so that the minimum quality of each order is not violated while minimizing waste of material.

12. A computer implemented method according to claim 1, wherein:

the finished units are metallic coils; and

the step of using said defect maps include the step of, for each of said orders, using the surface defect maps to identify precise regions of the coils that will satisfy said each order.

3. A system for allocating finished units in a production facility to orders received from customers for those units, the system comprising:

means for identifying orders from customers for finished units;

means for identifying finished units in production at a defined time and available to fill said orders;

means for identifying defects in the finished units and defects that the customers are willing to accept;

means for creating, for each of the finished units, an associated surface defect map indicating the locations of defects in said each finished unit and characteristics of said defects;

means for using said defect maps to search for the largest area in each of the finished units that can be assigned to each order;

means to identify which ones of said identified units are valid units that are available to be assigned to said orders; and

to iteratively assign and unassign valid units to said orders, in a defined sequence of said orders, until either (i) all the orders are fulfilled, or (ii) there are no more assignment options to be tested, including

identifying any incomplete orders, and for each identified incomplete order, searching among valid units previously assigned to other orders for a unit that fUlfills said identified incomplete order, and if a unit, previously assigned to some other order, is found that fulfills said identified incomplete order, then (i) unassigning said found unit from said other order and (2) re-assigning said found unit to said identified incomplete order.

4. system according to claim 3, wherein:

the means for identifying finished units and orders includes means for identifying incomplete orders and a due date for each of the incomplete orders; and

the means for iteratively assigning and unassigning valid units includes means for searching among the available valid units for a unit that fulfills the one of the incomplete orders having the earliest due date.

8. Apparatus according to claim 3, wherein:

the finished units are metallic units; and

further comprising means for identifying, for each of a group of the orders, the largest area of each of a set of the identified metallic units that can be assigned to the order.

5. A program storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform method steps for allocating finished units in a production facility to orders received, said method steps comprising:

identifying orders from customers for finished units;

identifying finished units in production at a defined time and available to fill said orders;

identifying defects in the finished units and defects that the customers are willing to accept;

of said identified finished units, identifying valid units that are available to be assigned to said orders;

for each of the finished units, creating an associated surface defect map indicating the locations of defects in said each finished unit and characteristics of said defects;

using said defect maps to search for the largest area in each of the finished units that can be assigned to each order;

iteratively assigning and unassigning valid units to orders, in a defined sequence of said orders, until either (i) all the orders are fulfilled, or (ii) there are no more assignment options to be tested, including

identifying any incomplete orders, and for each identified incomplete order, searching among valid units previously assigned to other orders for a unit that fulfills said identified incomplete order, and

if a unit, previously assigned to some other order, is found that fulfills said identified incomplete order, then (i) unassigning said found unit from said other order and (2) re-assigning said found unit to said identified incomplete order.

6. A program storage device according to claim 5, wherein:

the step of identifying finished units and orders includes the step of identifying incomplete orders and a due date for each of the incomplete orders;

the step of iteratively assigning and unassigning valid units includes the step of, starting with the incomplete order having the earliest due date, searching among the available valid units for a unit that fulfills said incomplete order.

9. A program storage device according to claim 5, wherein:

the finished units are metallic units; and

the method steps further comprise the step of identifying, for each of a group of the orders, the largest area of each of a set of the identified metallic units that can be assigned to the order.