A client/server based parallel genetic algorithm for parallel machines scheduling problem with penalties

Shicheng Hu; Yongdong Xu; Yang Liu; Hong He; Xiaoping Li

doi:10.1166/asl.2012.2234

A client/server based parallel genetic algorithm for parallel machines scheduling problem with penalties

Shicheng Hu^*
, Yongdong Xu
, Yang Liu
, Hong He
, Xiaoping Li

^*Corresponding author for this work

School of Computer Science and Technology, Harbin Institute of Technology
School of Economics and Management, Harbin Institute of Technology Weihai
Shandong University
Southeast University, Nanjing

Research output: Contribution to journal › Article › peer-review

Abstract

A problem of n independent jobs with different ready times and due dates to be scheduled on m parallel machines which aimed at minimizing the total tardiness penalties is considered. The decomposition and combination characteristics of the problem are studied. Based on the two characteristics a client/server based parallel calculation mode is designed, in which the server and client are responsible for the search of the global and local optimality, respectively. Following this mode, a parallel genetic algorithm which is composed of two cooperative processes assignment and ordering is developed. The experimental results are compared to an adapted algorithm to show the more prominent performances of the proposed algorithm.

Original language	English
Pages (from-to)	538-541
Number of pages	4
Journal	Advanced Science Letters
Volume	6
DOIs	https://doi.org/10.1166/asl.2012.2234
State	Published - 2012
Externally published	Yes

Keywords

Client/server
Parallel genetic algorithm
Parallel machine scheduling

Access to Document

10.1166/asl.2012.2234

Cite this

@article{52f2b6771b5c4ae2839c005e11c10772,

title = "A client/server based parallel genetic algorithm for parallel machines scheduling problem with penalties",

abstract = "A problem of n independent jobs with different ready times and due dates to be scheduled on m parallel machines which aimed at minimizing the total tardiness penalties is considered. The decomposition and combination characteristics of the problem are studied. Based on the two characteristics a client/server based parallel calculation mode is designed, in which the server and client are responsible for the search of the global and local optimality, respectively. Following this mode, a parallel genetic algorithm which is composed of two cooperative processes assignment and ordering is developed. The experimental results are compared to an adapted algorithm to show the more prominent performances of the proposed algorithm.",

keywords = "Client/server, Parallel genetic algorithm, Parallel machine scheduling",

author = "Shicheng Hu and Yongdong Xu and Yang Liu and Hong He and Xiaoping Li",

year = "2012",

doi = "10.1166/asl.2012.2234",

language = "英语",

volume = "6",

pages = "538--541",

journal = "Advanced Science Letters",

issn = "1936-6612",

publisher = "American Scientific Publishers",

}

TY - JOUR

T1 - A client/server based parallel genetic algorithm for parallel machines scheduling problem with penalties

AU - Hu, Shicheng

AU - Xu, Yongdong

AU - Liu, Yang

AU - He, Hong

AU - Li, Xiaoping

PY - 2012

Y1 - 2012

N2 - A problem of n independent jobs with different ready times and due dates to be scheduled on m parallel machines which aimed at minimizing the total tardiness penalties is considered. The decomposition and combination characteristics of the problem are studied. Based on the two characteristics a client/server based parallel calculation mode is designed, in which the server and client are responsible for the search of the global and local optimality, respectively. Following this mode, a parallel genetic algorithm which is composed of two cooperative processes assignment and ordering is developed. The experimental results are compared to an adapted algorithm to show the more prominent performances of the proposed algorithm.

AB - A problem of n independent jobs with different ready times and due dates to be scheduled on m parallel machines which aimed at minimizing the total tardiness penalties is considered. The decomposition and combination characteristics of the problem are studied. Based on the two characteristics a client/server based parallel calculation mode is designed, in which the server and client are responsible for the search of the global and local optimality, respectively. Following this mode, a parallel genetic algorithm which is composed of two cooperative processes assignment and ordering is developed. The experimental results are compared to an adapted algorithm to show the more prominent performances of the proposed algorithm.

KW - Client/server

KW - Parallel genetic algorithm

KW - Parallel machine scheduling

UR - https://www.scopus.com/pages/publications/84861499176

U2 - 10.1166/asl.2012.2234

DO - 10.1166/asl.2012.2234

M3 - 文章

AN - SCOPUS:84861499176

SN - 1936-6612

VL - 6

SP - 538

EP - 541

JO - Advanced Science Letters

JF - Advanced Science Letters

ER -

A client/server based parallel genetic algorithm for parallel machines scheduling problem with penalties

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this