.png){kind=icon}
Return
A discrete artificial bee colony algorithm for single machine scheduling problems
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2016.1185550.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a discrete artificial bee colony algorithm for a single machine earliness-tardiness scheduling problem. The objective of single machine earliness-tardiness scheduling problems is to find a job sequence that minimises the total sum of earliness-tardiness penalties. Artificial bee colony (ABC) algorithm is a swarm-based meta-heuristic, which mimics the foraging behaviour of honey bee swarms. In this study, several modifications to the original ABC algorithm are proposed for adapting the algorithm to efficiently solve combinatorial optimisation problems like single machine scheduling. In proposed study, instead of using a single search operator to generate neighbour solutions, random selection from an operator pool is employed. Moreover, novel crossover operators are presented and employed with several parent sets with different characteristics to enhance both exploration and exploitation behaviour of the proposed algorithm. The performance of the presented meta-heuristic is evaluated on several benchmark problems in detail and compared with the state-of-the-art algorithms. Computational results indicate that the algorithm can produce better solutions in terms of solution quality, robustness and computational time when compared to other algorithms.
Keywords:
scheduling
single machine
artificial bee colony algorithm
meta-heuristics
combinatorial optimisation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W
Organization
Cited Papers
Reduced white matter microstructural integrity correlates with cognitive deficits in minimal hepatic encephalopathy.png)
Gut
GutIF0
PREAI
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSaveShareSave
View more