Cédric Pessan (LI, Tours)


"Borne supérieure pour un problème de maximisation de la production 
lors d'un changement de série sur une chaine de production."


Abstract:

Efficient production resettings are necessary to achieve production
flexibility. For this reason, most modern companies are trying to reduce the
setup time required to switch the production from one product type to
another, and more generally to improve production during these resetting
phases. In the case of MDGBB Factories of SKF group, where production line
is organized as a serial-parallel graph, improving setup times consists in
maximizing production during the production resetting. In this paper, we
propose upper bounds for the production occurring during a setup time. The
upper bound that we propose is based on several lower bound computation for
subproblem identified as unrelated machine problem, considering that
objective function consist in minimizing production loss. Each subproblem is
made up of path-linked machines from the beginning of the production line to
its end. Three upper bounds are presented for bounding the global
maximization of the production problem. These methods have been tested on
industrial and generated instances. 

Keywords: Unrelated parallel machines scheduling problem; 
production maximization, upper bound; production resetting.