Routing and scheduling in a flexible job shop by tabu search
Annals of Operations Research - Special issue on Tabu search
Nonsystematic backtracking search
Nonsystematic backtracking search
A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation
Computers and Industrial Engineering
A constraint-based architecture for local search
OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Effective Neighborhood Functions for the Flexible Job Shop Problem
Effective Neighborhood Functions for the Flexible Job Shop Problem
An Advanced Tabu Search Algorithm for the Job Shop Problem
Journal of Scheduling
Ant colony optimization combined with taboo search for the job shop scheduling problem
Computers and Operations Research
Computers and Operations Research
A genetic algorithm for the Flexible Job-shop Scheduling Problem
Computers and Operations Research
An artificial immune algorithm for the flexible job-shop scheduling problem
Future Generation Computer Systems
A Knowledge-Based Ant Colony Optimization for Flexible Job Shop Scheduling Problems
Applied Soft Computing
Discrepancy search for the flexible job shop scheduling problem
Computers and Operations Research
Expert Systems with Applications: An International Journal
Parallel meta2heuristics for the flexible job shop problem
ICAISC'10 Proceedings of the 10th international conference on Artifical intelligence and soft computing: Part II
Combining Constraint Programming and Local Search for Job-Shop Scheduling
INFORMS Journal on Computing
A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers
Applied Soft Computing
Large neighborhood search for dial-a-ride problems
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
A new hybrid genetic algorithm for job shop scheduling problem
Computers and Operations Research
Iterative flattening search for the flexible job shop scheduling problem
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Large neighborhood search and adaptive randomized decompositions for flexible jobshop scheduling
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
| Hi-index | 0.01 |
The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem (JSP), where each operation is allowed to be processed by any machine from a given set, rather than one specified machine. In this paper, two algorithm modules, namely hybrid harmony search (HHS) and large neighborhood search (LNS), are developed for the FJSP with makespan criterion. The HHS is an evolutionary-based algorithm with the memetic paradigm, while the LNS is typical of constraint-based approaches. To form a stronger search mechanism, an integrated search heuristic, denoted as HHS/LNS, is proposed for the FJSP based on the two algorithms, which starts with the HHS, and then the solution is further improved by the LNS. Computational simulations and comparisons demonstrate that the proposed HHS/LNS shows competitive performance with state-of-the-art algorithms on large-scale FJSP problems, and some new upper bounds among the unsolved benchmark instances have even been found.