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

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

0.00 Avg rating0 Votes
Article ID: iaor20063635
Country: United States
Volume: 16
Issue: 2
Start Page Number: 198
End Page Number: 208
Publication Date: Mar 2004
Journal: INFORMS Journal On Computing
Authors:
Keywords: scheduling, programming: branch and bound
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 ℝd 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.

Reviews

Required fields are marked *. Your email address will not be published.