The phenomenon of deadlock in robotic cells has been long ignored by most scheduling literature. A deadlock situation arises if a part cannot change its current state indefinitely since the destination machine is occupied by another part. The probability of the deadlock occurrence is likely to be large when the processing route cannot be predicted with certainty due to inspection processes. Our focus here is on a specific robotic cell with a post-process inspection system where the inspection is performed on an independent inspection machine. Avoidance and recovery policies are applied to overcome deadlocks originated from this cell. We develop these policies to prevent deadlock or alternatively resolve it during the online implementation of cycles. The former policy minimizes the storage cost, whereas the later policy minimizes the expected cycle time. An analysis of the scheduling problem that involves timings and costs is also carried out for comparing policies.