Minimize Maximal Regret to Enhance Reliability in Flexible Open-Shop Problem

Within flexible manufacturing systems, scheduling and routing of products play a crucial role in the production chain. Therefore, it is essential to maintain acceptable performance levels by implementing intelligent product dispatching on machines, especially in the case of delayed processing time due to unforeseen events. This work examines a simplified version of a real production cell to assess whether using a minimax regret cost function can yield a valuable solution for solving the associated flexible open-shop scheduling problem under uncertain processing time. Results from a limited instance indicate the potential of employing this approach when obtaining the optimal solution is computationally demanding due to the existence of numerous alternative paths for products.