A high performing metaheuristic for job shop scheduling with sequence-dependent setup times

Authors:
B. Naderi;S.M.T. Fatemi Ghomi;M. Aminnayeri
Affiliations:
Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, Tehran, Iran;Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, Tehran, Iran;Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, Tehran, Iran
Venue:
Applied Soft Computing
Year:
2010

Citing 10
Cited 4

Convergence of an annealing algorithm

Mathematical Programming: Series A and B
A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies

Computers and Industrial Engineering - Special issue on computational intelligence for industrial engineering
Quality Engineering Using Robust Design

Quality Engineering Using Robust Design
A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups

Computers and Industrial Engineering
Local Search Genetic Algorithms for the Job Shop Scheduling Problem

Applied Intelligence
A simulated annealing algorithm for manufacturing cell formation problems

Expert Systems with Applications: An International Journal
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem

Computers and Operations Research
Scheduling a dynamic job shop production system with sequence-dependent setups: An experimental study

Robotics and Computer-Integrated Manufacturing
An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness

Expert Systems with Applications: An International Journal
A variable neighborhood search for job shop scheduling with set-up times to minimize makespan

Future Generation Computer Systems

A new hybrid multi-objective Pareto archive PSO algorithm for a bi-objective job shop scheduling problem

Expert Systems with Applications: An International Journal
The periodicity and robustness in a single-track train scheduling problem

Applied Soft Computing
A comparison of hybrid genetic algorithm and hybrid particle swarm optimization to minimize makespan for assembly job shop

Applied Soft Computing
Minimizing the total completion time in a distributed two stage assembly system with setup times

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates scheduling job shop problems with sequence-dependent setup times under minimization of makespan. We develop an effective metaheuristic, simulated annealing with novel operators, to potentially solve the problem. Simulated annealing is a well-recognized algorithm and historically classified as a local-search-based metaheuristic. The performance of simulated annealing critically depends on its operators and parameters, in particular, its neighborhood search structure. In this paper, we propose an effective neighborhood search structure based on insertion neighborhoods as well as analyzing the behavior of simulated annealing with different types of operators and parameters by the means of Taguchi method. An experiment based on Taillard benchmark is conducted to evaluate the proposed algorithm against some effective algorithms existing in the literature. The results show that the proposed algorithm outperforms the other algorithms.