DI-UMONS : Dépôt institutionnel de l’université de Mons

Recherche transversale
Rechercher
(titres de publication, de périodique et noms de colloque inclus)
2013-03-01 - Article/Dans un journal avec peer-review - Anglais - 15 page(s)

Dhouib E., Teghem Jacques , Loukil T., "Minimizing the Number of Tardy Jobs in a Permutation Flowshop Scheduling Problem with Setup Times and Time Lags Constraints" in Journal of Mathematical Modelling and Algorithms, 12, 1, 85-99

  • Edition : Springer, Berlin (Germany)
  • Codes CREF : Recherche opérationnelle (DI1150), Méthodes quantitatives de gestion (DI4363)
  • Unités de recherche UMONS : Mathématique et Recherche opérationnelle (F151)
  • Instituts UMONS : Institut de Recherche en Technologies de l’Information et Sciences de l’Informatique (InforTech)
  • Centres UMONS : Centre de Recherche en Technologie de l’Information (CRTI)

Abstract(s) :

(Anglais) This paper studies the permutation flowshop scheduling problem with sequence dependent setup times and time lags constraints minimizing the number of tardy jobs. Dependent setup times are defined as the work to prepare the machines between two successive jobs. Time lags are defined as intervals of time that must exist between every couple of successive operations of the same job. Two mathematical programming formulations are proposed for the considered problem. A simulated annealing algorithm is also developed to solve the problem. Computational experiments are presented and discussed.