Data Envelopment Analysis-based Scenario Selection for Sequencing Pattern in a Simulated Robotic Cell

Abstract

In this study, the performance of suggested scenarios for part input sequences in a 3-machine robotic cell producing different parts is determined through the application of data envelopment analysis (DEA) and the Banker–Charnes–Cooper model. A single gripper robot supports the manufacturing process by loading and unloading products and moving them inside the system. This study addresses random machine failures and repairs to minimize cycle time based on two robot move cycles in a three-machine robotic cell and overall production costs. Here, simulation assists in the modeling of uncertainty and a simulation-based optimization approach is applied to find the best scenarios for sequencing patterns in the cell through several numerical examples using DEA. The results displayed that, efficient scenarios satisfying minimum time and cost, are those, in which the percentages of operations assigned to the machines are close to each other. This enables decision-makers in manufacturing systems to make precise selections of the optimal part sequencing pattern with the lowest production cost and cycle time for robotic cells.