Due Date Assignment and JIT Scheduling Problem in Blocking Hybrid Flow Shop Robotic Cells with Multiple Robots and Batch Delivery Cost

摘要

In this paper, just-in-time scheduling problem with batch delivery and due date assignment for hybrid flow shop robotic cells is considered. A mixed integer linear programming (MILP) model is presented to determine the sequence of jobs and robot moves. Two meta-heuristic algorithms including Artificial Immune System (AIS) and Tabu Search (TS) are proposed. The results show that AIS performs well for this problem.