Mixed-Model Sequencing Problem with overload minimization considering workstations dependencies

This paper reviews the formulation of the mixed model sequencing problem with workload minimization (MMSP-W). Two significative models already presented in the literature are describe, showing that they are valid for the case of parallel workstations, but do not properly solve the case of serial workstations. After that, a new model is introduced that is valid for the case of serial workstations. An example is used to illustrate the performance of all the models, and a computational experience was done to verify the applicability of the proposed model using the solver CPLEX and a set of problem instances of small dimension adapted from the literature.