Minimizing the number of late jobs on parallel machines with alpha time windows - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

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

Vincent Jeauneau
  • Fonction : Auteur
  • PersonId : 950239

Résumé

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.
Fichier principal
Vignette du fichier
Minimizing_the_number_of_late_jobs_on_parallel_machines_with_alpha_time_windows-_VJ-_PC.pdf (299.64 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00922087 , version 1 (23-12-2013)

Identifiants

  • HAL Id : hal-00922087 , version 1

Citer

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⟩
133 Consultations
153 Téléchargements

Partager

Gmail Facebook X LinkedIn More