Journal ArticleDOI
A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
Jie Gao,Linyan Sun,Mitsuo Gen +2 more
Reads0
Chats0
TLDR
This paper developed a hybrid genetic algorithm (GA) that uses two vectors to represent solutions and developed an efficient method to find assignable time intervals for the deleted operations based on the concept of earliest and latest event time.About:
This article is published in Computers & Operations Research.The article was published on 2008-09-01. It has received 470 citations till now. The article focuses on the topics: Job shop scheduling & Local optimum.read more
Citations
More filters
Journal ArticleDOI
Variable neighbourhood search: methods and applications
TL;DR: Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building heuristics, based upon systematic changes of neighbourhoods both in descent phase, to find a local minimum, and in perturbation phase to emerge from the corresponding valley as mentioned in this paper.
Journal ArticleDOI
Variable neighbourhood search: methods and applications
TL;DR: Variable neighbourhood search is a metaheuristic, or a framework for building heuristics, based upon systematic changes of neighbourhoods both in descent phase, to find a local minimum, and in perturbation phase to emerge from the corresponding valley.
Journal ArticleDOI
An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem
TL;DR: An effective hybrid algorithm which hybridizes the genetic algorithm (GA) and tabu search (TS) has been proposed for the FJSP with the objective to minimize the makespan and the experimental results demonstrate that the proposed HA has achieved significant improvement for solving FJ SP regardless of the solution accuracy and the computational time.
Journal ArticleDOI
An effective genetic algorithm for the flexible job-shop scheduling problem
Guohui Zhang,Liang Gao,Yang Shi +2 more
TL;DR: An improved chromosome representation is used to conveniently represent a solution of the FJSP, and different strategies for crossover and mutation operator are adopted.
Journal ArticleDOI
A research survey: review of flexible job shop scheduling techniques
Imran Ali Chaudhry,Abid Ali Khan +1 more
TL;DR: The paper aims at presenting the development of flexible JSS and a consolidated survey of various techniques that have been employed since 1990 for problem resolution.
References
More filters
Journal ArticleDOI
Variable neighborhood search
Nenad Mladenović,Pierre Hansen +1 more
TL;DR: This chapter presents the basic schemes of VNS and some of its extensions, and presents five families of applications in which VNS has proven to be very successful.
Book
Introduction to sequencing and scheduling
TL;DR: In this article, the authors present an introduction to Sequencing and Scheduling in the context of the Operational Research Society (ORS) and the International Journal of Distributed Sensor Networks (ILS).
Journal ArticleDOI
Variable neighborhood search: Principles and applications
Pierre Hansen,Nenad Mladenović +1 more
TL;DR: In this article, a simple and effective metaheuristic for combinatorial and global optimization, called variable neighborhood search (VNS), is presented, which can easily be implemented using any local search algorithm as a subroutine.
Journal ArticleDOI
Routing and scheduling in a flexible job shop by tabu search
TL;DR: A hierarchical algorithm for the flexible job shop scheduling problem is described, based on the tabu search metaheuristic, which allows to adapt the same basic algorithm to different objective functions.