A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem

Authors:
Imen Essafi;Yazid Mati;Stéphane Dauzère-Pérès
Affiliations:
IRCCyN - Ecole des Mines de Nantes, CNRS, UMR 6597, La Chantrerie, BP 20722, F-44307 Nantes, France;Al-Qassim University, College of Business & Administration, P.O. 6033, Almelaida, Al-Qassim, Kingdom of Saudi Arabia;Ecole des Mines de St-Etienne, Centre Microélectronique de Provence, Avenue des Anémones, Quartier Saint-Pierre, F-13541 Gardanne, France
Venue:
Computers and Operations Research
Year:
2008

Citing 7
Cited 21

Priority rules for job shops with weighted tardiness costs

Management Science
Job shop scheduling by simulated annealing

Operations Research
New search spaces for sequencing problems with application to job shop scheduling

Management Science
A genetic algorithm for the job shop problem

Computers and Operations Research - Special issue on genetic algorithms
Evolution based learning in a job shop scheduling environment

Computers and Operations Research - Special issue on genetic algorithms
A fast taboo search algorithm for the job shop problem

Management Science
Decomposition methods for large job shops

Computers and Operations Research

Order acceptance using genetic algorithms

Computers and Operations Research
Computing minimal doubly resolving sets of graphs

Computers and Operations Research
A single-machine bi-criterion learning scheduling problem with release times

Expert Systems with Applications: An International Journal
Algorithms for a realistic variant of flowshop scheduling

Computers and Operations Research
A hybrid immune simulated annealing algorithm for the job shop scheduling problem

Applied Soft Computing
Hierarchical Iterated Local Search for the Quadratic Assignment Problem

HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
A hybrid approach to large-scale job shop scheduling

Applied Intelligence
An optimization approach for the job shop scheduling problem

MATH'09 Proceedings of the 14th WSEAS International Conference on Applied mathematics
A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival

Computers and Operations Research
Complex scheduling problems using an optimization methodology

WSEAS Transactions on Information Science and Applications
A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardinessobjective

Computers and Operations Research
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem

Computers and Operations Research
Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times

Computers and Operations Research
A genetic algorithm for the job shop scheduling with a new local search using Monte Carlo method

AIKED'11 Proceedings of the 10th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases
Coupling Genetic Local Search and Recovering Beam Search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates

Computers and Operations Research
Weighted tardiness minimization in job shops with setup times by hybrid genetic algorithm

CAEPIA'11 Proceedings of the 14th international conference on Advances in artificial intelligence: spanish association for artificial intelligence
An optimal procedure for minimizing total weighted resource tardiness penalty costs in the resource-constrained project scheduling problem

Computers and Industrial Engineering
A hybrid local search algorithm for scheduling real-world job shops with batch-wise pending due dates

Engineering Applications of Artificial Intelligence
A study of the single-machine two-agent scheduling problem with release times

Applied Soft Computing
A hybrid differential evolution algorithm for job shop scheduling problems with expected total tardiness criterion

Applied Soft Computing
Enhancing local search algorithms for job shops with min-sum objectives by approximate move evaluation

Journal of Scheduling

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper considers the job-shop problem with release dates and due dates, with the objective of minimizing the total weighted tardiness. A genetic algorithm is combined with an iterated local search that uses a longest path approach on a disjunctive graph model. A design of experiments approach is employed to calibrate the parameters and operators of the algorithm. Previous studies on genetic algorithms for the job-shop problem point out that these algorithms are highly depended on the way the chromosomes are decoded. In this paper, we show that the efficiency of genetic algorithms does no longer depend on the schedule builder when an iterated local search is used. Computational experiments carried out on instances of the literature show the efficiency of the proposed algorithm.