A hybrid discrete particle swarm optimization-genetic algorithm for multi-task scheduling problem in service oriented manufacturing systems

To cope with the task scheduling problem under multi-task and transportation consideration in large-scale service oriented manufacturing systems (SOMS), a service allocation optimization mathematical model was established, and then a hybrid discrete particle swarm optimization-genetic algorithm (HDP...

Full description

Saved in:
Bibliographic Details
Published inJournal of Central South University Vol. 23; no. 2; pp. 421 - 429
Main Authors Wu, Shan-yu, Zhang, Ping, Li, Fang, Gu, Feng, Pan, Yi
Format Journal Article
LanguageEnglish
Published Changsha Central South University 01.02.2016
Subjects
Online AccessGet full text
ISSN2095-2899
2227-5223
DOI10.1007/s11771-016-3087-z

Cover

More Information
Summary:To cope with the task scheduling problem under multi-task and transportation consideration in large-scale service oriented manufacturing systems (SOMS), a service allocation optimization mathematical model was established, and then a hybrid discrete particle swarm optimization-genetic algorithm (HDPSOGA) was proposed. In SOMS, each resource involved in the whole life cycle of a product, whether it is provided by a piece of software or a hardware device, is encapsulated into a service. So, the transportation during production of a task should be taken into account because the hard-services selected are possibly provided by various providers in different areas. In the service allocation optimization mathematical model, multi-task and transportation were considered simultaneously. In the proposed HDPSOGA algorithm, integer coding method was applied to establish the mapping between the particle location matrix and the service allocation scheme. The position updating process was performed according to the cognition part, the social part, and the previous velocity and position while introducing the crossover and mutation idea of genetic algorithm to fit the discrete space. Finally, related simulation experiments were carried out to compare with other two previous algorithms. The results indicate the effectiveness and efficiency of the proposed hybrid algorithm.
ISSN:2095-2899
2227-5223
DOI:10.1007/s11771-016-3087-z