<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>0120-5609</journal-id>
<journal-title><![CDATA[Ingeniería e Investigación]]></journal-title>
<abbrev-journal-title><![CDATA[Ing. Investig.]]></abbrev-journal-title>
<issn>0120-5609</issn>
<publisher>
<publisher-name><![CDATA[Facultad de Ingeniería, Universidad Nacional de Colombia.]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S0120-56092022000200206</article-id>
<article-id pub-id-type="doi">10.15446/ing.investig.v42n2.83394</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[An Efficient Algorithm Applied to Optimized Billing Sequencing]]></article-title>
<article-title xml:lang="es"><![CDATA[Un algoritmo eficiente aplicado a la secuencia de facturación optimizada]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Pinto]]></surname>
<given-names><![CDATA[Anderson Rogério Faia]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Nagano]]></surname>
<given-names><![CDATA[Marcelo Seido]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,University of Araraquara  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Brazil</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,University of São Paulo  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Brazil</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>08</month>
<year>2022</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>08</month>
<year>2022</year>
</pub-date>
<volume>42</volume>
<numero>2</numero>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_arttext&amp;pid=S0120-56092022000200206&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_abstract&amp;pid=S0120-56092022000200206&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_pdf&amp;pid=S0120-56092022000200206&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[ABSTRACT This paper addresses the Optimized Billing Sequencing (OBS) problem to maximize billing of the order portfolio of a typical Distribution Center (DC). This is a new problem in the literature, and the search for the best billing mix has generated demands for better optimization methods for DCs. Therefore, the objective of this paper is to provide an effective algorithm that presents quick and optimized solutions for higher-complexity OBS levels. This algorithm is called Iterative Greedy Algorithm (IGA-OBS), and its performance is compared to the genetic algorithm (GA-OBS) by Pinto and Nagano. Performance evaluations were carried out after intense computational experiments for problems with different complexity levels. The results demonstrate that the GA-OBS is limited to medium-size instances, whereas the IGA-OBS is better adapted to reality, providing OBS with solutions with satisfactory time and quality. The IGA-OBS enables managers to make decisions in a more agile and consistent way in terms of the trade-off between the level of customer service and the maximization of the financial result of DCs. This paper fills a gap in the literature, makes innovative contributions, and provides suggestions for further research aimed at developing more suitable optimization methods for OBS.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[RESUMEN Este documento aborda el problema de la Secuenciación Optimizada de Facturación (OBS) para maximizar la facturación de la cartera de pedidos de un centro de distribución (CD) típico. Este es un nuevo problema en la literatura, y la búsqueda de la mejor combinación de facturación ha exigido mejores métodos para optimizar los CD. Por lo tanto, el objetivo de este artículo es proporcionar un algoritmo eficaz que presente soluciones rápidas y optimizadas para niveles más altos de complejidad OBS. Este algoritmo se denomina Algoritmo Voraz Iterativo (IGA-OBS) y su rendimiento se compara con el del algoritmo genético (GA-OBS) de Pinto y Nagano. Se llevaron a cabo evaluaciones de desempeño después de intensos experimentos computacionales para problemas con diferentes niveles de complejidad. Los resultados demuestran que el GA-OBS se limita a instancias de tamaño medio, mientras que el IGA-OBS se adapta mejor a la realidad brindando soluciones en tiempo y calidad satisfactorios a OBS. El IGA-OBS permite a los gerentes tomar decisiones de una manera mas ágil y consistente frente al trade-off entre el nivel de servicio al cliente y la maximización del resultado financiero de los CD. Este artículo llena un vacío en la literatura, aporta contribuciones innovadoras y proporciona sugerencias para futuras investigaciones destinadas a desarrollar métodos de optimización más adecuados para OBS.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[iterative greedy algorithm]]></kwd>
<kwd lng="en"><![CDATA[genetic algorithm]]></kwd>
<kwd lng="en"><![CDATA[maximized billing]]></kwd>
<kwd lng="en"><![CDATA[distribution center]]></kwd>
<kwd lng="es"><![CDATA[algoritmo voraz iterativo]]></kwd>
<kwd lng="es"><![CDATA[algoritmo genético]]></kwd>
<kwd lng="es"><![CDATA[facturación maximizada]]></kwd>
<kwd lng="es"><![CDATA[centro de distribución]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bandyopadhyay]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Bhattacharya]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Solving a tri-objective supply chain problem with modified NSGA-II algorithm]]></article-title>
<source><![CDATA[Journal of Manufacturing Systems]]></source>
<year>2014</year>
<volume>33</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>41-50</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Baud-Lavigne]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Bassetto]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Agard]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A method for a robust optimization of joint product and supply chain design]]></article-title>
<source><![CDATA[Journal of Intelligent Manufacturing]]></source>
<year>2014</year>
<volume>27</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>741-9</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bottani]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Cecconi]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Vignali]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Montanari]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Optimisation of storage allocation in order picking operations through a genetic algorithm]]></article-title>
<source><![CDATA[International Journal of Logistics Research and Applications]]></source>
<year>2012</year>
<volume>15</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>127-46</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Boysen]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[De Koster]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Weidinger]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Warehousing in the e-commerce era: A survey.]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2019</year>
<volume>277</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>396-411</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chien]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Kim]]></surname>
<given-names><![CDATA[K. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Gen]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Advanced decision and intelligence technologies for manufacturing and logistics]]></article-title>
<source><![CDATA[Journal of Intelligent Manufacturing]]></source>
<year>2012</year>
<volume>23</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>2133-5</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[De Jong]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Learning with genetic algorithms: An overview]]></article-title>
<source><![CDATA[Machine Learning]]></source>
<year>1988</year>
<volume>3</volume>
<numero>2-3</numero>
<issue>2-3</issue>
<page-range>121-38</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Diabat]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Hybrid algorithm for a vendor managed inventory system in a two-echelon supply chain]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2014</year>
<volume>238</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>114-21</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Diabat]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Deskoores]]></surname>
<given-names><![CDATA[R. M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid genetic algorithm based heuristic for an integrated supply chain problem]]></article-title>
<source><![CDATA[Journal of Manufacturing Systems]]></source>
<year>2016</year>
<numero>38</numero>
<issue>38</issue>
<page-range>172-80</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gen]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Cheng]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
</person-group>
<source><![CDATA[Network models and optimization: Multiobjective genetic algorithms approach]]></source>
<year>2008</year>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ghiami]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Williams]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Wu]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A two-echelon inventory model for a deteriorating item with stock-dependent demand, partial backlogging and capacity constraints]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2013</year>
<volume>231</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>587-97</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Haq]]></surname>
<given-names><![CDATA[A. N.]]></given-names>
</name>
<name>
<surname><![CDATA[Boddu]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Analysis of enablers for the implementation of leagile supply chain management using an integrated fuzzy QFD approach]]></article-title>
<source><![CDATA[Journal of Intelligent Manufacturing]]></source>
<year>2014</year>
<volume>28</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-12</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Haupt]]></surname>
<given-names><![CDATA[R. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Haupt]]></surname>
<given-names><![CDATA[S. E]]></given-names>
</name>
</person-group>
<source><![CDATA[Practical genetic algorithms]]></source>
<year>2004</year>
<edition>2</edition>
<publisher-name><![CDATA[Wiley]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Holland]]></surname>
<given-names><![CDATA[J. H]]></given-names>
</name>
</person-group>
<source><![CDATA[Adaptation in natural and artificial systems]]></source>
<year>1975</year>
<publisher-name><![CDATA[University of Michigan Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Huang]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Ke]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Pricing decision problem for substitutable products based on uncertainty theory]]></article-title>
<source><![CDATA[Journal of Intelligent Manufacturing]]></source>
<year>2017</year>
<volume>28</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>503-14</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Inkaya]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Akansel]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Coordinated scheduling of the transfer lots in an assembly-type supply chain: a genetic algorithm approach]]></article-title>
<source><![CDATA[Journal of Intelligent Manufacturing]]></source>
<year>2017</year>
<volume>28</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>1005-15</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kumar]]></surname>
<given-names><![CDATA[R. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Tiwari]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Goswami]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Two-echelon fuzzy stochastic supply chain for the manufacturer-buyer integrated production-inventory system]]></article-title>
<source><![CDATA[Journal of Intelligent Manufacturing]]></source>
<year>2016</year>
<volume>27</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>875-88</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ledari]]></surname>
<given-names><![CDATA[A. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Pasandideh]]></surname>
<given-names><![CDATA[S. H. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Koupaei]]></surname>
<given-names><![CDATA[M. N]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new newsvendor policy model for dual-sourcing supply chains by considering disruption risk and special order]]></article-title>
<source><![CDATA[Journal of Intelligent Manufacturing]]></source>
<year>2018</year>
<volume>25</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>1367-76</page-range></nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Leung]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A B2C e-commerce intelligent system for re-engineering the e-order fulfilment process]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Choy]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
<name>
<surname><![CDATA[Siu]]></surname>
<given-names><![CDATA[P. K]]></given-names>
</name>
<name>
<surname><![CDATA[Ho]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
<name>
<surname><![CDATA[Lam]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[C. K]]></given-names>
</name>
</person-group>
<source><![CDATA[Expert Systems with Applications]]></source>
<year>2018</year>
<numero>91</numero>
<issue>91</issue>
<page-range>386-401</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Man]]></surname>
<given-names><![CDATA[K. F]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Genetic algorithms: Concepts and Applications]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Tang]]></surname>
<given-names><![CDATA[K. S]]></given-names>
</name>
<name>
<surname><![CDATA[Kwong]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<source><![CDATA[IEEE Transactions on Industrial Electronics]]></source>
<year>1996</year>
<volume>43</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>519-34</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Matthews]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Order sequencing on a unidirectional cyclical picking line]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Visagie]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2013</year>
<volume>231</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>79-87</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Marchet]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Investigating order picking system adoption: A case-study-based approach]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Melacini]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Perotti]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<source><![CDATA[International Journal of Logistics Research and Applications]]></source>
<year>2015</year>
<volume>18</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>82-98</page-range></nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mousavi]]></surname>
<given-names><![CDATA[S. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Bahreininejad]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Musa]]></surname>
<given-names><![CDATA[S. N.]]></given-names>
</name>
<name>
<surname><![CDATA[Yusof]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A modified particle swarm optimization for solving the integrated location and inventory control problems in a two-echelon supply chain network.]]></article-title>
<source><![CDATA[Journal of Intelligent Manufacturing]]></source>
<year>2017</year>
<volume>28</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>191-206</page-range></nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mousavi]]></surname>
<given-names><![CDATA[S. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Hajipour]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<name>
<surname><![CDATA[Niaki]]></surname>
<given-names><![CDATA[S. T. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Alikar]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Optimizing multi-item multi-period inventory control system with discounted cash flow and inflation: two calibrated meta-heuristic algorithms]]></article-title>
<source><![CDATA[Applied Mathematical Modelling]]></source>
<year>2013</year>
<volume>37</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>2241-56</page-range></nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Park]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Optimization of total inventory cost and order fill rate in a supply chain using PSO]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Kyung]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
</person-group>
<source><![CDATA[The International Journal of Advanced Manufacturing Technology]]></source>
<year>2014</year>
<volume>70</volume>
<numero>9-12</numero>
<issue>9-12</issue>
<page-range>1533-41</page-range></nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pinto]]></surname>
<given-names><![CDATA[A. R. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Crepaldi]]></surname>
<given-names><![CDATA[A. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Nagano]]></surname>
<given-names><![CDATA[M. S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Genetic algorithm applied to pick sequencing for billing]]></article-title>
<source><![CDATA[Journal of Intelligent Manufacturing]]></source>
<year>2018</year>
<volume>29</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>405-22</page-range></nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pinto]]></surname>
<given-names><![CDATA[A. R. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Nagano]]></surname>
<given-names><![CDATA[M. S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An approach for the solution to order batching and sequencing in picking systems]]></article-title>
<source><![CDATA[Production Engineering Research and Development]]></source>
<year>2019</year>
<volume>13</volume>
<numero>3-4</numero>
<issue>3-4</issue>
<page-range>325-41</page-range></nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pinto]]></surname>
<given-names><![CDATA[A. R. F]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Genetic algorithms applied to integration and optimization of billing and picking processes]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Nagano]]></surname>
<given-names><![CDATA[M. S]]></given-names>
</name>
</person-group>
<source><![CDATA[Journal of Intelligent Manufacturing]]></source>
<year>2020</year>
<volume>31</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>641-59</page-range></nlm-citation>
</ref>
<ref id="B28">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Richards]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
</person-group>
<source><![CDATA[Warehouse Management: A complete guide to improving efficiency and minimizing costs in the modern warehouse]]></source>
<year>2011</year>
<publisher-name><![CDATA[Kogan Page]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B29">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rim]]></surname>
<given-names><![CDATA[S. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Park]]></surname>
<given-names><![CDATA[I. S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Order picking plan to maximize the order fill rate]]></article-title>
<source><![CDATA[Computers and Industrial Engineering]]></source>
<year>2008</year>
<volume>55</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>557-66</page-range></nlm-citation>
</ref>
<ref id="B30">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sereshti]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Bijari]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Profit maximization in simultaneous lot-sizing and scheduling problem]]></article-title>
<source><![CDATA[Applied Mathematical Modejjing]]></source>
<year>2013</year>
<volume>37</volume>
<numero>23</numero>
<issue>23</issue>
<page-range>9516-23</page-range></nlm-citation>
</ref>
<ref id="B31">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Seyedrezaei]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Najafi]]></surname>
<given-names><![CDATA[S. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Aghajani]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Valami]]></surname>
<given-names><![CDATA[H. B]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Designing a genetic algorithm to optimize fulfilled orders in order picking planning problem with probabilistic demand]]></article-title>
<source><![CDATA[International Journal]]></source>
<year>2012</year>
<volume>7</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>40-57</page-range></nlm-citation>
</ref>
<ref id="B32">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Slotnick]]></surname>
<given-names><![CDATA[S. A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Order acceptance and scheduling: a taxonomy and review]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2011</year>
<volume>212</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-11</page-range></nlm-citation>
</ref>
<ref id="B33">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[van den Berg]]></surname>
<given-names><![CDATA[J. P]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Models for warehouse management: Classification and examples]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Zijm]]></surname>
<given-names><![CDATA[W. H. M]]></given-names>
</name>
</person-group>
<source><![CDATA[International Journal of Production Economics]]></source>
<year>1999</year>
<volume>59</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>519-28</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
