This Study Examines an Optimization-Based Heuristic Forthe Robotic Cell Problem. This Problem Emerges In Mechanized Cells and Is Anunpredictable Flow Shop Problem With a Solitary Transportation Robot and Ablocking Obligation. We Propose an Inexact Decomposition Algorithm. Theproposed Methodology Breaks the Problem into Two Scheduling Problems That Arefathomed Consecutively: a Flow Shop Problem With Extra Requirements (Blockingand Transportation Times) and a Solitary Machine Problem With Priorityconstraints, Time Slacks, and Setup Times. For Each of These Problems, Wepropose a Careful Extension And-Bound Algorithm. Likewise, We Portray Ahereditary Algorithm That Incorporates, As a Change Specialist, a Neighborhoodseek System. We Report the Outcomes of a Computational Study That Gives Provethat the Proposed Optimization-Based Methodology Conveys Superb Results Andconstantly Beats the Hereditary Algorithm. Be That As It May, the Hereditaryalgorithm Conveys Sensibly Great Results While Obliging Altogether Shorter Cputimes.