Optimal Static Priority Rules for Stochastic Scheduling with Impatience - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Operations Research Letters Année : 2013

Optimal Static Priority Rules for Stochastic Scheduling with Impatience

Résumé

We consider a stochastic scheduling problem with impatience to the end of service or impatience to the beginning of service. The impatience of a job can be seen as a stochastic due date. Processing times and due dates are random variables. Jobs are processed on a single machine with the objective to minimize the expected weighted number of tardy jobs in the class of static list scheduling policies. We derive optimal schedules when processing times and due dates follow di erent probability distributions.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
static_ibs_ies_gayon.pdf (131.62 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00861365 , version 1 (12-09-2013)

Identifiants

Citer

Alexandre Salch, Jean-Philippe Gayon, Pierre Lemaire. Optimal Static Priority Rules for Stochastic Scheduling with Impatience. Operations Research Letters, 2013, 41 (1), pp.81-85. ⟨10.1016/j.orl.2012.11.008⟩. ⟨hal-00861365⟩
151 Consultations
269 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More