A GRASP based on DE to solve single machine scheduling problem with SDST |
| |
Authors: | Hanen Akrout Bassem Jarboui Patrick Siarry Abdelwaheb Reba? |
| |
Institution: | (1) Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, Tehran, Iran;(2) Department of Industrial Management, Faculty of Management and Accounting, Shahid Beheshti University G.C., Tehran, Iran; |
| |
Abstract: | When handling combinatorial optimization problems, we try to get the optimal arrangement of discrete entities so that the
requirements and the constraints are satisfied. These problems become more and more important in various industrial and academic
fields. So, over the past years, several techniques have been proposed to solve them. In this paper, we are interested in
the single machine scheduling problem with Sequence-Dependent Setup Times, which can be solved through different approaches.
We present a hybrid algorithm which combines Greedy Randomized Adaptive Search Procedure and Differential Evolution for tackling
this problem. Our algorithm is tested on benchmark instances from the literature. The computational experiments prove the
efficiency of this algorithm. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|