The majority of literature has been focused on the objective of minimizing the total order picking time. In practice, there are might be other important criteria, for example, lead time and tardiness.Elsayed et al. (1993) present a heuristic for batching
orders that have due dates with the objective to minimize arliness and tardiness penalties. Elsayed and Lee (1996) consider batching and sequencing of both storage and retrieval orders such that the total tardiness of the retrieval orders is minimized. Cormier(1987) propose a heuristic for batching and sequencing orders to minimize the weighted sum of order picking time and tardiness in an AS/RS.Won and Olafsson (2005) develop mathematical models and heuristics that solve the joint problem
of order batching and picking considering both picking efficiency and order lead time.