On scheduling malleable jobs to minimise the total weighted completion time

Ruslan Sadykov 1, 2
1 Realopt - Reformulations based algorithms for Combinatorial Optimization
LaBRI - Laboratoire Bordelais de Recherche en Informatique, IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Abstract : This paper is about scheduling parallel jobs, i.e. which can be executed on more than one processor at the same time. Malleable jobs is a special class of parallel jobs. The number of processors a malleable job is executed on may change during the execution. In this work, we consider the NP-hard problem of scheduling malleable jobs to minimize the total weighted completion time or mean weighted flow time. For this problem, we introduce an important dominance rule which can be used to reduce the search space while searching for an optimal solution.
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download

https://hal.inria.fr/inria-00339646
Contributor : Ruslan Sadykov <>
Submitted on : Tuesday, November 18, 2008 - 2:49:21 PM
Last modification on : Thursday, January 11, 2018 - 6:22:12 AM
Long-term archiving on : Monday, June 7, 2010 - 9:41:37 PM

File

ascending_incom.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00339646, version 1

Citation

Ruslan Sadykov. On scheduling malleable jobs to minimise the total weighted completion time. 13th IFAC Symposium on Information Control Problems in Manufacturing, Jun 2009, Moscow, Russia. ⟨inria-00339646⟩

Share

Metrics

Record views

380

Files downloads

362