Facility Layout Linked with Scheduling Problem by Genetic Algorithm and Tabu Search

Access this Article

Search this Article

Abstract

In this paper, we propose a method to solve simultaneously facility layout problem and scheduling problem. About a initial random layout planning, the production scheduling and the transportation scheduling of AGV are obtained by using priority rules. From the obtained transportation scheduling, the critical transportation and the closeness rating are obtained. Facility layout is renewed by the combined procedure of genetic algorithm and tabu search in order to reduce the material handling cost. By using this renewed facility layout, the production scheduling and the transportation scheduling of AGV are also revised until no further improvement is possible.

Journal

  • Memoirs of the Faculty of Engineering, Okayama University

    Memoirs of the Faculty of Engineering, Okayama University 33(1), 59-64, 1998-11-30

    Faculty of Engineering, Okayama University

Codes

  • NII Article ID (NAID)
    120002308989
  • NII NACSIS-CAT ID (NCID)
    AA10699856
  • Text Lang
    ENG
  • Article Type
    departmental bulletin paper
  • ISSN
    0475-0071
  • Data Source
    IR 
Page Top