The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions - Archive ouverte HAL Access content directly
Journal Articles INFORMS Journal of Computing Year : 2004

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

Francis Sourd
  • Function : Author
  • PersonId : 836436

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.

Dates and versions

hal-01185231 , version 1 (19-08-2015)

Identifiers

Cite

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⟩
53 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More