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

Authors:
Hanen Akrout;Bassem Jarboui;Patrick Siarry;Abdelwaheb Rebaï
Affiliations:
GIAD, FSEGS, Sfax, Tunisie 3018;GIAD, FSEGS, Sfax, Tunisie 3018 and Institut Supérieur de Commerce et de Comptabilité de Bizerte, Zarzouna, Tunisie 7021;LiSSi, Université de Paris 12, Créteil, France 94010;GIAD, FSEGS, Sfax, Tunisie 3018
Venue:
Computational Optimization and Applications
Year:
2012

Citing 10
Cited 1

Minimizing total tardiness on one machine is NP-hard

Mathematics of Operations Research
A GRASP for a difficult single machine scheduling problem

Computers and Operations Research
Scheduling in a sequence dependent setup environment with genetic search

Computers and Operations Research - Special issue on genetic algorithms
A GRASP for single machine scheduling with sequence dependent setup costs and linear delay penalties

Computers and Operations Research
Variable neighborhood search

Computers and Operations Research
Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization
Scheduling under machine breakdown in a continuous process industry

Computers and Operations Research
An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups

Computers and Operations Research
Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic

Expert Systems with Applications: An International Journal
The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times

Discrete Optimization

An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.