The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions

Francis Sourd 1
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : This paper focuses on the continuous assignment problem with the eventual aim to solve scheduling problems with irregular cost functions. It consists of partitioning a region of Rd into subregions of prescribed volumes so that the total cost is minimized. The dual problem of the continuous assignment problem is an unconstrained maximization of a non-smooth concave function. The preemptive variant of the scheduling problem with irregular cost functions corresponds to the one-dimensional continuous assignment problem and a lower bound for the non-preemptive variant can be derived. It is computationally tested in a branch-and-bound algorithm.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01185231
Contributor : Lip6 Publications <>
Submitted on : Wednesday, August 19, 2015 - 2:57:48 PM
Last modification on : Thursday, March 21, 2019 - 2:16:26 PM

Links full text

Identifiers

Citation

Francis Sourd. The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions. INFORMS Journal of Computing, 2004, 16 (2), pp.198-208. ⟨10.1287/ijoc.1030.0034⟩. ⟨hal-01185231⟩

Share

Metrics

Record views

59