A GRASP based on DE to solve single machine scheduling problem with SDST

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.

DOI: 10.1007/s10589-010-9333-7

7 Figures and Tables

Cite this paper

@article{Akrout2012AGB, title={A GRASP based on DE to solve single machine scheduling problem with SDST}, author={Hanen Akrout and Bassem Jarboui and Patrick Siarry and Abdelwaheb Reba{\"{i}}, journal={Comp. Opt. and Appl.}, year={2012}, volume={51}, pages={411-435} }