Title
Parallel machine scheduling with splitting jobs by a hybrid differential evolution algorithm
Abstract
The problem of parallel machine scheduling for minimizing the makespan is an open scheduling problem with extensive practical relevance. It has been proved to be non-deterministic polynomial hard. Considering a job's batch size greater than one in the real manufacturing environment, this paper investigates into the parallel machine scheduling with splitting jobs. Differential evolution is employed as a solution approach due to its distinctive feature, and a new crossover method and a new mutation method are brought forward in the global search procedure, according to the job splitting constraint. A specific local search method is further designed to gain a better performance, based on the analytical result from the single product problem. Numerical experiments on the performance of the proposed hybrid DE on parallel machine scheduling problems with splitting jobs covering identical and unrelated machine kinds and a realistic problem are performed, and the results indicate that the algorithm is feasible and efficient.
Year
DOI
Venue
2013
10.1016/j.cor.2012.12.007
Computers & OR
Keywords
DocType
Volume
parallel machine scheduling,hybrid differential evolution algorithm,new mutation method,job splitting constraint,new crossover method,parallel machine scheduling problem,open scheduling problem,splitting job,unrelated machine kind,realistic problem,single product problem
Journal
40
Issue
ISSN
Citations 
5
0305-0548
0
PageRank 
References 
Authors
0.34
6
5
Name
Order
Citations
PageRank
Wan-Liang Wang123539.16
Hai-yan Wang291.33
Yanwei Zhao33513.48
Li-Ping Zhang400.34
Xinli Xu57910.92