<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>596</id>
    <completedYear/>
    <publishedYear>2016</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>441</pageFirst>
    <pageLast>446</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>1</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Implementing Meta-heuristics for AS/RS Picking Scheduling in Support of Production Lines</title>
    <abstract language="eng">Most research in the past mainly considers AS/RS in distribution environment. In this study, we consider AS/RS in the support of an assembly line having multiple cells. For the coordination between the assembly line and the AS/RS, we implemented metaheuristics with Tabu algorithm to solve the sequencing of tasks having picking and put-away operations in support of a Toyota manufacturing system where production lines are composed of cells to assemble simultaneously a variety of products such as auto parts, electronic devices, etc. In this paper, three Tabu heuristic algorithms were devised with variations in search and exchange. The first algorithm (TI) is a regular Tabu search with special initial solution strategy; the second algorithm (TID) combines TI with divide and conquer search strategy; the third algorithm (TIE) is TI with special exchange strategy. We experimented on an AS/RS – production system having 40 assembly cells and an AS/RS with capacity of 1600 baskets for holding materials for assembly. By making 30 runs for each of the above three algorithms, we found that that TIE performs the best, followed by TID and then TI. It also demonstrates that Tabu search can help the operation of AS/RS by reducing 5-30% of shop floor assembly time while TIE can obtain a sequence solution in the best possible time by saving 54.9% of the computation time over TI.</abstract>
    <parentTitle language="eng">Proceedings of the 21st International Symposium on Logistics "Sustainable Transport and Supply Chain Innovation", Kaohsiung, Taiwan</parentTitle>
    <identifier type="url">https://isl21.org/wp-content/uploads/2016/09/Final-proceeding-with-abstract-update-OCT-05.pdf</identifier>
    <author>Mei-hui Chen</author>
    <author>Wen-kang Huang</author>
    <author>Peik Bremer</author>
    <author>Kune-muh Tsai</author>
    <collection role="institutes" number="fwi">Fakultät Wirtschaftsingenieurwesen</collection>
    <collection role="Autoren" number="bremer">Peik Bremer</collection>
  </doc>
</export-example>
