 |
A three-phases matheuristic for the SALB3PM problem
1 : Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes
Ecole Nationale Supérieure des Mines de St Etienne, Centre National de la Recherche Scientifique, Université Clermont Auvergne, Institut national polytechnique Clermont Auvergne
This paper addresses the Simple Assembly Line Balancing Problem with Power Peak Minimization (SALB3PM). We propose to divide the problem into three subproblems: task sequencing, workstation assignment, and task scheduling. Until the stopping criterion is not satisfied, a new workstation assignment is randomly generated, or an insertion movement is performed, and then tasks are scheduled. In this work, our method uses dynamic and mathematical programming in a matheuristic approach.
