Patents by Inventor Lisa D. Hardin

Lisa D. Hardin has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 7979155
    Abstract: Aspects of the invention relate to systems and methods for improving a sort plan. According to one embodiment, several groups are formed where each group contains articles having an identifier of a hierarchical structure. In certain embodiments, the identifier may include a geographical indication, such as a postal or ZIP code. Further aspects relate to systems and methods for conducting sort plan optimization where at least some prior data is known or otherwise obtainable. In one embodiment, data relating to the quantity of groups within the sort plan, the quantity of articles associated with each identifier, and/or the quantity of articles within each group may be estimated or known. In certain embodiments, such data may be utilized to assign articles to specific bins, including any available bin, and then optimize the sort plan by selecting at least one bin for improvement.
    Type: Grant
    Filed: February 14, 2008
    Date of Patent: July 12, 2011
    Assignee: Accenture Global Services Limited
    Inventors: Brian J. Moran, Jeffrey S. Owen, Lisa D. Hardin, Ajay K. Easo, Olutayo O. Oladunni
  • Publication number: 20090206013
    Abstract: Aspects of the invention relate to systems and methods for improving a sort plan. According to one embodiment, several groups are formed where each group contains articles having an identifier of a hierarchical structure. In certain embodiments, the identifier may include a geographical indication, such as a postal or ZIP code. Further aspects relate to systems and methods for conducting sort plan optimization where at least some prior data is known or otherwise obtainable. In one embodiment, data relating to the quantity of groups within the sort plan, the quantity of articles associated with each identifier, and/or the quantity of articles within each group may be estimated or known. In certain embodiments, such data may be utilized to assign articles to specific bins, including any available bin, and then optimize the sort plan by selecting at least one bin for improvement.
    Type: Application
    Filed: February 14, 2008
    Publication date: August 20, 2009
    Applicant: Accenture Global Services GmbH
    Inventors: Brian J. Moran, Jeffrey S. Owen, Lisa D. Hardin, Ajay K. Easo, Olutayo O. Oladunni