Preemptive scheduling with position costs

Francis Sourd 1
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : This paper is devoted to basic scheduling problems in which the scheduling cost of a job is not a function of its completion time. Instead, the cost is derived from the integration of a cost function over the time intervals on which the job is processed. This criterion is specially meaningful when job preemption is allowed. Polynomial algorithms are presented to solve some special cases including a one-machine problem with a common due date and a two-machine problem with linear nondecreasing cost functions.
Document type :
Journal articles
Liste complète des métadonnées
Contributor : Lip6 Publications <>
Submitted on : Wednesday, August 19, 2015 - 4:11:11 PM
Last modification on : Thursday, March 21, 2019 - 2:41:20 PM


  • HAL Id : hal-01185261, version 1


Francis Sourd. Preemptive scheduling with position costs. Algorithmic Operations Research, Preeminent Academic Facets, 2006, 1 (2), pp.79-93. 〈hal-01185261〉



Record views