Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithm

Authors:
J. Behnamian;M. Zandieh;S. M. T. Fatemi Ghomi
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, Amirkabir University of Technology, 424 Hafez Avenue, Tehran, Iran
Venue:
Expert Systems with Applications: An International Journal
Year:
2009

Citing 8
Cited 11

Variable neighborhood search

Computers and Operations Research
Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups

Computers and Operations Research
A heuristic algorithm for minimizing mean flow time with unit setups

Information Processing Letters
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
A survey of very large-scale neighborhood search techniques

Discrete Applied Mathematics
Metaheuristics in combinatorial optimization: Overview and conceptual comparison

ACM Computing Surveys (CSUR)
Design and Analysis of Experiments

Design and Analysis of Experiments
Scheduling unrelated parallel machines with sequence-dependent setups

Computers and Operations Research

Design of a scatter search method for a novel multi-criteria group scheduling problem in a cellular manufacturing system

Expert Systems with Applications: An International Journal
Including different kinds of preferences in a multi-objective ant algorithm for time and space assembly line balancing on different Nissan scenarios

Expert Systems with Applications: An International Journal
A heuristic-based hybrid genetic-variable neighborhood search algorithm for task scheduling in heterogeneous multiprocessor system

Information Sciences: an International Journal
An adaptive annealing genetic algorithm for the job-shop planning and scheduling problem

Expert Systems with Applications: An International Journal
Integrating parts design characteristics and scheduling on parallel machines

Expert Systems with Applications: An International Journal
Heuristic algorithms for assigning and scheduling flight missions in a military aviation unit

Computers and Industrial Engineering
Literature review regarding Ant Colony Optimization applied to scheduling problems: Guidelines for implementation and directions for future research

Engineering Applications of Artificial Intelligence
Hybridization of harmony search with variable neighborhood search for restrictive single-machine earliness/tardiness problem

Information Sciences: an International Journal
A hybrid genetic-variable neighborhood search algorithm for the cell formation problem based on grouping efficacy

Computers and Operations Research
A simulated annealing heuristic for minimizing makespan in parallel machine scheduling

SEMCCO'12 Proceedings of the Third international conference on Swarm, Evolutionary, and Memetic Computing
Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs

Computers and Operations Research

Quantified Score

Hi-index	12.06

Visualization

Abstract

This paper proposes a hybrid metaheuristic for the minimization of makespan in scheduling problems with parallel machines and sequence-dependent setup times. The solution approach is robust, fast, and simply structured, and comprises three components: an initial population generation method based on an ant colony optimization (ACO), a simulated annealing (SA) for solution evolution, and a variable neighborhood search (VNS) which involves three local search procedures to improve the population. The hybridization of an ACO, SA with VNS, combining the advantages of these three individual components, is the key innovative aspect of the approach. Two algorithms of a hybrid VNS-based algorithm, SA/VNS and ACO/VNS, and the VNS algorithm presented previously are used to compare with the proposed hybrid algorithm to highlight its advantages in terms of generality and quality for large instances.