Divisible load scheduling in distributed system with buffer constraints: genetic algorithm and linear programming approach

Scheduling divisible loads in a single-level tree network/system with processors having finite buffer size is addressed. In earlier studies in divisible load scheduling the processors are assumed to have no buffer constraints or have infinite buffer capacity. Hence, the processing time and the load...

Full description

Bibliographic Details

Published in:	International journal of parallel, emergent and distributed systems Vol. 21; no. 5; pp. 303 - 321
Main Authors:	Suresh, S., Mani, V., Omkar, S. N., Kim, H. J.
Format:	Journal Article
Language:	English
Published:	Taylor & Francis Group 01.10.2006
Subjects:	Divisible loads Genetic algorithms Processing time Scheduling problems Sequencing
ISSN:	1744-5760, 1744-5779
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!