A GRASP based on DE to solve single machine scheduling problem with SDST
- 212 Downloads
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.
KeywordsScheduling single machine Greedy randomized adaptive search procedure Differential evolution Sequence-dependent setup times Total tardiness
Unable to display preview. Download preview PDF.
- 8.Festa, P., Pardalos, P.M., Resende, M.G.C., Ribeiro, C.C.: GRASP and VNS for Max-Cut. In: Extended Abstracts of the Fourth Metaheuristics International Conference, pp. 371–376, Porto, July (2001) Google Scholar
- 24.Ragatz, G.L.: A branch-and-bound method for minimum tardiness sequencing on a single processor with sequence dependent setup times. In: Proceedings of the twenty-fourth annual meeting of the Decision Sciences Institute, pp. 1375–1377 (1993) Google Scholar
- 28.Sun, X., Noble, J.S., Klein, C.M.: Single-machine scheduling with sequence dependent setup to minimize total weighted squared tardiness. IIE Trans. 31, 113–124 (1999) Google Scholar