Minimizing the number of late jobs on parallel machines with alpha time windows

Vincent Jeauneau 1 Philippe Chrétienne 1
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : We consider the problem of minimization the number of late jobs on parallel machines in presence of alpha time windows (di = ri + pi + alpha for all jobs). We prove the NPcompleteness of this problem even when m = 2 and di = d for all jobs. We develop a lower bound by solving a minimum cost flow problem associated to a relaxation of the problem. A set of heuristics are presented to minimize the number of late jobs based on a job-focused and machine-focused approach. A simulation experiment is realized to test the effectiveness of heuristics regarding the lower bound. This simulation has been computed for 1; 2; 5; 10; 15 and 20 machines and it shows that the best heuristic has an average deviation to the bound of 4.88%, 6.35%, 7.38%, 7.5%, 7.87% and 7.64% respectively.
Type de document :
Communication dans un congrès
6th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2013), Aug 2013, Gent, Belgium
Liste complète des métadonnées

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

https://hal.archives-ouvertes.fr/hal-00922087
Contributeur : Vincent Jeauneau <>
Soumis le : lundi 23 décembre 2013 - 15:07:00
Dernière modification le : jeudi 22 novembre 2018 - 14:36:17
Document(s) archivé(s) le : lundi 24 mars 2014 - 01:15:08

Fichier

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

Identifiants

  • HAL Id : hal-00922087, version 1

Collections

Citation

Vincent Jeauneau, Philippe Chrétienne. Minimizing the number of late jobs on parallel machines with alpha time windows. 6th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2013), Aug 2013, Gent, Belgium. 〈hal-00922087〉

Partager

Métriques

Consultations de la notice

212

Téléchargements de fichiers

196