A Greedy Particle Swarm Optimization Algorithm for Workplace Planning in Migrating Workflow

Author

Cheng, Jie ; Zeng, Guangzhou

Author_Institution

Sch. of Comput. Sci. & Technol., Shandong Univ., Jinan

Volume

6

fYear

2008

fDate

18-20 Oct. 2008

Firstpage

407

Lastpage

411

Abstract

Workplace planning is a key problem in migrating workflow system. Different from general resource allocation or task schedule problems, workplace planning is a multi-constrained combinatorial optimization problem, the main objective of which is to minimize the migrating path length. This paper firstly proposes the model of workplace planning problem, and then provides a greedy discrete particle swarm optimization (GDPSO) algorithm for the problem solving. The simulation experimental results demonstrate the effectiveness of the algorithm.

Keywords

combinatorial mathematics; greedy algorithms; particle swarm optimisation; resource allocation; workflow management software; general resource allocation; greedy particle swarm optimization algorithm; migrating workflow; multi-constrained combinatorial optimization problem; task schedule problems; workplace planning; Computer science; Employment; Greedy algorithms; Optimization methods; Particle swarm optimization; Path planning; Problem-solving; Processor scheduling; Resource management; Technology planning; greedy algorithm; migrating workflow; particle swarm optimization; workplace planning;

fLanguage

English

Publisher

ieee

Conference_Titel

Natural Computation, 2008. ICNC '08. Fourth International Conference on

Conference_Location

Jinan

Print_ISBN

978-0-7695-3304-9

Type

conf

DOI

10.1109/ICNC.2008.420

Filename

4667868