Journal
APPLIED SOFT COMPUTING
Volume 29, Issue -, Pages 379-385Publisher
ELSEVIER
DOI: 10.1016/j.asoc.2015.01.013
Keywords
Single machine bath processing; Non-identical jobs; Artificial bee colony heuristic
Ask authors/readers for more resources
This paper proposes an artificial bee colony approach to minimize the makespan for a single batchprocessing machine. The single batch-processing problem is characterized by discontinuity in the objective function and having integer variables. Since the problem under study is NP-hard, an artificial bee colony approach is proposed. The penalty function method is used to convert the constrained problem to unconstrained problem, which is then solved by the ABC algorithm. A procedure to generate initial solutions is presented, which is based on filling partially filled batches first. The analysis in the article shows that the colony size, the value of the penalty parameter, the penalty function iteration, the ABC iteration, and maximum trials per food source all have a significant effect on the performance of the ABC algorithm; however, no pattern can be established. (C) 2015 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available