Paper Info
Title
An ACO algorithm for makespan minimization in parallel batch machines with non-identical job sizes and incompatible job families.
Abstract
We study the problem of scheduling a set of N jobs with non-identical job sizes from F different families on a set of M parallel batch machines; the objective is to minimize the makespan. The problem is known to be NP-hard. A meta-heuristic based on Max-Min Ant System (MMAS) is presented. The performance of the algorithm is compared with several previously studied algorithms by computational experiments. According to our results, the average distance between the solutions found by our proposed algorithm and the lower bounds is about 4% less than that of the best of all the compared algorithms, demonstrating that our algorithm outperforms the previously studied algorithms. (C) 2015 Elsevier B.V. All rights reserved.
Year
DOI
Venue
2016
10.1016/j.asoc.2015.09.056
Applied Soft Computing
Keywords
Field
DocType
Parallel batch machines,Max–Min Ant System,NP-hard,Incompatible job families,Makespan
Mathematical optimization,Job shop scheduling,Scheduling (computing),Computer science,Algorithm,Minification
Journal
Volume
Issue
ISSN
38
C
1568-4946
Citations 
PageRank 
References 
11
0.48
30
Authors
3
Name
Order
Citations
PageRank
Zhao-Hong Jia1576.70
Chao Wang2895190.04
Joseph Y. -T. Leung32403400.82