Article Dans Une Revue European Journal of Industrial Engineering Année : 2013

Development of lower bounds for the scheduling of setup tasks in serial production lines

Résumé

Efficient production resettings are necessary to achieve production flexibility. For this reason, it is of primary importance to reduce the setup time required to switch the production from one product type to another, and more generally to minimise the loss of production during these resetting phases. In this paper, we investigate the problem of scheduling operations within a production resetting that arises at the ball bearing factories of the SKF group. In the case of full serial production lines, improving the setup times amount to minimising the time spent prior to restarting production. We show that the problem of scheduling operations within a production resetting can be modelled as an unrelated parallel machine scheduling problem, and we propose several lower bounds. The first one is an extension of the improved energetic reasoning to the unrelated parallel machine problem. The second one is based on a preemptive relaxation that includes valid inequalities. We report the results of computational experiments that were carried out on both industrial and generated instances and that provide evidence of the efficacy of the proposed lower bounds.

Fichier non déposé

Dates et versions

hal-01004023 , version 1 (11-06-2014)

Identifiants

Citer

Cédric Pessan, Emmanuel Neron, Mohamed Haouari. Development of lower bounds for the scheduling of setup tasks in serial production lines. European Journal of Industrial Engineering, 2013, 7 (5), pp.558-576. ⟨10.1504/EJIE.2013.057383⟩. ⟨hal-01004023⟩
85 Consultations
0 Téléchargements

Altmetric

Partager

  • More