Loading...
Loading...

Go to the content (press return)

An efficient discrete artificial bee colony algorithm for the blocking flow shop problem with total flowtime minimization

Author
Ribas, I.; Companys, R.; Tort-Martorell, J.
Type of activity
Journal article
Journal
Expert systems with applications
Date of publication
2015-09-01
Volume
42
Number
15-16
First page
6155
Last page
6167
DOI
https://doi.org/10.1016/j.eswa.2015.03.026 Open in new window
Repository
http://hdl.handle.net/2117/28350 Open in new window
URL
http://www.sciencedirect.com/science/article/pii/S0957417415002201 Open in new window
Abstract
This paper presents a high performing Discrete Artificial Bee Colony algorithm for the blocking flow shop problem with flow time criterion. To develop the proposed algorithm, we considered four strategies for the food source phase and two strategies for each of the three remaining phases (employed bees, onlookers and scouts). One of the strategies tested in the food source phase and one implemented in the employed bees phase are new. Both have been proved to be very effective for the problem at ...
Citation
Ribas, I.; Companys , R.; Tort-Martorell, J. An efficient discrete artificial bee colony algorithm for the blocking flow shop problem with total flowtime minimization. "Expert systems with applications", 01 Setembre 2015, vol. 42, núm. 15-16, p. 6155-6167.
Keywords
Blocking, Flow shop, Heuristics, Scheduling, Total flowtime
Group of research
ADBD - Analysis of Complex Data for Business Decisions
SCOM - Supply Chain and Operations Management

Participants