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

Authors:
B. Naderi;M. Zandieh;A. Khaleghi Ghoshe Balagh;V. Roshanaei
Affiliations:
Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, Tehran, Iran;Department of Industrial Management, Management and Accounting Faculty, Shahid Beheshti University, G.C., Tehran, Iran;Department of Industrial Engineering, Iran University of Science and Technology, Farjam Avenue, Tehran, Iran;Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, Tehran, Iran
Venue:
Expert Systems with Applications: An International Journal
Year:
2009

Citing 7
Cited 9

Convergence of an annealing algorithm

Mathematical Programming: Series A and B
An effective hybrid optimization strategy for job-shop scheduling problems

Computers and Operations Research
Quality Engineering Using Robust Design

Quality Engineering Using Robust Design
An Electromagnetism-like Mechanism for Global Optimization

Journal of Global Optimization
Design and Analysis of Experiments

Design and Analysis of Experiments
Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics

Computers and Operations Research
A combinatorial particle swarm optimisation for solving permutation flowshop problems

Computers and Industrial Engineering

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

Applied Soft Computing
Addressing a nonlinear fixed-charge transportation problem using a spanning tree-based genetic algorithm

Computers and Industrial Engineering
Genetic algorithms for coordinated scheduling of production and air transportation

Expert Systems with Applications: An International Journal
A hybrid method for flowshops scheduling with condition-based maintenance constraint and machines breakdown

Expert Systems with Applications: An International Journal
The allocation of customers to potential distribution centers in supply chain networks: GA and AIA approaches

Applied Soft Computing
Solving a capacitated fixed-charge transportation problem by artificial immune and genetic algorithms with a Prüfer number representation

Expert Systems with Applications: An International Journal
Moving object detection and tracking by using annealed background subtraction method in videos: Performance optimization

Expert Systems with Applications: An International Journal
A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties

Expert Systems with Applications: An International Journal
A simulated annealing algorithm based approach for balancing and sequencing of mixed-model U-lines

Computers and Industrial Engineering

Quantified Score

Hi-index	12.06

Visualization

Abstract

In this communication, we strive to apply a novel simulated annealing to consider scheduling hybrid flowshop problems to minimize both total completion time and total tardiness. To narrow the gap between the theory and the practice of the hybrid flowshop scheduling, we integrate two realistic and practical assumptions which are sequence-dependent setup and transportation times into our problem. We apply a metaheuristic based on simulated annealing (SA) which strikes a compromise between intensification and diversification mechanisms to augment the competitive performance of our proposed SA. A comprehensive calibration of different parameters and operators are done. We employ Taguchi method to select the optimum parameters with the least possible number of experiments. For the purpose of performance evaluation of our proposed algorithm, we generate a benchmark against which the adaptations of high performing algorithms in the literature are brought into comparison. Moreover, we investigate the impacts of increase of number of jobs on the performance of our algorithm. The efficiency and effectiveness of our hybrid simulated annealing are inferred from all the computational results obtained in various situations.