TY - JOUR
ID - 82797
TI - Local search based meta-heuristic algorithms for optimizing the cyclic flexible manufacturing cell problem
JO - Annals of Optimization Theory and Practice
JA - AOTP
LA - en
SN - 2588-3666
AU - Vizvari, Bela
AU - Guden, Huseyin
AU - G. Nejad, Mazyar
AD - Department of Industrial Engineering, Eastern Mediterranean University, Mersin 10, Turkey
AD - Department of Industrial Engineering, Girne American University, Mersin 10, Turkey
Y1 - 2018
PY - 2018
VL - 1
IS - 3
SP - 15
EP - 32
KW - scheduling
KW - Flexible manufacturing system
KW - Robotic cell
KW - Metaheuristic
DO - 10.22121/aotp.2019.148030.1015
N2 - Flexible robotic cells are used in many real-life industries to produce standardized items at a high production speed. Determining the schedules of these cells is an important optimization problem in those industries. In this study, the cell's machines are identical and parallel. In the cell, there is an input and an output buffer wherein items being processed and the finished items are kept, respectively. There is a robot performing the loading/unloading operations of the machines and transporting the items. The system repeats a cycle in its run. Each machine processes one part in each cycle. The cycle time depends on the order of the loading/unloading activities. Therefore, determining the order of these activities for the minimum cycle time is needed. We propose a new mathematical model to solve the problem. For large size problems, three metaheuristic algorithms based on local search algorithm are proposed. In the metaheuristics, in order to compute the minimum cycle time of a given solution a linear programming model is needed to be solved which is one of the recent cases in the literature to the best of our knowledge. Several numerical examples are solved by the proposed algorithms and their performance and solutions are compared.
UR - http://aotp.fabad-ihe.ac.ir/article_82797.html
L1 - http://aotp.fabad-ihe.ac.ir/article_82797_3dcfff483a096f274e55cdd83cb23036.pdf
ER -