Lagrangian Relaxation for Multiprocessor Task Scheduling Problem with Variable Job Profiles

Abstract:

Article Preview

In this paper the multiprocessor task scheduling problem with variable job profile is addressed. Such problem originates from many practical resource assignment contexts. Based on discretized parameters, the problem is formulated as an integer programming model. Due to the complexity of the problem, a Lagrangian relaxation is applied to solve the problem. The numerical experiment demonstrates the effectiveness of our algorithm procedure.

Info:

Periodical:

Advanced Materials Research (Volumes 156-157)

Edited by:

Jingtao Han, Zhengyi Jiang and Sihai Jiao

Pages:

633-637

DOI:

10.4028/www.scientific.net/AMR.156-157.633

Citation:

X. L. Han et al., "Lagrangian Relaxation for Multiprocessor Task Scheduling Problem with Variable Job Profiles", Advanced Materials Research, Vols. 156-157, pp. 633-637, 2011

Online since:

October 2010

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.