The single machine just-in-time scheduling problem with preemptions - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

The single machine just-in-time scheduling problem with preemptions

Yann Hendel
  • Fonction : Auteur
  • PersonId : 996782
Francis Sourd
  • Fonction : Auteur
  • PersonId : 836436

Résumé

This paper deals with a variation of the single machine earliness/tardiness scheduling problem: preemption is allowed and, in order to penalize job interruptions, earliness costs depend on the starting time of the job while tardiness costs depend on the end times as in the usual models. We propose dominance properties and a polynomial time algorithm is given to solve the particular case where the sequence of the start and completion of the jobs is fixed.
Fichier non déposé

Dates et versions

hal-01420474 , version 1 (20-12-2016)

Identifiants

  • HAL Id : hal-01420474 , version 1

Citer

Yann Hendel, Francis Sourd. The single machine just-in-time scheduling problem with preemptions. Multidisciplinary International Conference on Scheduling: Theory and Applications, Jul 2005, New York, United States. pp.140-148. ⟨hal-01420474⟩
73 Consultations
0 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More