Scheduling on flexible flow shop with cost-related objective function considering outsourcing options

This study considers outsourcing decisions in a flexible flow shop scheduling problem, in which each job can be processed by either an in-house production line or outsourced. The selected objective function aims to minimize the weighted sum of tardiness costs, in-house production costs, and outsourcing costs with respect to the jobs due date. The purpose of the problem is to select the jobs that must be processed in-house, schedule processing of the jobs in-house, and finally select and assign other jobs to the subcontractors. We develop a mixed-integer linear programming (MILP) model for the research problem. Regarding the complexity of the research problem, the MILP model cannot be used for large-scale problems. Therefore, four metaheuristic algorithms, including SA, GA, PSO, hybrid PSO-SA, are proposed to solve the problem. Furthermore, some random test problems with different sizes are generated to evaluate the effectiveness of the proposed MILP model and solution approaches. The obtained results demonstrate that the GA can obtain better solutions in comparison to the other algorithms.

Scheduling on flexible flow shop with cost-related objective function considering outsourcing options Keywords:

Flexible flow shop scheduling , outsourcing , cost-related objective functions , Metaheuristic Algorithms