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...

Celý popis

Podrobná bibliografia

Vydané v:	International journal of parallel, emergent and distributed systems Ročník 21; číslo 5; s. 303 - 321
Hlavní autori:	Suresh, S., Mani, V., Omkar, S. N., Kim, H. J.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Taylor & Francis Group 01.10.2006
Predmet:	Divisible loads Genetic algorithms Processing time Scheduling problems Sequencing
ISSN:	1744-5760, 1744-5779
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!