Tabu search algorithms to minimize the total tardiness in a flow shop production and outbound distribution scheduling problem

Abstract : —In this paper, we consider a production and out-bound distribution scheduling problem, coming from a real life problem in a chemotherapy production center. Only one vehicle with infinite capacity is available for delivery. The production workshop is an m-machine flow shop. To each job is associated a processing time per machine, a location site and a delivery due date. The travel times are known. The problem is to define a production schedule, batches of jobs, and delivery routes for each batch, so that the sum of tardiness is minimized. Heuristic algorithms are proposed and evaluated on random data sets.
Type de document :
Communication dans un congrès
International Conference on Industrial Engineering and Systems Management (IESM’2015), Oct 2015, Seville, Spain
Liste complète des métadonnées

Littérature citée [23 références]  Voir  Masquer  Télécharger

https://hal-univ-tours.archives-ouvertes.fr/hal-01245919
Contributeur : Jean-Charles Billaut <>
Soumis le : mercredi 7 février 2018 - 15:31:56
Dernière modification le : mardi 9 octobre 2018 - 11:46:07
Document(s) archivé(s) le : samedi 5 mai 2018 - 01:40:52

Fichier

articleIESM_2015v2_QCT_JCB_JLB...
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01245919, version 1

Collections

Citation

Quang Chieu Ta, Jean-Charles Billaut, Jean-Louis Bouquard. Tabu search algorithms to minimize the total tardiness in a flow shop production and outbound distribution scheduling problem. International Conference on Industrial Engineering and Systems Management (IESM’2015), Oct 2015, Seville, Spain. 〈hal-01245919〉

Partager

Métriques

Consultations de la notice

36

Téléchargements de fichiers

20