QAD 2017 Enterprise Edition > User Guides > Warehousing > Algorithms
  
Algorithms
The following topics describe the purpose of the warehouse algorithms that control how locations are found in which to put away stock items, and from which to pick stock for orders. They also list the standard algorithms that are supplied with QAD Warehousing.
About Algorithms
Describes when algorithms are used and lists and describes algorithm types.
Algorithm Type Maintenance
Lists the basic types of algorithms and describes how to use Algorithm Type Maintenance (4.6.1) to modify them.
Algorithm Master Maintenance
Explains how to use Algorithm Master Maintenance (4.6.5) to modify the descriptions of individual algorithms or add new algorithms to any category0.
Algorithm Assignment
Explains how to use Algorithm Assignment Maintenance (4.6.9) to link a sequence of algorithms to a defined combination of transaction types, sites, warehouses, item number or warehouse item type, or address.
Simulation
Lists and describes different types of simulations.
Algorithm Listings
Lists existing algorithms by category.
Algorithm Master Report
Describes how and when to use Algorithm Master Report (4.6.7).
About Algorithms
Algorithms are used both for putting inventory away in warehouse locations and for selecting locations from which to pick inventory when filling sales orders or works orders. Each algorithm is a program that takes into account a particular set of criteria for choosing the location. A wide range of standard algorithms are provided with QAD Warehousing, but you can add custom programs to perform special functions if the standard algorithms do not meet your requirements.
Although the purpose of the algorithms is basically either putting inventory in locations or finding locations to take inventory out of, several types of algorithms exist, listed in Algorithm Types.

Algorithm Types
 
Type
Code
Description
Container Move
CM
Container move algorithms find suitable stage, truck, and dock locations, including empty locations, locations with the least goods, and locations that already contain stock for an SO shipper or DO ship-to code.
Lane
LA
Lane algorithms find suitable shipping lanes, including empty lanes, lanes with the best load, and lanes for a given carrier.
Location Find
LF
Location-find algorithms find suitable locations for inventory in the functional storage locations—the receipt, inspection, packing, and dispatch areas. LF algorithms do not consider the quantity of the inventory or the capacity of the relevant locations.
Put Away
PA
Put-away algorithms find suitable locations for storage of inventory in the non-functional storage locations—your main storage and picking locations. PA algorithms always take into account the quantity of the inventory to be put away and the capacity of the relevant locations.
Picking
PK
Picking algorithms find suitable locations from which to pick inventory to fulfil orders. You can have designated picking areas, but you can also allow picking from locations in your bulk storage or other areas. Different PK algorithms consider the available picking locations in different sequences.
Inspection
QA
Quality sampling algorithms define whether inspection must take place. When conditions for inspection are met, a sample is sent to an inspection area. Based on the internal routing definition, an inspection tag is printed, and inventory status is changed—to a non-available status, for instance.
Shortage Clearance
SC
Shortage clearance algorithms cut out unnecessary inventory movements by identifying newly received stock that can be used to fill sales or work order shortages directly. Instead of finding suitable storage locations for the inventory, and then picking stock to fill the back orders, SC algorithms move the inventory directly from the receipt area to the packing or dispatch area. This function is also known by the name cross- docking. See Cross-Docking.
Within each of these categories, QAD Warehousing provides a wide range of algorithms that perform the same basic activity, but satisfy different selection criteria.
Example: During put-away, you can look for empty storage locations or you can select the most popular locations.
You can make sure that the system uses the right criteria for any given circumstance by linking algorithms to inventory transaction types, and also specifying any combination of site, warehouse, item number, item type, and supplier or customer address. In this way, you can arrange to pick stock from one set of locations when the item is item A and the customer is customer X, but you can specify a different set of locations, or even a different site or warehouse, when another item number or another customer is involved.
All of these detailed adjustments to the way inventory is put away and picked are made using the options on the Algorithms menu.
The standard algorithms supplied with the system are listed in Algorithm Listings. The descriptions associated with each algorithm provide a brief explanation of the precise function performed.
Note: As part of continuous product development, additional algorithms are defined from time to time, so the number supplied can increase.