Stochastic Scheduling with Abandonments - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Stochastic Scheduling with Abandonments

Résumé

In this paper, we address the problem of dynamically scheduling jobs with abandonments. Processing times and release dates are arbitrarily distributed while patience times are exponentially distributed. The objective is to minimize holding costs and abandonment costs, either in the class of static list scheduling policies or in the class of dynamic policies with preemption. We first show an equivalence between holding costs and abandonment costs. When processing times are exponentially distributed and all jobs are available at time 0, we provide conditions under which a strict priority rule is optimal in the class of static list scheduling policies. Then we extend this result to the class of dynamic scheduling policy with preemption and arbitrary stochastic release dates.
Fichier non déposé

Dates et versions

hal-00787710 , version 1 (12-02-2013)

Identifiants

  • HAL Id : hal-00787710 , version 1

Citer

Alexandre Salch, Jean-Philippe Gayon, Pierre Lemaire. Stochastic Scheduling with Abandonments. ILS 2012, 4th International Conference on Information Systems, Logistics and Supply Chain, Aug 2012, Québec, Canada. ⟨hal-00787710⟩
103 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More