Scheduling flexible mixed shops with multiple processingrestrictions by mixed integer programming

摘要

This paper considers a flexible mixed shop problem with sequence-dependent setup times, recirculation, andrnpossibly non-zero ready times, where the flexible mixed shop is a job shop with blocking. The blocking may occurrnbecause of limited buffer between two consecutive machines. A completed job is not allowed to be released to thernfull buffer feeding the downstream work center, resulting in the current machine being blocked. A disjunctive graphrnis used to represent this problem and helps in developing mixed integer program formulations. The formulations arerngenerated to find optimal operation schedule with the goal of minimizing total weighted tardiness.