Mathematical models and an elephant herding optimization for multiprocessor-task exible ow shop scheduling problems in the Manufacturing Resource Planning (MRPII) system

Shop Floor Control (SFC) is one of the main concepts in Manufacturing Resource Planning (MRPII), and production scheduling is a key element in SFC. This paper studies the hybrid ow shop scheduling problem, where jobs are multiprocessors. The objective is to minimize total completion time. Although there are several papers considering the hybrid ow-shop scheduling problem with multiprocessor tasks, none has proposed a mathematical model for this problem. At rst, the two problems (xed and selective cases) are mathematically formulated by mixed integer linear programming models. By using commercial software, the model is used to solve the small instances of the problems. Moreover, an elephant herding optimization is developed to solve large instances of the problems. To numerically evaluate the proposed algorithm, it is compared with three available algorithms in the literature.