Translator Disclaimer
Paper
11 November 2004 A desired load distribution scheduling algorithm for general parallel machines
Author Affiliations +
Proceedings Volume 5605, Intelligent Systems in Design and Manufacturing V; (2004) https://doi.org/10.1117/12.568759
Event: Optics East, 2004, Philadelphia, Pennsylvania, United States
Abstract
Scheduling problems concern the allocation of limited resources over time among both parallel and sequential activities. The majority of these problems belong to the class of NP-hard. Agent-based approaches have been recently applied to solve some of these difficult problems, particularly distributed scheduling problems. Load balancing has been adopted as an optimization criterion for several scheduling problems. However, in many practical situations, a load balanced solution may not be feasible or attainable. To deal with this limitation, this paper presents a generic mathematical model of load distribution for resource allocation, called desired load distribution. The objective is to develop a model for scheduling of general parallel machines that can be used both in centralized resource management settings and in agent-based distributed scheduling systems. Unlike many existing agent-based scheduling systems, this model attempts to obtain a global optimal solution through many-to-many task/resource allocation instead of one-to-many negotiation approaches.
© (2004) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yangsheng Li, Weiming Shen, Chun Wang, and Hamada Ghenniwa "A desired load distribution scheduling algorithm for general parallel machines", Proc. SPIE 5605, Intelligent Systems in Design and Manufacturing V, (11 November 2004); https://doi.org/10.1117/12.568759
PROCEEDINGS
10 PAGES


SHARE
Advertisement
Advertisement
Back to Top