An integer linear programming model for group scheduling in hybrid flow shops

Group scheduling within the context of sequence-dependent setup times, unrelated parallel machines, and machine eligibility constraints in hybrid flow shops is strived in this paper. An integer linear programming (ILP) model for group scheduling in hybrid flow shops based on completion time of operations is proposed and it solves both interrelated problems in parallel