Mixed integer modeling for multiple objective permutation flowshop scheduling

In this paper, we consider the problem of permutation flowshop scheduling (PFSP) with the objective of minimizing the weighted sum of makespan, maximum tardiness and total tardiness in terms of a single objective (Z), and present a general multiple-objective model based on mixed integer programming (MIP) to minimize Z. The problems with multiple objective mentioned above are known as NP-hard types and the proposed MIP is going to find the optimal solution for the given problem. As the problem is NP-complete, this model can only be used for smaller instances where an optimal solution can be computed. For large instances, other models based on heuristic approaches are suitablefor solving the problem.

Keywords:

Mixed integer model programming , Permutation FlowShop Scheduling , Single objectiveoptimization , Multi Objective Optimization